./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a12aada2256a7483e8803a0f1fb8477c858b141679e1395c89cdfba20292c4b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:57,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:57,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:57,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:57,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:57,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:57,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:57,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:57,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:57,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:57,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:57,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:57,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:57,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:57,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:57,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:57,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:57,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:57,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:57,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:57,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:57,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:57,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:57,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:57,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:57,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:57,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:57,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:57,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:57,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:57,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:57,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:57,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:57,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:57,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:57,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:57,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:57,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:57,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:57,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:57,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:57,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:57,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:57,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:57,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:57,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:57,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:57,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:57,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:57,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:57,585 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:57,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:57,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:57,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:57,586 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:57,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:57,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:57,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:57,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:57,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:57,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:57,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:57,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:57,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:57,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:57,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:57,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:57,589 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:57,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:57,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:57,590 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 -> 0a12aada2256a7483e8803a0f1fb8477c858b141679e1395c89cdfba20292c4b [2022-02-20 19:59:57,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:57,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:57,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:57,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:57,789 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:57,790 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.06.cil-1.c [2022-02-20 19:59:57,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0e4346a/95b81d0439d14613a7b9c94e81d8812d/FLAG152d407ae [2022-02-20 19:59:58,178 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:58,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c [2022-02-20 19:59:58,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0e4346a/95b81d0439d14613a7b9c94e81d8812d/FLAG152d407ae [2022-02-20 19:59:58,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0e4346a/95b81d0439d14613a7b9c94e81d8812d [2022-02-20 19:59:58,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:58,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:58,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:58,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:58,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:58,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c46063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58, skipping insertion in model container [2022-02-20 19:59:58,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:58,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:58,757 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.06.cil-1.c[911,924] [2022-02-20 19:59:58,803 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.06.cil-1.c[8416,8429] [2022-02-20 19:59:58,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:58,863 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:58,886 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.06.cil-1.c[911,924] [2022-02-20 19:59:58,912 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.06.cil-1.c[8416,8429] [2022-02-20 19:59:58,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:58,966 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:58,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58 WrapperNode [2022-02-20 19:59:58,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:58,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:58,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:58,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:58,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,038 INFO L137 Inliner]: procedures = 67, calls = 80, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 735 [2022-02-20 19:59:59,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:59,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:59,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:59,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:59,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:59,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:59,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:59,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:59,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:59,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:59,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:59,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:59,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:59,153 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:59,156 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:59,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:59,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:59,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:59,157 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:59,157 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:59,157 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:59,157 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:59,238 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:59,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:59,847 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:59,848 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 19:59:59,924 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:59,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:59,941 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-02-20 19:59:59,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:59 BoogieIcfgContainer [2022-02-20 19:59:59,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:59,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:59,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:59,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:59,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:58" (1/3) ... [2022-02-20 19:59:59,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd3d966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:59, skipping insertion in model container [2022-02-20 19:59:59,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (2/3) ... [2022-02-20 19:59:59,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd3d966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:59, skipping insertion in model container [2022-02-20 19:59:59,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:59" (3/3) ... [2022-02-20 19:59:59,951 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-1.c [2022-02-20 19:59:59,954 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:59,955 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:00,015 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:00,022 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:00,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 301 states have (on average 1.611295681063123) internal successors, (485), 309 states have internal predecessors, (485), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-20 20:00:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:00,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:00,068 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:00,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:00,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1638147849, now seen corresponding path program 1 times [2022-02-20 20:00:00,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:00,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19002269] [2022-02-20 20:00:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#(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); {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:00,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:00,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {362#(= ~q_read_ev~0 2)} #1302#return; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {403#(= |old(~q_read_ev~0)| 0)} assume true; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {403#(= |old(~q_read_ev~0)| 0)} {362#(= ~q_read_ev~0 2)} #1304#return; {361#false} is VALID [2022-02-20 20:00:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#true} havoc ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume 1 == ~p_dw_pc~0; {360#true} is VALID [2022-02-20 20:00:00,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {360#true} is VALID [2022-02-20 20:00:00,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} #res := ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,455 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {360#true} {360#true} #1298#return; {360#true} is VALID [2022-02-20 20:00:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#true} havoc ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume 1 == ~c_dr_pc~0; {360#true} is VALID [2022-02-20 20:00:00,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {360#true} is VALID [2022-02-20 20:00:00,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} #res := ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,462 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {360#true} {360#true} #1300#return; {360#true} is VALID [2022-02-20 20:00:00,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#(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; {360#true} is VALID [2022-02-20 20:00:00,463 INFO L272 TraceCheckUtils]: 1: Hoare triple {360#true} call #t~ret8 := is_do_write_p_triggered(); {360#true} is VALID [2022-02-20 20:00:00,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} havoc ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} assume 1 == ~p_dw_pc~0; {360#true} is VALID [2022-02-20 20:00:00,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {360#true} is VALID [2022-02-20 20:00:00,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} #res := ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,465 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {360#true} {360#true} #1298#return; {360#true} is VALID [2022-02-20 20:00:00,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {360#true} is VALID [2022-02-20 20:00:00,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {360#true} assume !(0 != ~tmp~1); {360#true} is VALID [2022-02-20 20:00:00,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {360#true} call #t~ret9 := is_do_read_c_triggered(); {360#true} is VALID [2022-02-20 20:00:00,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {360#true} havoc ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {360#true} assume 1 == ~c_dr_pc~0; {360#true} is VALID [2022-02-20 20:00:00,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {360#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {360#true} is VALID [2022-02-20 20:00:00,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {360#true} #res := ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,468 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {360#true} {360#true} #1300#return; {360#true} is VALID [2022-02-20 20:00:00,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {360#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {360#true} is VALID [2022-02-20 20:00:00,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {360#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {360#true} is VALID [2022-02-20 20:00:00,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,470 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {360#true} {361#false} #1306#return; {361#false} is VALID [2022-02-20 20:00:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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; {360#true} is VALID [2022-02-20 20:00:00,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {360#true} is VALID [2022-02-20 20:00:00,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#true} {361#false} #1308#return; {361#false} is VALID [2022-02-20 20:00:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#true} havoc ~__retres1~2; {360#true} is VALID [2022-02-20 20:00:00,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {360#true} is VALID [2022-02-20 20:00:00,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} #res := ~__retres1~2; {360#true} is VALID [2022-02-20 20:00:00,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {360#true} {361#false} #1310#return; {361#false} is VALID [2022-02-20 20:00:00,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {360#true} is VALID [2022-02-20 20:00:00,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {360#true} is VALID [2022-02-20 20:00:00,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(= ~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; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {362#(= ~q_read_ev~0 2)} call update_channels1(); {400#(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:00,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#(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); {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:00,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:00,496 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {401#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {362#(= ~q_read_ev~0 2)} #1302#return; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {362#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:00,500 INFO L272 TraceCheckUtils]: 12: Hoare triple {362#(= ~q_read_ev~0 2)} call fire_delta_events1(); {402#(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:00,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {402#(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; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {403#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {403#(= |old(~q_read_ev~0)| 0)} assume true; {403#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:00,501 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {403#(= |old(~q_read_ev~0)| 0)} {362#(= ~q_read_ev~0 2)} #1304#return; {361#false} is VALID [2022-02-20 20:00:00,502 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#false} call activate_threads1(); {404#(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:00,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#(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; {360#true} is VALID [2022-02-20 20:00:00,502 INFO L272 TraceCheckUtils]: 19: Hoare triple {360#true} call #t~ret8 := is_do_write_p_triggered(); {360#true} is VALID [2022-02-20 20:00:00,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {360#true} havoc ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {360#true} assume 1 == ~p_dw_pc~0; {360#true} is VALID [2022-02-20 20:00:00,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {360#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {360#true} is VALID [2022-02-20 20:00:00,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {360#true} #res := ~__retres1~0; {360#true} is VALID [2022-02-20 20:00:00,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,503 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {360#true} {360#true} #1298#return; {360#true} is VALID [2022-02-20 20:00:00,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {360#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {360#true} is VALID [2022-02-20 20:00:00,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {360#true} assume !(0 != ~tmp~1); {360#true} is VALID [2022-02-20 20:00:00,504 INFO L272 TraceCheckUtils]: 28: Hoare triple {360#true} call #t~ret9 := is_do_read_c_triggered(); {360#true} is VALID [2022-02-20 20:00:00,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {360#true} havoc ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {360#true} assume 1 == ~c_dr_pc~0; {360#true} is VALID [2022-02-20 20:00:00,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {360#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {360#true} is VALID [2022-02-20 20:00:00,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {360#true} #res := ~__retres1~1; {360#true} is VALID [2022-02-20 20:00:00,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,505 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {360#true} {360#true} #1300#return; {360#true} is VALID [2022-02-20 20:00:00,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {360#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {360#true} is VALID [2022-02-20 20:00:00,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {360#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {360#true} is VALID [2022-02-20 20:00:00,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,506 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {360#true} {361#false} #1306#return; {361#false} is VALID [2022-02-20 20:00:00,506 INFO L272 TraceCheckUtils]: 39: Hoare triple {361#false} call reset_delta_events1(); {402#(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:00,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {402#(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; {360#true} is VALID [2022-02-20 20:00:00,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {360#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {360#true} is VALID [2022-02-20 20:00:00,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,507 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {360#true} {361#false} #1308#return; {361#false} is VALID [2022-02-20 20:00:00,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 20:00:00,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {361#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; {361#false} is VALID [2022-02-20 20:00:00,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 20:00:00,507 INFO L272 TraceCheckUtils]: 47: Hoare triple {361#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {360#true} is VALID [2022-02-20 20:00:00,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {360#true} havoc ~__retres1~2; {360#true} is VALID [2022-02-20 20:00:00,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {360#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {360#true} is VALID [2022-02-20 20:00:00,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {360#true} #res := ~__retres1~2; {360#true} is VALID [2022-02-20 20:00:00,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 20:00:00,510 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {360#true} {361#false} #1310#return; {361#false} is VALID [2022-02-20 20:00:00,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {361#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; {361#false} is VALID [2022-02-20 20:00:00,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {361#false} assume 0 != eval1_~tmp___1~0#1; {361#false} is VALID [2022-02-20 20:00:00,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {361#false} assume !(0 == ~p_dw_st~0); {361#false} is VALID [2022-02-20 20:00:00,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {361#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; {361#false} is VALID [2022-02-20 20:00:00,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {361#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; {361#false} is VALID [2022-02-20 20:00:00,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {361#false} assume !(0 == ~c_dr_pc~0); {361#false} is VALID [2022-02-20 20:00:00,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {361#false} assume 2 == ~c_dr_pc~0; {361#false} is VALID [2022-02-20 20:00:00,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {361#false} do_read_c_~a~0#1 := ~a_t~0; {361#false} is VALID [2022-02-20 20:00:00,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {361#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; {361#false} is VALID [2022-02-20 20:00:00,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {361#false} assume !(~p_last_write~0 == ~c_last_read~0); {361#false} is VALID [2022-02-20 20:00:00,516 INFO L272 TraceCheckUtils]: 63: Hoare triple {361#false} call error1(); {361#false} is VALID [2022-02-20 20:00:00,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 20:00:00,517 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:00,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:00,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19002269] [2022-02-20 20:00:00,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19002269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:00,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:00,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:00,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994786093] [2022-02-20 20:00:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:00,527 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:00,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:00,531 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:00,584 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:00,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:00,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:00,604 INFO L87 Difference]: Start difference. First operand has 357 states, 301 states have (on average 1.611295681063123) internal successors, (485), 309 states have internal predecessors, (485), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) 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:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,593 INFO L93 Difference]: Finished difference Result 842 states and 1321 transitions. [2022-02-20 20:00:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:03,593 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:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:03,594 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:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1321 transitions. [2022-02-20 20:00:03,615 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:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1321 transitions. [2022-02-20 20:00:03,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1321 transitions. [2022-02-20 20:00:04,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1321 edges. 1321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:04,490 INFO L225 Difference]: With dead ends: 842 [2022-02-20 20:00:04,491 INFO L226 Difference]: Without dead ends: 497 [2022-02-20 20:00:04,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:04,497 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 665 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:04,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 2031 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-02-20 20:00:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 458. [2022-02-20 20:00:04,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:04,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 20:00:04,547 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 20:00:04,548 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 20:00:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,575 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-02-20 20:00:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-02-20 20:00:04,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 497 states. [2022-02-20 20:00:04,581 INFO L87 Difference]: Start difference. First operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 497 states. [2022-02-20 20:00:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,598 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-02-20 20:00:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-02-20 20:00:04,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:04,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 383 states have (on average 1.4986945169712793) internal successors, (574), 390 states have internal predecessors, (574), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 20:00:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 677 transitions. [2022-02-20 20:00:04,618 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 677 transitions. Word has length 65 [2022-02-20 20:00:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:04,618 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 677 transitions. [2022-02-20 20:00:04,619 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:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 677 transitions. [2022-02-20 20:00:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:04,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:04,620 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:04,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:04,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:04,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -977930807, now seen corresponding path program 1 times [2022-02-20 20:00:04,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:04,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616412340] [2022-02-20 20:00:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {3215#(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); {3216#(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:04,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {3216#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3216#(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:04,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3216#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3177#(= ~q_write_ev~0 ~q_read_ev~0)} #1302#return; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {3216#(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); {3217#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {3217#(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; {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3177#(= ~q_write_ev~0 ~q_read_ev~0)} #1304#return; {3176#false} is VALID [2022-02-20 20:00:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#true} havoc ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume 1 == ~p_dw_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {3175#true} #res := ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3175#true} {3175#true} #1298#return; {3175#true} is VALID [2022-02-20 20:00:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#true} havoc ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume 1 == ~c_dr_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3175#true} #res := ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3175#true} {3175#true} #1300#return; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {3219#(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; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L272 TraceCheckUtils]: 1: Hoare triple {3175#true} call #t~ret8 := is_do_write_p_triggered(); {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} havoc ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3175#true} assume 1 == ~p_dw_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3175#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} #res := ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3175#true} {3175#true} #1298#return; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {3175#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {3175#true} assume !(0 != ~tmp~1); {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L272 TraceCheckUtils]: 10: Hoare triple {3175#true} call #t~ret9 := is_do_read_c_triggered(); {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {3175#true} havoc ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {3175#true} assume 1 == ~c_dr_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3175#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3175#true} is VALID [2022-02-20 20:00:04,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {3175#true} #res := ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3175#true} {3175#true} #1300#return; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {3175#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {3175#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,738 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3175#true} {3176#false} #1306#return; {3176#false} is VALID [2022-02-20 20:00:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3216#(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); {3175#true} is VALID [2022-02-20 20:00:04,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3175#true} is VALID [2022-02-20 20:00:04,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3175#true} {3176#false} #1308#return; {3176#false} is VALID [2022-02-20 20:00:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#true} havoc ~__retres1~2; {3175#true} is VALID [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3175#true} is VALID [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} #res := ~__retres1~2; {3175#true} is VALID [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,766 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3175#true} {3176#false} #1310#return; {3176#false} is VALID [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3175#true} is VALID [2022-02-20 20:00:04,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {3175#true} is VALID [2022-02-20 20:00:04,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {3177#(= ~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; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3215#(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:04,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {3215#(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); {3216#(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:04,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3216#(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:04,769 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3216#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3177#(= ~q_write_ev~0 ~q_read_ev~0)} #1302#return; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3177#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:04,770 INFO L272 TraceCheckUtils]: 12: Hoare triple {3177#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3216#(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:04,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {3216#(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); {3217#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {3217#(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; {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:04,772 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3218#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3177#(= ~q_write_ev~0 ~q_read_ev~0)} #1304#return; {3176#false} is VALID [2022-02-20 20:00:04,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {3176#false} call activate_threads1(); {3219#(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:04,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {3219#(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; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L272 TraceCheckUtils]: 19: Hoare triple {3175#true} call #t~ret8 := is_do_write_p_triggered(); {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {3175#true} havoc ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#true} assume 1 == ~p_dw_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#true} #res := ~__retres1~0; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,772 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3175#true} {3175#true} #1298#return; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {3175#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {3175#true} assume !(0 != ~tmp~1); {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L272 TraceCheckUtils]: 28: Hoare triple {3175#true} call #t~ret9 := is_do_read_c_triggered(); {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {3175#true} havoc ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {3175#true} assume 1 == ~c_dr_pc~0; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {3175#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {3175#true} #res := ~__retres1~1; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3175#true} {3175#true} #1300#return; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {3175#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {3175#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3175#true} is VALID [2022-02-20 20:00:04,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3175#true} {3176#false} #1306#return; {3176#false} is VALID [2022-02-20 20:00:04,774 INFO L272 TraceCheckUtils]: 39: Hoare triple {3176#false} call reset_delta_events1(); {3216#(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:04,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {3216#(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); {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {3175#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3175#true} {3176#false} #1308#return; {3176#false} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {3176#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; {3176#false} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-02-20 20:00:04,774 INFO L272 TraceCheckUtils]: 47: Hoare triple {3176#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {3175#true} havoc ~__retres1~2; {3175#true} is VALID [2022-02-20 20:00:04,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {3175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3175#true} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {3175#true} #res := ~__retres1~2; {3175#true} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 20:00:04,775 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3175#true} {3176#false} #1310#return; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {3176#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; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {3176#false} assume 0 != eval1_~tmp___1~0#1; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {3176#false} assume !(0 == ~p_dw_st~0); {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {3176#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; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {3176#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; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {3176#false} assume !(0 == ~c_dr_pc~0); {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {3176#false} assume 2 == ~c_dr_pc~0; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {3176#false} do_read_c_~a~0#1 := ~a_t~0; {3176#false} is VALID [2022-02-20 20:00:04,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {3176#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; {3176#false} is VALID [2022-02-20 20:00:04,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {3176#false} assume !(~p_last_write~0 == ~c_last_read~0); {3176#false} is VALID [2022-02-20 20:00:04,776 INFO L272 TraceCheckUtils]: 63: Hoare triple {3176#false} call error1(); {3176#false} is VALID [2022-02-20 20:00:04,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-02-20 20:00:04,776 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:04,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:04,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616412340] [2022-02-20 20:00:04,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616412340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:04,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:04,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:04,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083432118] [2022-02-20 20:00:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:04,778 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:04,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:04,778 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:04,816 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:04,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:04,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:04,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:04,817 INFO L87 Difference]: Start difference. First operand 458 states and 677 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:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,750 INFO L93 Difference]: Finished difference Result 855 states and 1243 transitions. [2022-02-20 20:00:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:07,751 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:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:07,751 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:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 919 transitions. [2022-02-20 20:00:07,760 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:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 919 transitions. [2022-02-20 20:00:07,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 919 transitions. [2022-02-20 20:00:08,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:08,432 INFO L225 Difference]: With dead ends: 855 [2022-02-20 20:00:08,433 INFO L226 Difference]: Without dead ends: 646 [2022-02-20 20:00:08,439 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:08,440 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 1250 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:08,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 1848 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-02-20 20:00:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 570. [2022-02-20 20:00:08,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:08,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 20:00:08,472 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 20:00:08,473 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 20:00:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,493 INFO L93 Difference]: Finished difference Result 646 states and 951 transitions. [2022-02-20 20:00:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 951 transitions. [2022-02-20 20:00:08,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:08,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:08,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 646 states. [2022-02-20 20:00:08,497 INFO L87 Difference]: Start difference. First operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 646 states. [2022-02-20 20:00:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,515 INFO L93 Difference]: Finished difference Result 646 states and 951 transitions. [2022-02-20 20:00:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 951 transitions. [2022-02-20 20:00:08,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:08,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:08,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:08,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 473 states have (on average 1.4799154334038056) internal successors, (700), 482 states have internal predecessors, (700), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 20:00:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 837 transitions. [2022-02-20 20:00:08,534 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 837 transitions. Word has length 65 [2022-02-20 20:00:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:08,534 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 837 transitions. [2022-02-20 20:00:08,535 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:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 837 transitions. [2022-02-20 20:00:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:08,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:08,536 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:08,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:08,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1288450379, now seen corresponding path program 1 times [2022-02-20 20:00:08,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:08,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162903806] [2022-02-20 20:00:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {6506#(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); {6507#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:08,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {6507#(not (= |old(~q_req_up~0)| 1))} assume true; {6507#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:08,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6507#(not (= |old(~q_req_up~0)| 1))} {6467#(= ~q_req_up~0 ~p_dw_pc~0)} #1302#return; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {6508#(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); {6464#true} is VALID [2022-02-20 20:00:08,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#true} assume !(0 == ~q_write_ev~0); {6464#true} is VALID [2022-02-20 20:00:08,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6464#true} {6471#(not (= ~p_dw_pc~0 1))} #1304#return; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {6464#true} havoc ~__retres1~0; {6464#true} is VALID [2022-02-20 20:00:08,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#true} assume 1 == ~p_dw_pc~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,625 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} {6464#true} #1298#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {6464#true} havoc ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#true} assume 1 == ~c_dr_pc~0; {6464#true} is VALID [2022-02-20 20:00:08,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {6464#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6464#true} is VALID [2022-02-20 20:00:08,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {6464#true} #res := ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,631 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6464#true} {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #1300#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {6509#(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; {6464#true} is VALID [2022-02-20 20:00:08,631 INFO L272 TraceCheckUtils]: 1: Hoare triple {6464#true} call #t~ret8 := is_do_write_p_triggered(); {6464#true} is VALID [2022-02-20 20:00:08,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {6464#true} havoc ~__retres1~0; {6464#true} is VALID [2022-02-20 20:00:08,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {6464#true} assume 1 == ~p_dw_pc~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,636 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} {6464#true} #1298#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp~1); {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,649 INFO L272 TraceCheckUtils]: 10: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6464#true} is VALID [2022-02-20 20:00:08,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {6464#true} havoc ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {6464#true} assume 1 == ~c_dr_pc~0; {6464#true} is VALID [2022-02-20 20:00:08,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {6464#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6464#true} is VALID [2022-02-20 20:00:08,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {6464#true} #res := ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6464#true} {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #1300#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,651 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} {6471#(not (= ~p_dw_pc~0 1))} #1306#return; {6465#false} is VALID [2022-02-20 20:00:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {6508#(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); {6464#true} is VALID [2022-02-20 20:00:08,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6464#true} is VALID [2022-02-20 20:00:08,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6464#true} {6465#false} #1308#return; {6465#false} is VALID [2022-02-20 20:00:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {6464#true} havoc ~__retres1~2; {6464#true} is VALID [2022-02-20 20:00:08,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6464#true} is VALID [2022-02-20 20:00:08,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {6464#true} #res := ~__retres1~2; {6464#true} is VALID [2022-02-20 20:00:08,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,669 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6464#true} {6465#false} #1310#return; {6465#false} is VALID [2022-02-20 20:00:08,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {6464#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {6466#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:08,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {6466#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {6466#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:08,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {6466#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {6467#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:08,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {6467#(= ~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; {6467#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:08,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {6467#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {6506#(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:08,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {6506#(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); {6507#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:08,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {6507#(not (= |old(~q_req_up~0)| 1))} assume true; {6507#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:08,673 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6507#(not (= |old(~q_req_up~0)| 1))} {6467#(= ~q_req_up~0 ~p_dw_pc~0)} #1302#return; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,675 INFO L272 TraceCheckUtils]: 12: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {6508#(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:08,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {6508#(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); {6464#true} is VALID [2022-02-20 20:00:08,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {6464#true} assume !(0 == ~q_write_ev~0); {6464#true} is VALID [2022-02-20 20:00:08,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,675 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6464#true} {6471#(not (= ~p_dw_pc~0 1))} #1304#return; {6471#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:08,676 INFO L272 TraceCheckUtils]: 17: Hoare triple {6471#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {6509#(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:08,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {6509#(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; {6464#true} is VALID [2022-02-20 20:00:08,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {6464#true} call #t~ret8 := is_do_write_p_triggered(); {6464#true} is VALID [2022-02-20 20:00:08,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {6464#true} havoc ~__retres1~0; {6464#true} is VALID [2022-02-20 20:00:08,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {6464#true} assume 1 == ~p_dw_pc~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,678 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} {6464#true} #1298#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp~1); {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,680 INFO L272 TraceCheckUtils]: 28: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6464#true} is VALID [2022-02-20 20:00:08,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {6464#true} havoc ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {6464#true} assume 1 == ~c_dr_pc~0; {6464#true} is VALID [2022-02-20 20:00:08,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {6464#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6464#true} is VALID [2022-02-20 20:00:08,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {6464#true} #res := ~__retres1~1; {6464#true} is VALID [2022-02-20 20:00:08,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,681 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6464#true} {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} #1300#return; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:08,682 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6516#(= (+ (- 1) ~p_dw_pc~0) 0)} {6471#(not (= ~p_dw_pc~0 1))} #1306#return; {6465#false} is VALID [2022-02-20 20:00:08,682 INFO L272 TraceCheckUtils]: 39: Hoare triple {6465#false} call reset_delta_events1(); {6508#(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:08,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {6508#(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); {6464#true} is VALID [2022-02-20 20:00:08,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {6464#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6464#true} is VALID [2022-02-20 20:00:08,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,683 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6464#true} {6465#false} #1308#return; {6465#false} is VALID [2022-02-20 20:00:08,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {6465#false} assume !false; {6465#false} is VALID [2022-02-20 20:00:08,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {6465#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; {6465#false} is VALID [2022-02-20 20:00:08,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {6465#false} assume !false; {6465#false} is VALID [2022-02-20 20:00:08,683 INFO L272 TraceCheckUtils]: 47: Hoare triple {6465#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6464#true} is VALID [2022-02-20 20:00:08,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {6464#true} havoc ~__retres1~2; {6464#true} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {6464#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6464#true} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {6464#true} #res := ~__retres1~2; {6464#true} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {6464#true} assume true; {6464#true} is VALID [2022-02-20 20:00:08,684 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6464#true} {6465#false} #1310#return; {6465#false} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {6465#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; {6465#false} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {6465#false} assume 0 != eval1_~tmp___1~0#1; {6465#false} is VALID [2022-02-20 20:00:08,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {6465#false} assume !(0 == ~p_dw_st~0); {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {6465#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; {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {6465#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; {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {6465#false} assume !(0 == ~c_dr_pc~0); {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {6465#false} assume 2 == ~c_dr_pc~0; {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {6465#false} do_read_c_~a~0#1 := ~a_t~0; {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {6465#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; {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {6465#false} assume !(~p_last_write~0 == ~c_last_read~0); {6465#false} is VALID [2022-02-20 20:00:08,685 INFO L272 TraceCheckUtils]: 63: Hoare triple {6465#false} call error1(); {6465#false} is VALID [2022-02-20 20:00:08,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {6465#false} assume !false; {6465#false} is VALID [2022-02-20 20:00:08,686 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:08,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:08,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162903806] [2022-02-20 20:00:08,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162903806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:08,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:08,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:08,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793746495] [2022-02-20 20:00:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:08,687 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:08,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:08,688 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:08,724 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:08,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:08,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:08,725 INFO L87 Difference]: Start difference. First operand 570 states and 837 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:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,340 INFO L93 Difference]: Finished difference Result 2116 states and 3035 transitions. [2022-02-20 20:00:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:14,341 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:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:14,341 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:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1324 transitions. [2022-02-20 20:00:14,351 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:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1324 transitions. [2022-02-20 20:00:14,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1324 transitions. [2022-02-20 20:00:15,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1324 edges. 1324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,485 INFO L225 Difference]: With dead ends: 2116 [2022-02-20 20:00:15,486 INFO L226 Difference]: Without dead ends: 1783 [2022-02-20 20:00:15,495 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:15,500 INFO L933 BasicCegarLoop]: 650 mSDtfsCounter, 2839 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2857 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:15,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2857 Valid, 2484 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 20:00:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-02-20 20:00:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1623. [2022-02-20 20:00:15,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:15,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1783 states. Second operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) [2022-02-20 20:00:15,579 INFO L74 IsIncluded]: Start isIncluded. First operand 1783 states. Second operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) [2022-02-20 20:00:15,582 INFO L87 Difference]: Start difference. First operand 1783 states. Second operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) [2022-02-20 20:00:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,688 INFO L93 Difference]: Finished difference Result 1783 states and 2436 transitions. [2022-02-20 20:00:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2436 transitions. [2022-02-20 20:00:15,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) Second operand 1783 states. [2022-02-20 20:00:15,698 INFO L87 Difference]: Start difference. First operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) Second operand 1783 states. [2022-02-20 20:00:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,803 INFO L93 Difference]: Finished difference Result 1783 states and 2436 transitions. [2022-02-20 20:00:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2436 transitions. [2022-02-20 20:00:15,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:15,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1321 states have (on average 1.3959121877365632) internal successors, (1844), 1345 states have internal predecessors, (1844), 174 states have call successors, (174), 112 states have call predecessors, (174), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) [2022-02-20 20:00:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2224 transitions. [2022-02-20 20:00:15,942 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2224 transitions. Word has length 65 [2022-02-20 20:00:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:15,943 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 2224 transitions. [2022-02-20 20:00:15,943 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:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2224 transitions. [2022-02-20 20:00:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:15,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:15,945 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:15,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:15,945 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1688769959, now seen corresponding path program 1 times [2022-02-20 20:00:15,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:15,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697067663] [2022-02-20 20:00:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {15239#(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); {15240#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {15240#(not (= |old(~q_req_up~0)| 1))} assume true; {15240#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15240#(not (= |old(~q_req_up~0)| 1))} {15199#(= ~c_dr_pc~0 ~q_req_up~0)} #1302#return; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {15241#(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); {15196#true} is VALID [2022-02-20 20:00:16,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {15196#true} assume !(0 == ~q_write_ev~0); {15196#true} is VALID [2022-02-20 20:00:16,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15196#true} {15203#(not (= ~c_dr_pc~0 1))} #1304#return; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {15196#true} havoc ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {15196#true} assume !(1 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {15196#true} assume !(2 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {15196#true} ~__retres1~0 := 0; {15196#true} is VALID [2022-02-20 20:00:16,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {15196#true} #res := ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,079 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15196#true} {15196#true} #1298#return; {15196#true} is VALID [2022-02-20 20:00:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {15196#true} havoc ~__retres1~1; {15196#true} is VALID [2022-02-20 20:00:16,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {15196#true} assume 1 == ~c_dr_pc~0; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,089 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} {15196#true} #1300#return; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {15242#(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; {15196#true} is VALID [2022-02-20 20:00:16,089 INFO L272 TraceCheckUtils]: 1: Hoare triple {15196#true} call #t~ret8 := is_do_write_p_triggered(); {15196#true} is VALID [2022-02-20 20:00:16,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {15196#true} havoc ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {15196#true} assume !(1 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {15196#true} assume !(2 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {15196#true} ~__retres1~0 := 0; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {15196#true} #res := ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15196#true} {15196#true} #1298#return; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {15196#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {15196#true} assume !(0 != ~tmp~1); {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {15196#true} call #t~ret9 := is_do_read_c_triggered(); {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {15196#true} havoc ~__retres1~1; {15196#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {15196#true} assume 1 == ~c_dr_pc~0; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,096 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} {15196#true} #1300#return; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} {15203#(not (= ~c_dr_pc~0 1))} #1306#return; {15197#false} is VALID [2022-02-20 20:00:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {15241#(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); {15196#true} is VALID [2022-02-20 20:00:16,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {15196#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15196#true} is VALID [2022-02-20 20:00:16,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15196#true} {15197#false} #1308#return; {15197#false} is VALID [2022-02-20 20:00:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {15196#true} havoc ~__retres1~2; {15196#true} is VALID [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {15196#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15196#true} is VALID [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {15196#true} #res := ~__retres1~2; {15196#true} is VALID [2022-02-20 20:00:16,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,112 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15196#true} {15197#false} #1310#return; {15197#false} is VALID [2022-02-20 20:00:16,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {15196#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {15198#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:16,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {15198#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {15198#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:16,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {15198#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {15199#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:16,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {15199#(= ~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; {15199#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:16,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {15199#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {15239#(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:16,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {15239#(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); {15240#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {15240#(not (= |old(~q_req_up~0)| 1))} assume true; {15240#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,115 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15240#(not (= |old(~q_req_up~0)| 1))} {15199#(= ~c_dr_pc~0 ~q_req_up~0)} #1302#return; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,116 INFO L272 TraceCheckUtils]: 12: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {15241#(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:16,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {15241#(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); {15196#true} is VALID [2022-02-20 20:00:16,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {15196#true} assume !(0 == ~q_write_ev~0); {15196#true} is VALID [2022-02-20 20:00:16,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,117 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15196#true} {15203#(not (= ~c_dr_pc~0 1))} #1304#return; {15203#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {15203#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {15242#(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:16,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {15242#(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; {15196#true} is VALID [2022-02-20 20:00:16,118 INFO L272 TraceCheckUtils]: 19: Hoare triple {15196#true} call #t~ret8 := is_do_write_p_triggered(); {15196#true} is VALID [2022-02-20 20:00:16,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {15196#true} havoc ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {15196#true} assume !(1 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {15196#true} assume !(2 == ~p_dw_pc~0); {15196#true} is VALID [2022-02-20 20:00:16,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {15196#true} ~__retres1~0 := 0; {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {15196#true} #res := ~__retres1~0; {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15196#true} {15196#true} #1298#return; {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {15196#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {15196#true} assume !(0 != ~tmp~1); {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L272 TraceCheckUtils]: 29: Hoare triple {15196#true} call #t~ret9 := is_do_read_c_triggered(); {15196#true} is VALID [2022-02-20 20:00:16,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {15196#true} havoc ~__retres1~1; {15196#true} is VALID [2022-02-20 20:00:16,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {15196#true} assume 1 == ~c_dr_pc~0; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,121 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} {15196#true} #1300#return; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15256#(= (+ (- 1) ~c_dr_pc~0) 0)} {15203#(not (= ~c_dr_pc~0 1))} #1306#return; {15197#false} is VALID [2022-02-20 20:00:16,122 INFO L272 TraceCheckUtils]: 40: Hoare triple {15197#false} call reset_delta_events1(); {15241#(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:16,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {15241#(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); {15196#true} is VALID [2022-02-20 20:00:16,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {15196#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15196#true} is VALID [2022-02-20 20:00:16,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,123 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15196#true} {15197#false} #1308#return; {15197#false} is VALID [2022-02-20 20:00:16,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {15197#false} assume !false; {15197#false} is VALID [2022-02-20 20:00:16,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {15197#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; {15197#false} is VALID [2022-02-20 20:00:16,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {15197#false} assume !false; {15197#false} is VALID [2022-02-20 20:00:16,123 INFO L272 TraceCheckUtils]: 48: Hoare triple {15197#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {15196#true} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {15196#true} havoc ~__retres1~2; {15196#true} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {15196#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15196#true} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {15196#true} #res := ~__retres1~2; {15196#true} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {15196#true} assume true; {15196#true} is VALID [2022-02-20 20:00:16,124 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15196#true} {15197#false} #1310#return; {15197#false} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {15197#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; {15197#false} is VALID [2022-02-20 20:00:16,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {15197#false} assume 0 != eval1_~tmp___1~0#1; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {15197#false} assume !(0 == ~p_dw_st~0); {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {15197#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; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {15197#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; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {15197#false} assume !(0 == ~c_dr_pc~0); {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {15197#false} assume 2 == ~c_dr_pc~0; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {15197#false} do_read_c_~a~0#1 := ~a_t~0; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {15197#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; {15197#false} is VALID [2022-02-20 20:00:16,125 INFO L290 TraceCheckUtils]: 63: Hoare triple {15197#false} assume !(~p_last_write~0 == ~c_last_read~0); {15197#false} is VALID [2022-02-20 20:00:16,126 INFO L272 TraceCheckUtils]: 64: Hoare triple {15197#false} call error1(); {15197#false} is VALID [2022-02-20 20:00:16,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {15197#false} assume !false; {15197#false} is VALID [2022-02-20 20:00:16,137 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:16,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:16,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697067663] [2022-02-20 20:00:16,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697067663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:16,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:16,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:16,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430213172] [2022-02-20 20:00:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:16,138 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:16,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:16,139 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:16,177 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:16,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:16,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:16,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:16,178 INFO L87 Difference]: Start difference. First operand 1623 states and 2224 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:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,775 INFO L93 Difference]: Finished difference Result 5147 states and 7106 transitions. [2022-02-20 20:00:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:22,775 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:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:22,775 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:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1313 transitions. [2022-02-20 20:00:22,792 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:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1313 transitions. [2022-02-20 20:00:22,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1313 transitions. [2022-02-20 20:00:23,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1313 edges. 1313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:23,835 INFO L225 Difference]: With dead ends: 5147 [2022-02-20 20:00:23,836 INFO L226 Difference]: Without dead ends: 2028 [2022-02-20 20:00:23,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:23,841 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 2877 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:23,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2895 Valid, 2532 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-02-20 20:00:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1824. [2022-02-20 20:00:23,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:23,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2028 states. Second operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) [2022-02-20 20:00:23,894 INFO L74 IsIncluded]: Start isIncluded. First operand 2028 states. Second operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) [2022-02-20 20:00:23,897 INFO L87 Difference]: Start difference. First operand 2028 states. Second operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) [2022-02-20 20:00:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,015 INFO L93 Difference]: Finished difference Result 2028 states and 2699 transitions. [2022-02-20 20:00:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2699 transitions. [2022-02-20 20:00:24,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) Second operand 2028 states. [2022-02-20 20:00:24,026 INFO L87 Difference]: Start difference. First operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) Second operand 2028 states. [2022-02-20 20:00:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,143 INFO L93 Difference]: Finished difference Result 2028 states and 2699 transitions. [2022-02-20 20:00:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2699 transitions. [2022-02-20 20:00:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:24,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1452 states have (on average 1.3526170798898072) internal successors, (1964), 1478 states have internal predecessors, (1964), 214 states have call successors, (214), 140 states have call predecessors, (214), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) [2022-02-20 20:00:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2428 transitions. [2022-02-20 20:00:24,350 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2428 transitions. Word has length 66 [2022-02-20 20:00:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:24,351 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2428 transitions. [2022-02-20 20:00:24,351 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:00:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2428 transitions. [2022-02-20 20:00:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:24,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:24,353 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:00:24,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:24,353 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -425793394, now seen corresponding path program 1 times [2022-02-20 20:00:24,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:24,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630706674] [2022-02-20 20:00:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {28838#(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); {28792#true} is VALID [2022-02-20 20:00:24,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28792#true} {28792#true} #1302#return; {28792#true} is VALID [2022-02-20 20:00:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {28839#(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); {28792#true} is VALID [2022-02-20 20:00:24,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume !(0 == ~q_write_ev~0); {28792#true} is VALID [2022-02-20 20:00:24,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28792#true} {28792#true} #1304#return; {28792#true} is VALID [2022-02-20 20:00:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {28792#true} havoc ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume !(1 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} assume !(2 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#true} ~__retres1~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {28792#true} #res := ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,475 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28792#true} {28792#true} #1298#return; {28792#true} is VALID [2022-02-20 20:00:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {28792#true} havoc ~__retres1~1; {28792#true} is VALID [2022-02-20 20:00:24,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume !(1 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} assume !(2 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#true} ~__retres1~1 := 0; {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:24,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,519 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {28792#true} #1300#return; {28855#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:24,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {28840#(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; {28792#true} is VALID [2022-02-20 20:00:24,519 INFO L272 TraceCheckUtils]: 1: Hoare triple {28792#true} call #t~ret8 := is_do_write_p_triggered(); {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} havoc ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#true} assume !(1 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {28792#true} assume !(2 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {28792#true} ~__retres1~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {28792#true} #res := ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,520 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28792#true} {28792#true} #1298#return; {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {28792#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {28792#true} assume !(0 != ~tmp~1); {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {28792#true} call #t~ret9 := is_do_read_c_triggered(); {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {28792#true} havoc ~__retres1~1; {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {28792#true} assume !(1 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {28792#true} assume !(2 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {28792#true} ~__retres1~1 := 0; {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:24,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,523 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {28792#true} #1300#return; {28855#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:24,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {28855#(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; {28856#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:24,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {28856#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28793#false} is VALID [2022-02-20 20:00:24,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {28793#false} assume true; {28793#false} is VALID [2022-02-20 20:00:24,525 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28793#false} {28792#true} #1306#return; {28793#false} is VALID [2022-02-20 20:00:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {28839#(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); {28792#true} is VALID [2022-02-20 20:00:24,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28792#true} is VALID [2022-02-20 20:00:24,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28792#true} {28793#false} #1308#return; {28793#false} is VALID [2022-02-20 20:00:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {28792#true} havoc ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28792#true} is VALID [2022-02-20 20:00:24,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} #res := ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,546 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28792#true} {28793#false} #1310#return; {28793#false} is VALID [2022-02-20 20:00:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {28792#true} havoc ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28792#true} is VALID [2022-02-20 20:00:24,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} #res := ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,549 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28792#true} {28793#false} #1310#return; {28793#false} is VALID [2022-02-20 20:00:24,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {28792#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {28792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {28792#true} is VALID [2022-02-20 20:00:24,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {28792#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {28792#true} is VALID [2022-02-20 20:00:24,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {28792#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; {28792#true} is VALID [2022-02-20 20:00:24,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {28792#true} call update_channels1(); {28838#(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:24,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {28838#(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); {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28792#true} {28792#true} #1302#return; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {28792#true} assume { :begin_inline_init_threads1 } true; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {28792#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {28792#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {28792#true} assume { :end_inline_init_threads1 } true; {28792#true} is VALID [2022-02-20 20:00:24,552 INFO L272 TraceCheckUtils]: 12: Hoare triple {28792#true} call fire_delta_events1(); {28839#(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:24,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {28839#(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); {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {28792#true} assume !(0 == ~q_write_ev~0); {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28792#true} {28792#true} #1304#return; {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L272 TraceCheckUtils]: 17: Hoare triple {28792#true} call activate_threads1(); {28840#(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:24,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {28840#(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; {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L272 TraceCheckUtils]: 19: Hoare triple {28792#true} call #t~ret8 := is_do_write_p_triggered(); {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {28792#true} havoc ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {28792#true} assume !(1 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {28792#true} assume !(2 == ~p_dw_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {28792#true} ~__retres1~0 := 0; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {28792#true} #res := ~__retres1~0; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28792#true} {28792#true} #1298#return; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {28792#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {28792#true} assume !(0 != ~tmp~1); {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L272 TraceCheckUtils]: 29: Hoare triple {28792#true} call #t~ret9 := is_do_read_c_triggered(); {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {28792#true} havoc ~__retres1~1; {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {28792#true} assume !(1 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {28792#true} assume !(2 == ~c_dr_pc~0); {28792#true} is VALID [2022-02-20 20:00:24,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {28792#true} ~__retres1~1 := 0; {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:24,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {28857#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:24,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28858#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {28792#true} #1300#return; {28855#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {28855#(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; {28856#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {28856#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28793#false} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {28793#false} assume true; {28793#false} is VALID [2022-02-20 20:00:24,557 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {28793#false} {28792#true} #1306#return; {28793#false} is VALID [2022-02-20 20:00:24,557 INFO L272 TraceCheckUtils]: 41: Hoare triple {28793#false} call reset_delta_events1(); {28839#(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:24,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {28839#(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); {28792#true} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {28792#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28792#true} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,557 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28792#true} {28793#false} #1308#return; {28793#false} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L272 TraceCheckUtils]: 49: Hoare triple {28793#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28792#true} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {28792#true} havoc ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {28792#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28792#true} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {28792#true} #res := ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,558 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {28792#true} {28793#false} #1310#return; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {28793#false} assume 0 != eval1_~tmp___1~0#1; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {28793#false} assume 0 == ~p_dw_pc~0; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {28793#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {28793#false} is VALID [2022-02-20 20:00:24,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {28793#false} assume { :end_inline_do_write_p } true; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {28793#false} assume !(0 == ~c_dr_st~0); {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L272 TraceCheckUtils]: 65: Hoare triple {28793#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28792#true} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {28792#true} havoc ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 67: Hoare triple {28792#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28792#true} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {28792#true} #res := ~__retres1~2; {28792#true} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {28792#true} assume true; {28792#true} is VALID [2022-02-20 20:00:24,559 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {28792#true} {28793#false} #1310#return; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {28793#false} assume 0 != eval1_~tmp___1~0#1; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {28793#false} assume !(0 == ~p_dw_pc~0); {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {28793#false} assume 1 == ~p_dw_pc~0; {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {28793#false} assume !(0 == ~q_free~0); {28793#false} is VALID [2022-02-20 20:00:24,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 79: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {28793#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {28793#false} assume { :end_inline_do_write_p } true; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 83: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {28793#false} assume !(0 == ~c_dr_pc~0); {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {28793#false} assume 2 == ~c_dr_pc~0; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {28793#false} do_read_c_~a~0#1 := ~a_t~0; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 87: Hoare triple {28793#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; {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {28793#false} assume !(~p_last_write~0 == ~c_last_read~0); {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L272 TraceCheckUtils]: 89: Hoare triple {28793#false} call error1(); {28793#false} is VALID [2022-02-20 20:00:24,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {28793#false} assume !false; {28793#false} is VALID [2022-02-20 20:00:24,560 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:00:24,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:24,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630706674] [2022-02-20 20:00:24,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630706674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:24,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:24,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:24,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162030716] [2022-02-20 20:00:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:24,561 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:00:24,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:24,562 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:00:24,610 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:00:24,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:24,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:24,611 INFO L87 Difference]: Start difference. First operand 1824 states and 2428 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:00:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,777 INFO L93 Difference]: Finished difference Result 3647 states and 4869 transitions. [2022-02-20 20:00:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:27,777 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:00:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:27,777 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:00:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 686 transitions. [2022-02-20 20:00:27,781 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:00:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 686 transitions. [2022-02-20 20:00:27,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 686 transitions. [2022-02-20 20:00:28,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 686 edges. 686 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:28,384 INFO L225 Difference]: With dead ends: 3647 [2022-02-20 20:00:28,384 INFO L226 Difference]: Without dead ends: 2066 [2022-02-20 20:00:28,387 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:00:28,387 INFO L933 BasicCegarLoop]: 495 mSDtfsCounter, 420 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:28,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 2247 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2022-02-20 20:00:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1884. [2022-02-20 20:00:28,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:28,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2066 states. Second operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) [2022-02-20 20:00:28,454 INFO L74 IsIncluded]: Start isIncluded. First operand 2066 states. Second operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) [2022-02-20 20:00:28,456 INFO L87 Difference]: Start difference. First operand 2066 states. Second operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) [2022-02-20 20:00:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,600 INFO L93 Difference]: Finished difference Result 2066 states and 2744 transitions. [2022-02-20 20:00:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2744 transitions. [2022-02-20 20:00:28,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:28,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:28,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) Second operand 2066 states. [2022-02-20 20:00:28,610 INFO L87 Difference]: Start difference. First operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) Second operand 2066 states. [2022-02-20 20:00:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,727 INFO L93 Difference]: Finished difference Result 2066 states and 2744 transitions. [2022-02-20 20:00:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2744 transitions. [2022-02-20 20:00:28,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:28,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:28,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:28,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1500 states have (on average 1.3373333333333333) internal successors, (2006), 1526 states have internal predecessors, (2006), 214 states have call successors, (214), 140 states have call predecessors, (214), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) [2022-02-20 20:00:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2482 transitions. [2022-02-20 20:00:28,885 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2482 transitions. Word has length 91 [2022-02-20 20:00:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:28,886 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 2482 transitions. [2022-02-20 20:00:28,886 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:00:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2482 transitions. [2022-02-20 20:00:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:28,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:28,890 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:00:28,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:28,890 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:28,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 18107280, now seen corresponding path program 1 times [2022-02-20 20:00:28,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:28,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214660044] [2022-02-20 20:00:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {40487#(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); {40488#(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,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {40488#(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,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1302#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {40488#(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); {40488#(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,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {40488#(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,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {40488#(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,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1304#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {40440#true} havoc ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {40440#true} assume !(1 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} assume !(2 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {40440#true} ~__retres1~0 := 0; {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {40440#true} #res := ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40440#true} {40440#true} #1298#return; {40440#true} is VALID [2022-02-20 20:00:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {40440#true} havoc ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:28,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {40440#true} assume !(1 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} assume !(2 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {40440#true} ~__retres1~1 := 0; {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {40440#true} #res := ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40440#true} {40440#true} #1300#return; {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {40489#(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; {40440#true} is VALID [2022-02-20 20:00:28,973 INFO L272 TraceCheckUtils]: 1: Hoare triple {40440#true} call #t~ret8 := is_do_write_p_triggered(); {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} havoc ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {40440#true} assume !(1 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {40440#true} assume !(2 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {40440#true} ~__retres1~0 := 0; {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {40440#true} #res := ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {40440#true} {40440#true} #1298#return; {40440#true} is VALID [2022-02-20 20:00:28,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {40440#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {40440#true} assume !(0 != ~tmp~1); {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L272 TraceCheckUtils]: 11: Hoare triple {40440#true} call #t~ret9 := is_do_read_c_triggered(); {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {40440#true} havoc ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {40440#true} assume !(1 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {40440#true} assume !(2 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {40440#true} ~__retres1~1 := 0; {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {40440#true} #res := ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:28,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:28,976 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40440#true} {40440#true} #1300#return; {40440#true} is VALID [2022-02-20 20:00:28,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {40440#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40440#true} is VALID [2022-02-20 20:00:28,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {40440#true} assume !(0 != ~tmp___0~1); {40440#true} is VALID [2022-02-20 20:00:28,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:28,976 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {40440#true} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1306#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {40488#(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); {40504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:28,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {40504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:28,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:28,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1308#return; {40441#false} is VALID [2022-02-20 20:00:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {40440#true} havoc ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {40440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40440#true} is VALID [2022-02-20 20:00:29,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} #res := ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,002 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40440#true} {40441#false} #1310#return; {40441#false} is VALID [2022-02-20 20:00:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {40440#true} havoc ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {40440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40440#true} is VALID [2022-02-20 20:00:29,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} #res := ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,006 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40440#true} {40441#false} #1310#return; {40441#false} is VALID [2022-02-20 20:00:29,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {40440#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {40440#true} is VALID [2022-02-20 20:00:29,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {40440#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {40440#true} is VALID [2022-02-20 20:00:29,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {40440#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {40442#(= ~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; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {40487#(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:29,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {40487#(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); {40488#(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:29,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {40488#(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:29,008 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1302#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {40488#(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:29,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {40488#(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); {40488#(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:29,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {40488#(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:29,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {40488#(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:29,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40488#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1304#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {40489#(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:29,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {40489#(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; {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {40440#true} call #t~ret8 := is_do_write_p_triggered(); {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {40440#true} havoc ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {40440#true} assume !(1 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {40440#true} assume !(2 == ~p_dw_pc~0); {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {40440#true} ~__retres1~0 := 0; {40440#true} is VALID [2022-02-20 20:00:29,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {40440#true} #res := ~__retres1~0; {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {40440#true} {40440#true} #1298#return; {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {40440#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {40440#true} assume !(0 != ~tmp~1); {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L272 TraceCheckUtils]: 29: Hoare triple {40440#true} call #t~ret9 := is_do_read_c_triggered(); {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {40440#true} havoc ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {40440#true} assume !(1 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:29,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {40440#true} assume !(2 == ~c_dr_pc~0); {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {40440#true} ~__retres1~1 := 0; {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {40440#true} #res := ~__retres1~1; {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40440#true} {40440#true} #1300#return; {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {40440#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {40440#true} assume !(0 != ~tmp___0~1); {40440#true} is VALID [2022-02-20 20:00:29,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,015 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {40440#true} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1306#return; {40442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,015 INFO L272 TraceCheckUtils]: 41: Hoare triple {40442#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {40488#(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:29,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {40488#(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); {40504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:29,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {40504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,016 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {40505#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {40442#(= ~q_write_ev~0 ~q_read_ev~0)} #1308#return; {40441#false} is VALID [2022-02-20 20:00:29,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,017 INFO L272 TraceCheckUtils]: 49: Hoare triple {40441#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40440#true} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {40440#true} havoc ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {40440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40440#true} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {40440#true} #res := ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,017 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {40440#true} {40441#false} #1310#return; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {40441#false} assume 0 != eval1_~tmp___1~0#1; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {40441#false} assume 0 == ~p_dw_pc~0; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {40441#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {40441#false} is VALID [2022-02-20 20:00:29,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {40441#false} assume { :end_inline_do_write_p } true; {40441#false} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {40441#false} assume !(0 == ~c_dr_st~0); {40441#false} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 64: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,019 INFO L272 TraceCheckUtils]: 65: Hoare triple {40441#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40440#true} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {40440#true} havoc ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {40440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40440#true} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {40440#true} #res := ~__retres1~2; {40440#true} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {40440#true} assume true; {40440#true} is VALID [2022-02-20 20:00:29,019 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {40440#true} {40441#false} #1310#return; {40441#false} is VALID [2022-02-20 20:00:29,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {40441#false} assume 0 != eval1_~tmp___1~0#1; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {40441#false} assume !(0 == ~p_dw_pc~0); {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {40441#false} assume 1 == ~p_dw_pc~0; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {40441#false} assume !(0 == ~q_free~0); {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 78: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {40441#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {40441#false} assume { :end_inline_do_write_p } true; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 83: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {40441#false} assume !(0 == ~c_dr_pc~0); {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 85: Hoare triple {40441#false} assume 2 == ~c_dr_pc~0; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 86: Hoare triple {40441#false} do_read_c_~a~0#1 := ~a_t~0; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 87: Hoare triple {40441#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; {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 88: Hoare triple {40441#false} assume !(~p_last_write~0 == ~c_last_read~0); {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L272 TraceCheckUtils]: 89: Hoare triple {40441#false} call error1(); {40441#false} is VALID [2022-02-20 20:00:29,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {40441#false} assume !false; {40441#false} is VALID [2022-02-20 20:00:29,022 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:00:29,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:29,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214660044] [2022-02-20 20:00:29,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214660044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:29,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:29,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:29,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660035890] [2022-02-20 20:00:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:29,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:29,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:29,064 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:00:29,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:29,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:29,065 INFO L87 Difference]: Start difference. First operand 1884 states and 2482 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:32,063 INFO L93 Difference]: Finished difference Result 3444 states and 4533 transitions. [2022-02-20 20:00:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 20:00:32,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 894 transitions. [2022-02-20 20:00:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 894 transitions. [2022-02-20 20:00:32,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 894 transitions. [2022-02-20 20:00:32,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 894 edges. 894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:32,881 INFO L225 Difference]: With dead ends: 3444 [2022-02-20 20:00:32,881 INFO L226 Difference]: Without dead ends: 2036 [2022-02-20 20:00:32,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 20:00:32,884 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 1242 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:32,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1268 Valid, 1588 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-02-20 20:00:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1668. [2022-02-20 20:00:32,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:32,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2036 states. Second operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:32,955 INFO L74 IsIncluded]: Start isIncluded. First operand 2036 states. Second operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:32,957 INFO L87 Difference]: Start difference. First operand 2036 states. Second operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,069 INFO L93 Difference]: Finished difference Result 2036 states and 2693 transitions. [2022-02-20 20:00:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2693 transitions. [2022-02-20 20:00:33,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) Second operand 2036 states. [2022-02-20 20:00:33,079 INFO L87 Difference]: Start difference. First operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) Second operand 2036 states. [2022-02-20 20:00:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,192 INFO L93 Difference]: Finished difference Result 2036 states and 2693 transitions. [2022-02-20 20:00:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2693 transitions. [2022-02-20 20:00:33,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:33,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1336 states have (on average 1.341317365269461) internal successors, (1792), 1357 states have internal predecessors, (1792), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2201 transitions. [2022-02-20 20:00:33,306 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2201 transitions. Word has length 91 [2022-02-20 20:00:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:33,306 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 2201 transitions. [2022-02-20 20:00:33,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2201 transitions. [2022-02-20 20:00:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:33,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:33,309 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:00:33,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:33,310 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1957269326, now seen corresponding path program 1 times [2022-02-20 20:00:33,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:33,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21241343] [2022-02-20 20:00:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:33,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {51478#(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); {51431#true} is VALID [2022-02-20 20:00:33,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51431#true} {51431#true} #1302#return; {51431#true} is VALID [2022-02-20 20:00:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {51479#(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); {51431#true} is VALID [2022-02-20 20:00:33,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume !(0 == ~q_write_ev~0); {51431#true} is VALID [2022-02-20 20:00:33,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1304#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {51431#true} havoc ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume !(1 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} assume !(2 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#true} ~__retres1~0 := 0; {51431#true} is VALID [2022-02-20 20:00:33,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {51431#true} #res := ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,392 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1298#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {51431#true} havoc ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume !(1 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} assume !(2 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#true} ~__retres1~1 := 0; {51431#true} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {51431#true} #res := ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,399 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1300#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {51480#(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; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,400 INFO L272 TraceCheckUtils]: 1: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {51431#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} havoc ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#true} assume !(1 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {51431#true} assume !(2 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {51431#true} ~__retres1~0 := 0; {51431#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {51431#true} #res := ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,401 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1298#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {51431#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {51431#true} havoc ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {51431#true} assume !(1 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {51431#true} assume !(2 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {51431#true} ~__retres1~1 := 0; {51431#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {51431#true} #res := ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,404 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1300#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,405 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {51436#(= ~c_dr_st~0 0)} #1306#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {51479#(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); {51431#true} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume !(1 == ~q_write_ev~0); {51431#true} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1308#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {51431#true} havoc ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51431#true} is VALID [2022-02-20 20:00:33,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} #res := ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,419 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1310#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {51431#true} havoc ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51431#true} is VALID [2022-02-20 20:00:33,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} #res := ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,424 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {51431#true} {51432#false} #1310#return; {51432#false} is VALID [2022-02-20 20:00:33,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {51431#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {51431#true} is VALID [2022-02-20 20:00:33,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {51431#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {51431#true} is VALID [2022-02-20 20:00:33,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {51431#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {51431#true} is VALID [2022-02-20 20:00:33,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {51431#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; {51431#true} is VALID [2022-02-20 20:00:33,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {51431#true} call update_channels1(); {51478#(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:33,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {51478#(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); {51431#true} is VALID [2022-02-20 20:00:33,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,426 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {51431#true} {51431#true} #1302#return; {51431#true} is VALID [2022-02-20 20:00:33,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {51431#true} assume { :begin_inline_init_threads1 } true; {51431#true} is VALID [2022-02-20 20:00:33,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {51431#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {51431#true} is VALID [2022-02-20 20:00:33,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {51431#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {51436#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {51436#(= ~c_dr_st~0 0)} call fire_delta_events1(); {51479#(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:33,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {51479#(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); {51431#true} is VALID [2022-02-20 20:00:33,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {51431#true} assume !(0 == ~q_write_ev~0); {51431#true} is VALID [2022-02-20 20:00:33,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,429 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1304#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,429 INFO L272 TraceCheckUtils]: 17: Hoare triple {51436#(= ~c_dr_st~0 0)} call activate_threads1(); {51480#(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:33,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {51480#(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; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {51431#true} havoc ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {51431#true} assume !(1 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {51431#true} assume !(2 == ~p_dw_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {51431#true} ~__retres1~0 := 0; {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {51431#true} #res := ~__retres1~0; {51431#true} is VALID [2022-02-20 20:00:33,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,431 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1298#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,432 INFO L272 TraceCheckUtils]: 29: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {51431#true} is VALID [2022-02-20 20:00:33,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {51431#true} havoc ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {51431#true} assume !(1 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {51431#true} assume !(2 == ~c_dr_pc~0); {51431#true} is VALID [2022-02-20 20:00:33,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {51431#true} ~__retres1~1 := 0; {51431#true} is VALID [2022-02-20 20:00:33,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {51431#true} #res := ~__retres1~1; {51431#true} is VALID [2022-02-20 20:00:33,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,433 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {51431#true} {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1300#return; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,435 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51481#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {51436#(= ~c_dr_st~0 0)} #1306#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,435 INFO L272 TraceCheckUtils]: 41: Hoare triple {51436#(= ~c_dr_st~0 0)} call reset_delta_events1(); {51479#(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:33,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {51479#(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); {51431#true} is VALID [2022-02-20 20:00:33,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {51431#true} assume !(1 == ~q_write_ev~0); {51431#true} is VALID [2022-02-20 20:00:33,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,436 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1308#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {51436#(= ~c_dr_st~0 0)} assume !false; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {51436#(= ~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; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {51436#(= ~c_dr_st~0 0)} assume !false; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,437 INFO L272 TraceCheckUtils]: 49: Hoare triple {51436#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {51431#true} is VALID [2022-02-20 20:00:33,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {51431#true} havoc ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {51431#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51431#true} is VALID [2022-02-20 20:00:33,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {51431#true} #res := ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,439 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {51431#true} {51436#(= ~c_dr_st~0 0)} #1310#return; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {51436#(= ~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; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {51436#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {51436#(= ~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; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {51436#(= ~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; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {51436#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {51436#(= ~c_dr_st~0 0)} assume !false; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {51436#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {51436#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {51436#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {51436#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {51432#false} is VALID [2022-02-20 20:00:33,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {51432#false} assume !false; {51432#false} is VALID [2022-02-20 20:00:33,442 INFO L272 TraceCheckUtils]: 65: Hoare triple {51432#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {51431#true} is VALID [2022-02-20 20:00:33,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {51431#true} havoc ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {51431#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51431#true} is VALID [2022-02-20 20:00:33,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {51431#true} #res := ~__retres1~2; {51431#true} is VALID [2022-02-20 20:00:33,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {51431#true} assume true; {51431#true} is VALID [2022-02-20 20:00:33,443 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {51431#true} {51432#false} #1310#return; {51432#false} is VALID [2022-02-20 20:00:33,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {51432#false} assume 0 != eval1_~tmp___1~0#1; {51432#false} is VALID [2022-02-20 20:00:33,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {51432#false} assume !(0 == ~p_dw_pc~0); {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {51432#false} assume 1 == ~p_dw_pc~0; {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {51432#false} assume !(0 == ~q_free~0); {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 78: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {51432#false} assume !false; {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {51432#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {51432#false} is VALID [2022-02-20 20:00:33,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {51432#false} assume { :end_inline_do_write_p } true; {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 82: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 83: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 84: Hoare triple {51432#false} assume !(0 == ~c_dr_pc~0); {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 85: Hoare triple {51432#false} assume 2 == ~c_dr_pc~0; {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 86: Hoare triple {51432#false} do_read_c_~a~0#1 := ~a_t~0; {51432#false} is VALID [2022-02-20 20:00:33,445 INFO L290 TraceCheckUtils]: 87: Hoare triple {51432#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; {51432#false} is VALID [2022-02-20 20:00:33,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {51432#false} assume !(~p_last_write~0 == ~c_last_read~0); {51432#false} is VALID [2022-02-20 20:00:33,446 INFO L272 TraceCheckUtils]: 89: Hoare triple {51432#false} call error1(); {51432#false} is VALID [2022-02-20 20:00:33,446 INFO L290 TraceCheckUtils]: 90: Hoare triple {51432#false} assume !false; {51432#false} is VALID [2022-02-20 20:00:33,446 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:00:33,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:33,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21241343] [2022-02-20 20:00:33,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21241343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:33,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:33,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:33,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838759706] [2022-02-20 20:00:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:33,448 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:00:33,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:33,449 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:00:33,501 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:00:33,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:33,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:33,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:33,506 INFO L87 Difference]: Start difference. First operand 1668 states and 2201 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:00:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,029 INFO L93 Difference]: Finished difference Result 4810 states and 6369 transitions. [2022-02-20 20:00:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:36,029 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:00:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:36,030 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:00:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 828 transitions. [2022-02-20 20:00:36,034 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:00:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 828 transitions. [2022-02-20 20:00:36,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 828 transitions. [2022-02-20 20:00:36,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 828 edges. 828 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:37,065 INFO L225 Difference]: With dead ends: 4810 [2022-02-20 20:00:37,065 INFO L226 Difference]: Without dead ends: 3386 [2022-02-20 20:00:37,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:00:37,068 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 1170 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:37,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1333 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:00:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-02-20 20:00:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3092. [2022-02-20 20:00:37,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:37,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3386 states. Second operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) [2022-02-20 20:00:37,195 INFO L74 IsIncluded]: Start isIncluded. First operand 3386 states. Second operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) [2022-02-20 20:00:37,199 INFO L87 Difference]: Start difference. First operand 3386 states. Second operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) [2022-02-20 20:00:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:37,533 INFO L93 Difference]: Finished difference Result 3386 states and 4462 transitions. [2022-02-20 20:00:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4462 transitions. [2022-02-20 20:00:37,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:37,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:37,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) Second operand 3386 states. [2022-02-20 20:00:37,548 INFO L87 Difference]: Start difference. First operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) Second operand 3386 states. [2022-02-20 20:00:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:37,883 INFO L93 Difference]: Finished difference Result 3386 states and 4462 transitions. [2022-02-20 20:00:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4462 transitions. [2022-02-20 20:00:37,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:37,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:37,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:37,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2449 states have (on average 1.3033891384238465) internal successors, (3192), 2499 states have internal predecessors, (3192), 347 states have call successors, (347), 234 states have call predecessors, (347), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) [2022-02-20 20:00:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4036 transitions. [2022-02-20 20:00:38,316 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4036 transitions. Word has length 91 [2022-02-20 20:00:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:38,316 INFO L470 AbstractCegarLoop]: Abstraction has 3092 states and 4036 transitions. [2022-02-20 20:00:38,317 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:00:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4036 transitions. [2022-02-20 20:00:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:38,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:38,318 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:00:38,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:38,318 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 899431248, now seen corresponding path program 1 times [2022-02-20 20:00:38,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:38,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951430816] [2022-02-20 20:00:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {68936#(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); {68889#true} is VALID [2022-02-20 20:00:38,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68889#true} {68891#(= 1 ~c_dr_i~0)} #1302#return; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {68937#(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); {68889#true} is VALID [2022-02-20 20:00:38,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume !(0 == ~q_write_ev~0); {68889#true} is VALID [2022-02-20 20:00:38,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68889#true} {68890#false} #1304#return; {68890#false} is VALID [2022-02-20 20:00:38,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {68889#true} havoc ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume !(1 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} assume !(2 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {68889#true} ~__retres1~0 := 0; {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {68889#true} #res := ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {68889#true} {68889#true} #1298#return; {68889#true} is VALID [2022-02-20 20:00:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {68889#true} havoc ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume !(1 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} assume !(2 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {68889#true} ~__retres1~1 := 0; {68889#true} is VALID [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {68889#true} #res := ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {68889#true} {68889#true} #1300#return; {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {68938#(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; {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L272 TraceCheckUtils]: 1: Hoare triple {68889#true} call #t~ret8 := is_do_write_p_triggered(); {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} havoc ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {68889#true} assume !(1 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {68889#true} assume !(2 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {68889#true} ~__retres1~0 := 0; {68889#true} is VALID [2022-02-20 20:00:38,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {68889#true} #res := ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {68889#true} {68889#true} #1298#return; {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {68889#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {68889#true} assume !(0 != ~tmp~1); {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {68889#true} call #t~ret9 := is_do_read_c_triggered(); {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {68889#true} havoc ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {68889#true} assume !(1 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {68889#true} assume !(2 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {68889#true} ~__retres1~1 := 0; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {68889#true} #res := ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {68889#true} {68889#true} #1300#return; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {68889#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {68889#true} assume !(0 != ~tmp___0~1); {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,373 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {68889#true} {68890#false} #1306#return; {68890#false} is VALID [2022-02-20 20:00:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {68937#(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); {68889#true} is VALID [2022-02-20 20:00:38,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume !(1 == ~q_write_ev~0); {68889#true} is VALID [2022-02-20 20:00:38,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68889#true} {68890#false} #1308#return; {68890#false} is VALID [2022-02-20 20:00:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {68889#true} havoc ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {68889#true} is VALID [2022-02-20 20:00:38,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} #res := ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,381 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68889#true} {68890#false} #1310#return; {68890#false} is VALID [2022-02-20 20:00:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {68889#true} havoc ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {68889#true} is VALID [2022-02-20 20:00:38,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} #res := ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,384 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68889#true} {68890#false} #1310#return; {68890#false} is VALID [2022-02-20 20:00:38,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {68889#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {68889#true} is VALID [2022-02-20 20:00:38,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {68889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {68889#true} is VALID [2022-02-20 20:00:38,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {68889#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {68891#(= 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; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {68891#(= 1 ~c_dr_i~0)} call update_channels1(); {68936#(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:38,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {68936#(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); {68889#true} is VALID [2022-02-20 20:00:38,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,386 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {68889#true} {68891#(= 1 ~c_dr_i~0)} #1302#return; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {68891#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {68891#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {68891#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {68891#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {68890#false} is VALID [2022-02-20 20:00:38,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {68890#false} assume { :end_inline_init_threads1 } true; {68890#false} is VALID [2022-02-20 20:00:38,387 INFO L272 TraceCheckUtils]: 12: Hoare triple {68890#false} call fire_delta_events1(); {68937#(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:38,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {68937#(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); {68889#true} is VALID [2022-02-20 20:00:38,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {68889#true} assume !(0 == ~q_write_ev~0); {68889#true} is VALID [2022-02-20 20:00:38,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {68889#true} {68890#false} #1304#return; {68890#false} is VALID [2022-02-20 20:00:38,388 INFO L272 TraceCheckUtils]: 17: Hoare triple {68890#false} call activate_threads1(); {68938#(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:38,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {68938#(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; {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L272 TraceCheckUtils]: 19: Hoare triple {68889#true} call #t~ret8 := is_do_write_p_triggered(); {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {68889#true} havoc ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {68889#true} assume !(1 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {68889#true} assume !(2 == ~p_dw_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {68889#true} ~__retres1~0 := 0; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {68889#true} #res := ~__retres1~0; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {68889#true} {68889#true} #1298#return; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {68889#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {68889#true} assume !(0 != ~tmp~1); {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L272 TraceCheckUtils]: 29: Hoare triple {68889#true} call #t~ret9 := is_do_read_c_triggered(); {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {68889#true} havoc ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {68889#true} assume !(1 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {68889#true} assume !(2 == ~c_dr_pc~0); {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {68889#true} ~__retres1~1 := 0; {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {68889#true} #res := ~__retres1~1; {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {68889#true} {68889#true} #1300#return; {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {68889#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {68889#true} assume !(0 != ~tmp___0~1); {68889#true} is VALID [2022-02-20 20:00:38,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,391 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {68889#true} {68890#false} #1306#return; {68890#false} is VALID [2022-02-20 20:00:38,391 INFO L272 TraceCheckUtils]: 41: Hoare triple {68890#false} call reset_delta_events1(); {68937#(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:38,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {68937#(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); {68889#true} is VALID [2022-02-20 20:00:38,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {68889#true} assume !(1 == ~q_write_ev~0); {68889#true} is VALID [2022-02-20 20:00:38,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,391 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {68889#true} {68890#false} #1308#return; {68890#false} is VALID [2022-02-20 20:00:38,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,392 INFO L272 TraceCheckUtils]: 49: Hoare triple {68890#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {68889#true} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {68889#true} havoc ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {68889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {68889#true} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {68889#true} #res := ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,392 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {68889#true} {68890#false} #1310#return; {68890#false} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {68890#false} assume 0 != eval1_~tmp___1~0#1; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {68890#false} assume 0 == ~p_dw_pc~0; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {68890#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {68890#false} assume { :end_inline_do_write_p } true; {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {68890#false} assume !(0 == ~c_dr_st~0); {68890#false} is VALID [2022-02-20 20:00:38,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,394 INFO L272 TraceCheckUtils]: 65: Hoare triple {68890#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {68889#true} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {68889#true} havoc ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {68889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {68889#true} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {68889#true} #res := ~__retres1~2; {68889#true} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {68889#true} assume true; {68889#true} is VALID [2022-02-20 20:00:38,394 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {68889#true} {68890#false} #1310#return; {68890#false} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {68890#false} assume 0 != eval1_~tmp___1~0#1; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {68890#false} assume !(0 == ~p_dw_pc~0); {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 76: Hoare triple {68890#false} assume 1 == ~p_dw_pc~0; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {68890#false} assume !(0 == ~q_free~0); {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {68890#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {68890#false} is VALID [2022-02-20 20:00:38,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {68890#false} assume { :end_inline_do_write_p } true; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 82: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 83: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 84: Hoare triple {68890#false} assume !(0 == ~c_dr_pc~0); {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 85: Hoare triple {68890#false} assume 2 == ~c_dr_pc~0; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 86: Hoare triple {68890#false} do_read_c_~a~0#1 := ~a_t~0; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {68890#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; {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {68890#false} assume !(~p_last_write~0 == ~c_last_read~0); {68890#false} is VALID [2022-02-20 20:00:38,396 INFO L272 TraceCheckUtils]: 89: Hoare triple {68890#false} call error1(); {68890#false} is VALID [2022-02-20 20:00:38,397 INFO L290 TraceCheckUtils]: 90: Hoare triple {68890#false} assume !false; {68890#false} is VALID [2022-02-20 20:00:38,397 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:00:38,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:38,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951430816] [2022-02-20 20:00:38,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951430816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:38,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:38,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:38,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57742115] [2022-02-20 20:00:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:38,398 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:00:38,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:38,399 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:00:38,442 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:00:38,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:38,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:38,442 INFO L87 Difference]: Start difference. First operand 3092 states and 4036 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:00:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,570 INFO L93 Difference]: Finished difference Result 4663 states and 6036 transitions. [2022-02-20 20:00:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:40,571 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:00:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:40,571 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:00:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 672 transitions. [2022-02-20 20:00:40,574 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:00:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 672 transitions. [2022-02-20 20:00:40,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 672 transitions. [2022-02-20 20:00:40,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 672 edges. 672 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,128 INFO L225 Difference]: With dead ends: 4663 [2022-02-20 20:00:41,128 INFO L226 Difference]: Without dead ends: 1815 [2022-02-20 20:00:41,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:41,133 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 532 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:41,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1363 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:00:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2022-02-20 20:00:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1668. [2022-02-20 20:00:41,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:41,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1815 states. Second operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:41,194 INFO L74 IsIncluded]: Start isIncluded. First operand 1815 states. Second operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:41,196 INFO L87 Difference]: Start difference. First operand 1815 states. Second operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,284 INFO L93 Difference]: Finished difference Result 1815 states and 2377 transitions. [2022-02-20 20:00:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2377 transitions. [2022-02-20 20:00:41,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) Second operand 1815 states. [2022-02-20 20:00:41,292 INFO L87 Difference]: Start difference. First operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) Second operand 1815 states. [2022-02-20 20:00:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,383 INFO L93 Difference]: Finished difference Result 1815 states and 2377 transitions. [2022-02-20 20:00:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2377 transitions. [2022-02-20 20:00:41,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:41,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1336 states have (on average 1.313622754491018) internal successors, (1755), 1357 states have internal predecessors, (1755), 186 states have call successors, (186), 121 states have call predecessors, (186), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-02-20 20:00:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2164 transitions. [2022-02-20 20:00:41,497 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2164 transitions. Word has length 91 [2022-02-20 20:00:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:41,497 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 2164 transitions. [2022-02-20 20:00:41,497 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:00:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2164 transitions. [2022-02-20 20:00:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:00:41,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:41,499 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:00:41,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:41,499 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1793087749, now seen corresponding path program 1 times [2022-02-20 20:00:41,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:41,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656477422] [2022-02-20 20:00:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {81155#(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); {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {81109#(= ~q_read_ev~0 2)} #1302#return; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {81157#(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); {81107#true} is VALID [2022-02-20 20:00:41,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume !(0 == ~q_write_ev~0); {81107#true} is VALID [2022-02-20 20:00:41,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81107#true} {81109#(= ~q_read_ev~0 2)} #1304#return; {81107#true} is VALID [2022-02-20 20:00:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {81107#true} havoc ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume !(1 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} assume !(2 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {81107#true} ~__retres1~0 := 0; {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {81107#true} #res := ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {81107#true} {81107#true} #1298#return; {81107#true} is VALID [2022-02-20 20:00:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {81107#true} havoc ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume !(1 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} assume !(2 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {81107#true} ~__retres1~1 := 0; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {81107#true} #res := ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {81107#true} {81107#true} #1300#return; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {81158#(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; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L272 TraceCheckUtils]: 1: Hoare triple {81107#true} call #t~ret8 := is_do_write_p_triggered(); {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} havoc ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {81107#true} assume !(1 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {81107#true} assume !(2 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {81107#true} ~__retres1~0 := 0; {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {81107#true} #res := ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {81107#true} {81107#true} #1298#return; {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {81107#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {81107#true} assume !(0 != ~tmp~1); {81107#true} is VALID [2022-02-20 20:00:41,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {81107#true} call #t~ret9 := is_do_read_c_triggered(); {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {81107#true} havoc ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {81107#true} assume !(1 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {81107#true} assume !(2 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {81107#true} ~__retres1~1 := 0; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {81107#true} #res := ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {81107#true} {81107#true} #1300#return; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {81107#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {81107#true} is VALID [2022-02-20 20:00:41,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {81107#true} assume !(0 != ~tmp___0~1); {81107#true} is VALID [2022-02-20 20:00:41,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,575 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {81107#true} {81107#true} #1306#return; {81107#true} is VALID [2022-02-20 20:00:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {81157#(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); {81107#true} is VALID [2022-02-20 20:00:41,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume !(1 == ~q_write_ev~0); {81107#true} is VALID [2022-02-20 20:00:41,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81107#true} {81107#true} #1308#return; {81107#true} is VALID [2022-02-20 20:00:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {81107#true} havoc ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {81107#true} is VALID [2022-02-20 20:00:41,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} #res := ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,581 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {81107#true} {81107#true} #1310#return; {81107#true} is VALID [2022-02-20 20:00:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:00:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {81107#true} havoc ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {81173#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {81173#(= ~p_dw_st~0 0)} assume true; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,590 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {81173#(= ~p_dw_st~0 0)} {81149#(not (= ~p_dw_st~0 0))} #1310#return; {81108#false} is VALID [2022-02-20 20:00:41,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {81107#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {81107#true} is VALID [2022-02-20 20:00:41,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {81107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {81107#true} is VALID [2022-02-20 20:00:41,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {81107#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {81109#(= ~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; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {81109#(= ~q_read_ev~0 2)} call update_channels1(); {81155#(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:41,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {81155#(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); {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,592 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {81156#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {81109#(= ~q_read_ev~0 2)} #1302#return; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {81109#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {81109#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {81109#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {81109#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {81109#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,594 INFO L272 TraceCheckUtils]: 12: Hoare triple {81109#(= ~q_read_ev~0 2)} call fire_delta_events1(); {81157#(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:41,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {81157#(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); {81107#true} is VALID [2022-02-20 20:00:41,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {81107#true} assume !(0 == ~q_write_ev~0); {81107#true} is VALID [2022-02-20 20:00:41,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,594 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {81107#true} {81109#(= ~q_read_ev~0 2)} #1304#return; {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L272 TraceCheckUtils]: 17: Hoare triple {81107#true} call activate_threads1(); {81158#(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:41,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {81158#(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; {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {81107#true} call #t~ret8 := is_do_write_p_triggered(); {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {81107#true} havoc ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {81107#true} assume !(1 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {81107#true} assume !(2 == ~p_dw_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {81107#true} ~__retres1~0 := 0; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {81107#true} #res := ~__retres1~0; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {81107#true} {81107#true} #1298#return; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {81107#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {81107#true} assume !(0 != ~tmp~1); {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L272 TraceCheckUtils]: 29: Hoare triple {81107#true} call #t~ret9 := is_do_read_c_triggered(); {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {81107#true} havoc ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {81107#true} assume !(1 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {81107#true} assume !(2 == ~c_dr_pc~0); {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {81107#true} ~__retres1~1 := 0; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {81107#true} #res := ~__retres1~1; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {81107#true} {81107#true} #1300#return; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {81107#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {81107#true} assume !(0 != ~tmp___0~1); {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,597 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {81107#true} {81107#true} #1306#return; {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L272 TraceCheckUtils]: 41: Hoare triple {81107#true} call reset_delta_events1(); {81157#(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:41,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {81157#(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); {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {81107#true} assume !(1 == ~q_write_ev~0); {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {81107#true} {81107#true} #1308#return; {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {81107#true} assume !false; {81107#true} is VALID [2022-02-20 20:00:41,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {81107#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; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {81107#true} assume !false; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L272 TraceCheckUtils]: 49: Hoare triple {81107#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {81107#true} havoc ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {81107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {81107#true} #res := ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {81107#true} assume true; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {81107#true} {81107#true} #1310#return; {81107#true} is VALID [2022-02-20 20:00:41,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {81107#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; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {81107#true} assume 0 != eval1_~tmp___1~0#1; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {81107#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; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {81107#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; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {81107#true} assume 0 == ~p_dw_pc~0; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {81107#true} assume !false; {81107#true} is VALID [2022-02-20 20:00:41,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {81107#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {81149#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {81149#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {81149#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {81149#(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; {81149#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {81149#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {81149#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {81149#(not (= ~p_dw_st~0 0))} assume !false; {81149#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,602 INFO L272 TraceCheckUtils]: 66: Hoare triple {81149#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {81107#true} is VALID [2022-02-20 20:00:41,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {81107#true} havoc ~__retres1~2; {81107#true} is VALID [2022-02-20 20:00:41,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {81107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {81173#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {81173#(= ~p_dw_st~0 0)} assume true; {81173#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,603 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {81173#(= ~p_dw_st~0 0)} {81149#(not (= ~p_dw_st~0 0))} #1310#return; {81108#false} is VALID [2022-02-20 20:00:41,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {81108#false} assume 0 != eval1_~tmp___1~0#1; {81108#false} is VALID [2022-02-20 20:00:41,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {81108#false} assume !(0 == ~p_dw_pc~0); {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {81108#false} assume 1 == ~p_dw_pc~0; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {81108#false} assume !(0 == ~q_free~0); {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {81108#false} assume !false; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {81108#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {81108#false} assume { :end_inline_do_write_p } true; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {81108#false} assume !(0 == ~c_dr_pc~0); {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {81108#false} assume 2 == ~c_dr_pc~0; {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {81108#false} do_read_c_~a~0#1 := ~a_t~0; {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {81108#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; {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {81108#false} assume !(~p_last_write~0 == ~c_last_read~0); {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L272 TraceCheckUtils]: 90: Hoare triple {81108#false} call error1(); {81108#false} is VALID [2022-02-20 20:00:41,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {81108#false} assume !false; {81108#false} is VALID [2022-02-20 20:00:41,606 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:00:41,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:41,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656477422] [2022-02-20 20:00:41,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656477422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:41,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:41,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:41,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699419191] [2022-02-20 20:00:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:41,607 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:00:41,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:41,608 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:00:41,651 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:00:41,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:41,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:41,653 INFO L87 Difference]: Start difference. First operand 1668 states and 2164 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:00:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,923 INFO L93 Difference]: Finished difference Result 4604 states and 5968 transitions. [2022-02-20 20:00:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:00:45,923 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:00:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:45,924 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:00:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1112 transitions. [2022-02-20 20:00:45,931 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:00:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1112 transitions. [2022-02-20 20:00:45,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1112 transitions. [2022-02-20 20:00:46,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1112 edges. 1112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:47,154 INFO L225 Difference]: With dead ends: 4604 [2022-02-20 20:00:47,155 INFO L226 Difference]: Without dead ends: 3180 [2022-02-20 20:00:47,157 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:00:47,158 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 1925 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:47,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1962 Valid, 1652 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-02-20 20:00:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3018. [2022-02-20 20:00:47,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:47,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3180 states. Second operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:47,276 INFO L74 IsIncluded]: Start isIncluded. First operand 3180 states. Second operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:47,280 INFO L87 Difference]: Start difference. First operand 3180 states. Second operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,559 INFO L93 Difference]: Finished difference Result 3180 states and 4022 transitions. [2022-02-20 20:00:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4022 transitions. [2022-02-20 20:00:47,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) Second operand 3180 states. [2022-02-20 20:00:47,572 INFO L87 Difference]: Start difference. First operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) Second operand 3180 states. [2022-02-20 20:00:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,855 INFO L93 Difference]: Finished difference Result 3180 states and 4022 transitions. [2022-02-20 20:00:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4022 transitions. [2022-02-20 20:00:47,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:47,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2364 states have (on average 1.259306260575296) internal successors, (2977), 2407 states have internal predecessors, (2977), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3835 transitions. [2022-02-20 20:00:48,251 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3835 transitions. Word has length 92 [2022-02-20 20:00:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:48,252 INFO L470 AbstractCegarLoop]: Abstraction has 3018 states and 3835 transitions. [2022-02-20 20:00:48,252 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:00:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3835 transitions. [2022-02-20 20:00:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 20:00:48,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:48,253 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] [2022-02-20 20:00:48,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:48,254 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1409205542, now seen corresponding path program 1 times [2022-02-20 20:00:48,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:48,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949274449] [2022-02-20 20:00:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,304 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {97806#true} {97808#(= ~t3_i~0 1)} #1330#return; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 20:00:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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); {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {97806#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {97806#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {97806#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {97806#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {97806#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {97806#true} assume 0 == ~T6_E~0;~T6_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {97806#true} assume 0 == ~E_M~0;~E_M~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {97806#true} assume !(0 == ~E_1~0); {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {97806#true} assume 0 == ~E_2~0;~E_2~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {97806#true} assume 0 == ~E_3~0;~E_3~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {97806#true} assume 0 == ~E_4~0;~E_4~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {97806#true} assume 0 == ~E_5~0;~E_5~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {97806#true} assume 0 == ~E_6~0;~E_6~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,327 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {97806#true} {97807#false} #1332#return; {97807#false} is VALID [2022-02-20 20:00:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 20:00:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {97893#(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(~t4_st~0)| ~t4_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;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; {97806#true} is VALID [2022-02-20 20:00:48,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {97806#true} assume !(1 == ~m_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {97806#true} is_master_triggered_~__retres1~4#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {97806#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {97806#true} #t~ret30#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp~6#1 := #t~ret30#1;havoc #t~ret30#1; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {97806#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {97806#true} assume 1 == ~t1_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {97806#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {97806#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {97806#true} is VALID [2022-02-20 20:00:48,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {97806#true} #t~ret31#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___0~4#1 := #t~ret31#1;havoc #t~ret31#1; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {97806#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {97806#true} assume !(1 == ~t2_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {97806#true} is_transmit2_triggered_~__retres1~6#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {97806#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {97806#true} #t~ret32#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___1~1#1 := #t~ret32#1;havoc #t~ret32#1; {97806#true} is VALID [2022-02-20 20:00:48,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {97806#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {97806#true} assume 1 == ~t3_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {97806#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {97806#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {97806#true} is VALID [2022-02-20 20:00:48,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {97806#true} #t~ret33#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___2~0#1 := #t~ret33#1;havoc #t~ret33#1; {97806#true} is VALID [2022-02-20 20:00:48,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {97806#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {97806#true} assume 1 == ~t4_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {97806#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {97806#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {97806#true} #t~ret34#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___3~0#1 := #t~ret34#1;havoc #t~ret34#1; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {97806#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {97806#true} assume !(1 == ~t5_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {97806#true} is_transmit5_triggered_~__retres1~9#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {97806#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {97806#true} #t~ret35#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___4~0#1 := #t~ret35#1;havoc #t~ret35#1; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {97806#true} assume !(0 != ~tmp___4~0#1); {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {97806#true} assume 1 == ~t6_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {97806#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {97806#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {97806#true} is VALID [2022-02-20 20:00:48,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {97806#true} #t~ret36#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___5~0#1 := #t~ret36#1;havoc #t~ret36#1; {97806#true} is VALID [2022-02-20 20:00:48,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {97806#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,363 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {97806#true} {97807#false} #1334#return; {97807#false} is VALID [2022-02-20 20:00:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 20:00:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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; {97806#true} is VALID [2022-02-20 20:00:48,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {97806#true} assume !(1 == ~T1_E~0); {97806#true} is VALID [2022-02-20 20:00:48,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {97806#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {97806#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {97806#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {97806#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {97806#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {97806#true} assume 1 == ~E_M~0;~E_M~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {97806#true} assume 1 == ~E_1~0;~E_1~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {97806#true} assume !(1 == ~E_2~0); {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {97806#true} assume 1 == ~E_3~0;~E_3~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {97806#true} assume 1 == ~E_4~0;~E_4~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {97806#true} assume 1 == ~E_5~0;~E_5~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {97806#true} assume 1 == ~E_6~0;~E_6~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {97806#true} {97807#false} #1336#return; {97807#false} is VALID [2022-02-20 20:00:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-20 20:00:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {97806#true} havoc ~__retres1~11; {97806#true} is VALID [2022-02-20 20:00:48,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {97806#true} assume 0 == ~m_st~0;~__retres1~11 := 1; {97806#true} is VALID [2022-02-20 20:00:48,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {97806#true} #res := ~__retres1~11; {97806#true} is VALID [2022-02-20 20:00:48,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,376 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {97806#true} {97807#false} #1338#return; {97807#false} is VALID [2022-02-20 20:00:48,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {97806#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {97806#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {97806#true} is VALID [2022-02-20 20:00:48,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {97806#true} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~12#1;havoc main2_~__retres1~12#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; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {97808#(= ~t3_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret38#1, start_simulation2_#t~ret39#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; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {97808#(= ~t3_i~0 1)} call update_channels2(); {97806#true} is VALID [2022-02-20 20:00:48,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {97806#true} {97808#(= ~t3_i~0 1)} #1330#return; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {97808#(= ~t3_i~0 1)} assume { :begin_inline_init_threads2 } true; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {97808#(= ~t3_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {97808#(= ~t3_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {97808#(= ~t3_i~0 1)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {97808#(= ~t3_i~0 1)} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {97808#(= ~t3_i~0 1)} assume !(1 == ~t3_i~0);~t3_st~0 := 2; {97807#false} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {97807#false} assume 1 == ~t4_i~0;~t4_st~0 := 0; {97807#false} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {97807#false} assume 1 == ~t5_i~0;~t5_st~0 := 0; {97807#false} is VALID [2022-02-20 20:00:48,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {97807#false} assume 1 == ~t6_i~0;~t6_st~0 := 0; {97807#false} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {97807#false} assume { :end_inline_init_threads2 } true; {97807#false} is VALID [2022-02-20 20:00:48,380 INFO L272 TraceCheckUtils]: 16: Hoare triple {97807#false} call fire_delta_events2(); {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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:00:48,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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); {97806#true} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {97806#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {97806#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {97806#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {97806#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {97806#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {97806#true} assume 0 == ~T6_E~0;~T6_E~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {97806#true} assume 0 == ~E_M~0;~E_M~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {97806#true} assume !(0 == ~E_1~0); {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {97806#true} assume 0 == ~E_2~0;~E_2~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {97806#true} assume 0 == ~E_3~0;~E_3~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {97806#true} assume 0 == ~E_4~0;~E_4~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {97806#true} assume 0 == ~E_5~0;~E_5~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {97806#true} assume 0 == ~E_6~0;~E_6~0 := 1; {97806#true} is VALID [2022-02-20 20:00:48,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {97806#true} {97807#false} #1332#return; {97807#false} is VALID [2022-02-20 20:00:48,382 INFO L272 TraceCheckUtils]: 33: Hoare triple {97807#false} call activate_threads2(); {97893#(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(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {97893#(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(~t4_st~0)| ~t4_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;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; {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {97806#true} assume !(1 == ~m_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {97806#true} is_master_triggered_~__retres1~4#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {97806#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {97806#true} #t~ret30#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp~6#1 := #t~ret30#1;havoc #t~ret30#1; {97806#true} is VALID [2022-02-20 20:00:48,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {97806#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {97806#true} assume 1 == ~t1_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {97806#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {97806#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {97806#true} #t~ret31#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___0~4#1 := #t~ret31#1;havoc #t~ret31#1; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {97806#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {97806#true} assume !(1 == ~t2_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {97806#true} is_transmit2_triggered_~__retres1~6#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {97806#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {97806#true} #t~ret32#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___1~1#1 := #t~ret32#1;havoc #t~ret32#1; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {97806#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {97806#true} assume 1 == ~t3_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {97806#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {97806#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {97806#true} is VALID [2022-02-20 20:00:48,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {97806#true} #t~ret33#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___2~0#1 := #t~ret33#1;havoc #t~ret33#1; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {97806#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {97806#true} assume 1 == ~t4_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {97806#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 61: Hoare triple {97806#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 62: Hoare triple {97806#true} #t~ret34#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___3~0#1 := #t~ret34#1;havoc #t~ret34#1; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {97806#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {97806#true} assume !(1 == ~t5_pc~0); {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 66: Hoare triple {97806#true} is_transmit5_triggered_~__retres1~9#1 := 0; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 67: Hoare triple {97806#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {97806#true} #t~ret35#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___4~0#1 := #t~ret35#1;havoc #t~ret35#1; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {97806#true} assume !(0 != ~tmp___4~0#1); {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {97806#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; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {97806#true} assume 1 == ~t6_pc~0; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {97806#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {97806#true} is VALID [2022-02-20 20:00:48,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {97806#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {97806#true} #t~ret36#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___5~0#1 := #t~ret36#1;havoc #t~ret36#1; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {97806#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {97806#true} {97807#false} #1334#return; {97807#false} is VALID [2022-02-20 20:00:48,387 INFO L272 TraceCheckUtils]: 78: Hoare triple {97807#false} call reset_delta_events2(); {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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:00:48,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {97892#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {97806#true} assume !(1 == ~T1_E~0); {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {97806#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {97806#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {97806#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {97806#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {97806#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {97806#true} assume 1 == ~E_M~0;~E_M~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {97806#true} assume 1 == ~E_1~0;~E_1~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {97806#true} assume !(1 == ~E_2~0); {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 89: Hoare triple {97806#true} assume 1 == ~E_3~0;~E_3~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {97806#true} assume 1 == ~E_4~0;~E_4~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {97806#true} assume 1 == ~E_5~0;~E_5~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {97806#true} assume 1 == ~E_6~0;~E_6~0 := 2; {97806#true} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,389 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {97806#true} {97807#false} #1336#return; {97807#false} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {97807#false} assume !false; {97807#false} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {97807#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_~tmp~5#1;havoc eval2_~tmp~5#1; {97807#false} is VALID [2022-02-20 20:00:48,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {97807#false} assume !false; {97807#false} is VALID [2022-02-20 20:00:48,389 INFO L272 TraceCheckUtils]: 98: Hoare triple {97807#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {97806#true} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 99: Hoare triple {97806#true} havoc ~__retres1~11; {97806#true} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {97806#true} assume 0 == ~m_st~0;~__retres1~11 := 1; {97806#true} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {97806#true} #res := ~__retres1~11; {97806#true} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {97806#true} assume true; {97806#true} is VALID [2022-02-20 20:00:48,390 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {97806#true} {97807#false} #1338#return; {97807#false} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 104: Hoare triple {97807#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; {97807#false} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {97807#false} assume 0 != eval2_~tmp~5#1; {97807#false} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {97807#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; {97807#false} is VALID [2022-02-20 20:00:48,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {97807#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; {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L290 TraceCheckUtils]: 108: Hoare triple {97807#false} assume !(0 == ~m_pc~0); {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L290 TraceCheckUtils]: 109: Hoare triple {97807#false} assume 1 == ~m_pc~0; {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L290 TraceCheckUtils]: 110: Hoare triple {97807#false} assume ~token~0 != 6 + ~local~0; {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L272 TraceCheckUtils]: 111: Hoare triple {97807#false} call error2(); {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L290 TraceCheckUtils]: 112: Hoare triple {97807#false} assume !false; {97807#false} is VALID [2022-02-20 20:00:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:48,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:48,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949274449] [2022-02-20 20:00:48,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949274449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:48,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:48,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:48,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985470757] [2022-02-20 20:00:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:48,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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 113 [2022-02-20 20:00:48,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:48,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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:00:48,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:48,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:48,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:48,461 INFO L87 Difference]: Start difference. First operand 3018 states and 3835 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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:00:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:50,817 INFO L93 Difference]: Finished difference Result 3319 states and 4313 transitions. [2022-02-20 20:00:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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 113 [2022-02-20 20:00:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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:00:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2022-02-20 20:00:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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:00:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2022-02-20 20:00:50,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 985 transitions. [2022-02-20 20:00:51,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 985 edges. 985 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,916 INFO L225 Difference]: With dead ends: 3319 [2022-02-20 20:00:51,916 INFO L226 Difference]: Without dead ends: 3094 [2022-02-20 20:00:51,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:51,918 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 703 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:51,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 982 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-02-20 20:00:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3018. [2022-02-20 20:00:52,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:52,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3094 states. Second operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:52,109 INFO L74 IsIncluded]: Start isIncluded. First operand 3094 states. Second operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:52,113 INFO L87 Difference]: Start difference. First operand 3094 states. Second operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,393 INFO L93 Difference]: Finished difference Result 3094 states and 3965 transitions. [2022-02-20 20:00:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3965 transitions. [2022-02-20 20:00:52,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) Second operand 3094 states. [2022-02-20 20:00:52,405 INFO L87 Difference]: Start difference. First operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) Second operand 3094 states. [2022-02-20 20:00:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,696 INFO L93 Difference]: Finished difference Result 3094 states and 3965 transitions. [2022-02-20 20:00:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3965 transitions. [2022-02-20 20:00:52,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:52,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2364 states have (on average 1.2588832487309645) internal successors, (2976), 2407 states have internal predecessors, (2976), 358 states have call successors, (358), 228 states have call predecessors, (358), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-02-20 20:00:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3834 transitions. [2022-02-20 20:00:53,121 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3834 transitions. Word has length 113 [2022-02-20 20:00:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:53,122 INFO L470 AbstractCegarLoop]: Abstraction has 3018 states and 3834 transitions. [2022-02-20 20:00:53,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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:00:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3834 transitions. [2022-02-20 20:00:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 20:00:53,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:53,123 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] [2022-02-20 20:00:53,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:53,123 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 457503132, now seen corresponding path program 1 times [2022-02-20 20:00:53,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:53,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181159498] [2022-02-20 20:00:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,155 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {112585#true} {112587#(= ~T1_E~0 ~M_E~0)} #1330#return; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 20:00:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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); {112672#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:53,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {112672#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T5_E~0;~T5_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T6_E~0;~T6_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_5~0;~E_5~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_6~0;~E_6~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {112587#(= ~T1_E~0 ~M_E~0)} #1332#return; {112586#false} is VALID [2022-02-20 20:00:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 20:00:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {112674#(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(~t4_st~0)| ~t4_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;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; {112585#true} is VALID [2022-02-20 20:00:53,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {112585#true} assume !(1 == ~m_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {112585#true} is_master_triggered_~__retres1~4#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {112585#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {112585#true} #t~ret30#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp~6#1 := #t~ret30#1;havoc #t~ret30#1; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {112585#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {112585#true} assume 1 == ~t1_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {112585#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {112585#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112585#true} is VALID [2022-02-20 20:00:53,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {112585#true} #t~ret31#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___0~4#1 := #t~ret31#1;havoc #t~ret31#1; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {112585#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {112585#true} assume !(1 == ~t2_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {112585#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {112585#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {112585#true} #t~ret32#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___1~1#1 := #t~ret32#1;havoc #t~ret32#1; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {112585#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {112585#true} assume 1 == ~t3_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {112585#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {112585#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {112585#true} #t~ret33#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___2~0#1 := #t~ret33#1;havoc #t~ret33#1; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {112585#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {112585#true} assume 1 == ~t4_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {112585#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {112585#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {112585#true} #t~ret34#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___3~0#1 := #t~ret34#1;havoc #t~ret34#1; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {112585#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {112585#true} assume !(1 == ~t5_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {112585#true} is_transmit5_triggered_~__retres1~9#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {112585#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {112585#true} #t~ret35#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___4~0#1 := #t~ret35#1;havoc #t~ret35#1; {112585#true} is VALID [2022-02-20 20:00:53,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {112585#true} assume !(0 != ~tmp___4~0#1); {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {112585#true} assume 1 == ~t6_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {112585#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {112585#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {112585#true} #t~ret36#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___5~0#1 := #t~ret36#1;havoc #t~ret36#1; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {112585#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,227 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {112585#true} {112586#false} #1334#return; {112586#false} is VALID [2022-02-20 20:00:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 20:00:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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; {112585#true} is VALID [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {112585#true} assume !(1 == ~T1_E~0); {112585#true} is VALID [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {112585#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {112585#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {112585#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {112585#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {112585#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {112585#true} assume 1 == ~E_M~0;~E_M~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {112585#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {112585#true} assume !(1 == ~E_2~0); {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {112585#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {112585#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {112585#true} assume 1 == ~E_5~0;~E_5~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {112585#true} assume 1 == ~E_6~0;~E_6~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,234 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {112585#true} {112586#false} #1336#return; {112586#false} is VALID [2022-02-20 20:00:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-20 20:00:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {112585#true} havoc ~__retres1~11; {112585#true} is VALID [2022-02-20 20:00:53,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {112585#true} assume 0 == ~m_st~0;~__retres1~11 := 1; {112585#true} is VALID [2022-02-20 20:00:53,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {112585#true} #res := ~__retres1~11; {112585#true} is VALID [2022-02-20 20:00:53,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,237 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {112585#true} {112586#false} #1338#return; {112586#false} is VALID [2022-02-20 20:00:53,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {112585#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~12#1;havoc main2_~__retres1~12#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; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret38#1, start_simulation2_#t~ret39#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; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {112585#true} is VALID [2022-02-20 20:00:53,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,240 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {112585#true} {112587#(= ~T1_E~0 ~M_E~0)} #1330#return; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t5_i~0;~t5_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t6_i~0;~t6_st~0 := 0; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {112587#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:53,243 INFO L272 TraceCheckUtils]: 16: Hoare triple {112587#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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:00:53,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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); {112672#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:53,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {112672#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T5_E~0;~T5_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T6_E~0;~T6_E~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_5~0;~E_5~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_6~0;~E_6~0 := 1; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:53,248 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {112673#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {112587#(= ~T1_E~0 ~M_E~0)} #1332#return; {112586#false} is VALID [2022-02-20 20:00:53,248 INFO L272 TraceCheckUtils]: 33: Hoare triple {112586#false} call activate_threads2(); {112674#(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(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {112674#(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(~t4_st~0)| ~t4_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;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; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {112585#true} assume !(1 == ~m_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {112585#true} is_master_triggered_~__retres1~4#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {112585#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {112585#true} #t~ret30#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp~6#1 := #t~ret30#1;havoc #t~ret30#1; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {112585#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {112585#true} assume 1 == ~t1_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {112585#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {112585#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {112585#true} #t~ret31#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___0~4#1 := #t~ret31#1;havoc #t~ret31#1; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {112585#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {112585#true} assume !(1 == ~t2_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {112585#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {112585#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112585#true} is VALID [2022-02-20 20:00:53,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {112585#true} #t~ret32#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___1~1#1 := #t~ret32#1;havoc #t~ret32#1; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {112585#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {112585#true} assume 1 == ~t3_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {112585#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {112585#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {112585#true} #t~ret33#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___2~0#1 := #t~ret33#1;havoc #t~ret33#1; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {112585#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {112585#true} assume 1 == ~t4_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {112585#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {112585#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {112585#true} #t~ret34#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___3~0#1 := #t~ret34#1;havoc #t~ret34#1; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {112585#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {112585#true} assume !(1 == ~t5_pc~0); {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {112585#true} is_transmit5_triggered_~__retres1~9#1 := 0; {112585#true} is VALID [2022-02-20 20:00:53,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {112585#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {112585#true} #t~ret35#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___4~0#1 := #t~ret35#1;havoc #t~ret35#1; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {112585#true} assume !(0 != ~tmp___4~0#1); {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 70: Hoare triple {112585#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; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 71: Hoare triple {112585#true} assume 1 == ~t6_pc~0; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {112585#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {112585#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {112585#true} #t~ret36#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___5~0#1 := #t~ret36#1;havoc #t~ret36#1; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {112585#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {112585#true} is VALID [2022-02-20 20:00:53,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {112585#true} {112586#false} #1334#return; {112586#false} is VALID [2022-02-20 20:00:53,254 INFO L272 TraceCheckUtils]: 78: Hoare triple {112586#false} call reset_delta_events2(); {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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:00:53,254 INFO L290 TraceCheckUtils]: 79: Hoare triple {112671#(and (= ~E_6~0 |old(~E_6~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~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_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; {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 80: Hoare triple {112585#true} assume !(1 == ~T1_E~0); {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 81: Hoare triple {112585#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {112585#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {112585#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {112585#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 85: Hoare triple {112585#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 86: Hoare triple {112585#true} assume 1 == ~E_M~0;~E_M~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 87: Hoare triple {112585#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 88: Hoare triple {112585#true} assume !(1 == ~E_2~0); {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 89: Hoare triple {112585#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 90: Hoare triple {112585#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {112585#true} assume 1 == ~E_5~0;~E_5~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {112585#true} assume 1 == ~E_6~0;~E_6~0 := 2; {112585#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,256 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {112585#true} {112586#false} #1336#return; {112586#false} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 95: Hoare triple {112586#false} assume !false; {112586#false} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 96: Hoare triple {112586#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_~tmp~5#1;havoc eval2_~tmp~5#1; {112586#false} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 97: Hoare triple {112586#false} assume !false; {112586#false} is VALID [2022-02-20 20:00:53,256 INFO L272 TraceCheckUtils]: 98: Hoare triple {112586#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {112585#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 99: Hoare triple {112585#true} havoc ~__retres1~11; {112585#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 100: Hoare triple {112585#true} assume 0 == ~m_st~0;~__retres1~11 := 1; {112585#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {112585#true} #res := ~__retres1~11; {112585#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 102: Hoare triple {112585#true} assume true; {112585#true} is VALID [2022-02-20 20:00:53,257 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {112585#true} {112586#false} #1338#return; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 104: Hoare triple {112586#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; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 105: Hoare triple {112586#false} assume 0 != eval2_~tmp~5#1; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 106: Hoare triple {112586#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; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 107: Hoare triple {112586#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; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 108: Hoare triple {112586#false} assume !(0 == ~m_pc~0); {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 109: Hoare triple {112586#false} assume 1 == ~m_pc~0; {112586#false} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 110: Hoare triple {112586#false} assume ~token~0 != 6 + ~local~0; {112586#false} is VALID [2022-02-20 20:00:53,258 INFO L272 TraceCheckUtils]: 111: Hoare triple {112586#false} call error2(); {112586#false} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 112: Hoare triple {112586#false} assume !false; {112586#false} is VALID [2022-02-20 20:00:53,258 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:53,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:53,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181159498] [2022-02-20 20:00:53,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181159498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:53,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:53,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:53,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633591907] [2022-02-20 20:00:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2022-02-20 20:00:53,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:53,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:53,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:53,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:53,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:53,330 INFO L87 Difference]: Start difference. First operand 3018 states and 3834 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)