./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.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.01.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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:16,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:16,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:16,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:16,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:16,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:16,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:16,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:16,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:16,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:16,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:16,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:16,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:16,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:16,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:16,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:16,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:16,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:16,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:16,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:16,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:16,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:16,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:16,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:16,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:16,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:16,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:16,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:16,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:16,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:16,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:16,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:16,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:16,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:16,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:16,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:16,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:16,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:16,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:16,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:16,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:16,105 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:16,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:16,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:16,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:16,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:16,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:16,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:16,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:16,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:16,138 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:16,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:16,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:16,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:16,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:16,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:16,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:16,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:16,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:16,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:16,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:16,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:16,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:16,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:16,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:16,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:16,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:16,143 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:16,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:16,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:16,144 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2022-02-20 19:59:16,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:16,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:16,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:16,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:16,367 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:16,368 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.01.cil-1.c [2022-02-20 19:59:16,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958a2af05/6304baee799241e1a46aee39cebdd6e1/FLAG9b1141e68 [2022-02-20 19:59:16,838 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:16,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-02-20 19:59:16,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958a2af05/6304baee799241e1a46aee39cebdd6e1/FLAG9b1141e68 [2022-02-20 19:59:17,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958a2af05/6304baee799241e1a46aee39cebdd6e1 [2022-02-20 19:59:17,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:17,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:17,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:17,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:17,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd9acfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17, skipping insertion in model container [2022-02-20 19:59:17,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:17,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:17,412 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.01.cil-1.c[911,924] [2022-02-20 19:59:17,461 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.01.cil-1.c[8416,8429] [2022-02-20 19:59:17,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,502 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:17,511 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.01.cil-1.c[911,924] [2022-02-20 19:59:17,534 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.01.cil-1.c[8416,8429] [2022-02-20 19:59:17,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,567 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:17,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17 WrapperNode [2022-02-20 19:59:17,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:17,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:17,574 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:17" (1/1) ... [2022-02-20 19:59:17,586 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:17" (1/1) ... [2022-02-20 19:59:17,636 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2022-02-20 19:59:17,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:17,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:17,644 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:17" (1/1) ... [2022-02-20 19:59:17,644 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:17" (1/1) ... [2022-02-20 19:59:17,647 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:17" (1/1) ... [2022-02-20 19:59:17,648 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:17" (1/1) ... [2022-02-20 19:59:17,658 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:17" (1/1) ... [2022-02-20 19:59:17,665 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:17" (1/1) ... [2022-02-20 19:59:17,667 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:17" (1/1) ... [2022-02-20 19:59:17,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:17,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:17,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:17,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:17,718 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:17,721 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:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:17,746 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:17,746 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:17,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:17,749 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:17,749 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:17,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:17,750 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:17,821 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:17,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:18,265 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:18,266 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:18,295 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:18,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:18,304 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:59:18,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18 BoogieIcfgContainer [2022-02-20 19:59:18,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:18,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:18,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:18,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:18,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:17" (1/3) ... [2022-02-20 19:59:18,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933eb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (2/3) ... [2022-02-20 19:59:18,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933eb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18" (3/3) ... [2022-02-20 19:59:18,312 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-02-20 19:59:18,316 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:18,316 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:18,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:18,363 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:18,363 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:59:18,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,401 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] [2022-02-20 19:59:18,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2022-02-20 19:59:18,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:18,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162174498] [2022-02-20 19:59:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,662 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {227#true} {229#(= ~M_E~0 2)} #741#return; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#(= |old(~M_E~0)| 0)} assume true; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,721 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {264#(= |old(~M_E~0)| 0)} {229#(= ~M_E~0 2)} #743#return; {228#false} is VALID [2022-02-20 19:59:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {227#true} is VALID [2022-02-20 19:59:18,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(1 == ~m_pc~0); {227#true} is VALID [2022-02-20 19:59:18,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} is_master_triggered_~__retres1~4#1 := 0; {227#true} is VALID [2022-02-20 19:59:18,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {227#true} is VALID [2022-02-20 19:59:18,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {227#true} is VALID [2022-02-20 19:59:18,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {227#true} is VALID [2022-02-20 19:59:18,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#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; {227#true} is VALID [2022-02-20 19:59:18,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#true} assume 1 == ~t1_pc~0; {227#true} is VALID [2022-02-20 19:59:18,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {227#true} is VALID [2022-02-20 19:59:18,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {227#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {227#true} is VALID [2022-02-20 19:59:18,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {227#true} is VALID [2022-02-20 19:59:18,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {227#true} is VALID [2022-02-20 19:59:18,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,781 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {227#true} {228#false} #745#return; {228#false} is VALID [2022-02-20 19:59:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume 1 == ~E_M~0;~E_M~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#true} assume 1 == ~E_1~0;~E_1~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,796 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {227#true} {228#false} #747#return; {228#false} is VALID [2022-02-20 19:59:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#true} havoc ~__retres1~6; {227#true} is VALID [2022-02-20 19:59:18,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {227#true} is VALID [2022-02-20 19:59:18,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} #res := ~__retres1~6; {227#true} is VALID [2022-02-20 19:59:18,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,804 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {227#true} {228#false} #749#return; {228#false} is VALID [2022-02-20 19:59:18,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#(= ~M_E~0 2)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#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; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#(= ~M_E~0 2)} call update_channels2(); {227#true} is VALID [2022-02-20 19:59:18,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,812 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {227#true} {229#(= ~M_E~0 2)} #741#return; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {229#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:18,817 INFO L272 TraceCheckUtils]: 11: Hoare triple {229#(= ~M_E~0 2)} call fire_delta_events2(); {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:18,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {264#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(= |old(~M_E~0)| 0)} assume true; {264#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:18,827 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {264#(= |old(~M_E~0)| 0)} {229#(= ~M_E~0 2)} #743#return; {228#false} is VALID [2022-02-20 19:59:18,828 INFO L272 TraceCheckUtils]: 18: Hoare triple {228#false} call activate_threads2(); {265#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:18,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {227#true} is VALID [2022-02-20 19:59:18,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {227#true} assume !(1 == ~m_pc~0); {227#true} is VALID [2022-02-20 19:59:18,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {227#true} is_master_triggered_~__retres1~4#1 := 0; {227#true} is VALID [2022-02-20 19:59:18,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {227#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {227#true} is VALID [2022-02-20 19:59:18,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {227#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {227#true} is VALID [2022-02-20 19:59:18,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {227#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {227#true} is VALID [2022-02-20 19:59:18,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {227#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; {227#true} is VALID [2022-02-20 19:59:18,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {227#true} assume 1 == ~t1_pc~0; {227#true} is VALID [2022-02-20 19:59:18,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {227#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {227#true} is VALID [2022-02-20 19:59:18,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {227#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {227#true} is VALID [2022-02-20 19:59:18,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {227#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {227#true} is VALID [2022-02-20 19:59:18,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {227#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {227#true} is VALID [2022-02-20 19:59:18,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,833 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {227#true} {228#false} #745#return; {228#false} is VALID [2022-02-20 19:59:18,833 INFO L272 TraceCheckUtils]: 33: Hoare triple {228#false} call reset_delta_events2(); {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:18,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {263#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {227#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {227#true} assume 1 == ~E_M~0;~E_M~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {227#true} assume 1 == ~E_1~0;~E_1~0 := 2; {227#true} is VALID [2022-02-20 19:59:18,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,834 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {227#true} {228#false} #747#return; {228#false} is VALID [2022-02-20 19:59:18,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-02-20 19:59:18,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {228#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {228#false} is VALID [2022-02-20 19:59:18,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-02-20 19:59:18,836 INFO L272 TraceCheckUtils]: 43: Hoare triple {228#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {227#true} is VALID [2022-02-20 19:59:18,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {227#true} havoc ~__retres1~6; {227#true} is VALID [2022-02-20 19:59:18,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {227#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {227#true} is VALID [2022-02-20 19:59:18,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {227#true} #res := ~__retres1~6; {227#true} is VALID [2022-02-20 19:59:18,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {227#true} assume true; {227#true} is VALID [2022-02-20 19:59:18,837 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {227#true} {228#false} #749#return; {228#false} is VALID [2022-02-20 19:59:18,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {228#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {228#false} is VALID [2022-02-20 19:59:18,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {228#false} assume 0 != eval2_~tmp~5#1; {228#false} is VALID [2022-02-20 19:59:18,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {228#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {228#false} is VALID [2022-02-20 19:59:18,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {228#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {228#false} is VALID [2022-02-20 19:59:18,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {228#false} assume !(0 == ~m_pc~0); {228#false} is VALID [2022-02-20 19:59:18,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {228#false} assume 1 == ~m_pc~0; {228#false} is VALID [2022-02-20 19:59:18,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {228#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {228#false} is VALID [2022-02-20 19:59:18,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-02-20 19:59:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:18,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162174498] [2022-02-20 19:59:18,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162174498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:18,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595629569] [2022-02-20 19:59:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:18,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:18,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:18,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:18,943 INFO L87 Difference]: Start difference. First operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:20,944 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2022-02-20 19:59:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 842 transitions. [2022-02-20 19:59:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 842 transitions. [2022-02-20 19:59:20,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 842 transitions. [2022-02-20 19:59:21,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 842 edges. 842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:21,673 INFO L225 Difference]: With dead ends: 562 [2022-02-20 19:59:21,673 INFO L226 Difference]: Without dead ends: 345 [2022-02-20 19:59:21,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:21,680 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 556 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:21,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 812 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-20 19:59:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2022-02-20 19:59:21,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:21,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:21,731 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:21,733 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,753 INFO L93 Difference]: Finished difference Result 345 states and 492 transitions. [2022-02-20 19:59:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 492 transitions. [2022-02-20 19:59:21,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:21,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:21,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) Second operand 345 states. [2022-02-20 19:59:21,773 INFO L87 Difference]: Start difference. First operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) Second operand 345 states. [2022-02-20 19:59:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,791 INFO L93 Difference]: Finished difference Result 345 states and 492 transitions. [2022-02-20 19:59:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 492 transitions. [2022-02-20 19:59:21,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:21,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:21,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:21,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2022-02-20 19:59:21,813 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2022-02-20 19:59:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:21,813 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2022-02-20 19:59:21,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2022-02-20 19:59:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:59:21,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:21,817 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] [2022-02-20 19:59:21,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:21,818 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2022-02-20 19:59:21,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:21,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672787172] [2022-02-20 19:59:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,907 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2159#true} {2161#(= ~T1_E~0 ~M_E~0)} #741#return; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2196#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:21,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,941 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2161#(= ~T1_E~0 ~M_E~0)} #743#return; {2160#false} is VALID [2022-02-20 19:59:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {2198#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {2159#true} is VALID [2022-02-20 19:59:21,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2159#true} assume !(1 == ~m_pc~0); {2159#true} is VALID [2022-02-20 19:59:21,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {2159#true} is_master_triggered_~__retres1~4#1 := 0; {2159#true} is VALID [2022-02-20 19:59:21,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {2159#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2159#true} is VALID [2022-02-20 19:59:21,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {2159#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {2159#true} is VALID [2022-02-20 19:59:21,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {2159#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2159#true} is VALID [2022-02-20 19:59:21,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {2159#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; {2159#true} is VALID [2022-02-20 19:59:21,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {2159#true} assume 1 == ~t1_pc~0; {2159#true} is VALID [2022-02-20 19:59:21,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {2159#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2159#true} is VALID [2022-02-20 19:59:21,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {2159#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2159#true} is VALID [2022-02-20 19:59:21,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {2159#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {2159#true} is VALID [2022-02-20 19:59:21,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2159#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {2159#true} is VALID [2022-02-20 19:59:21,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,963 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2159#true} {2160#false} #745#return; {2160#false} is VALID [2022-02-20 19:59:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2159#true} is VALID [2022-02-20 19:59:21,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2159#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2159#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {2159#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,969 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2159#true} {2160#false} #747#return; {2160#false} is VALID [2022-02-20 19:59:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:21,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {2159#true} havoc ~__retres1~6; {2159#true} is VALID [2022-02-20 19:59:21,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {2159#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2159#true} is VALID [2022-02-20 19:59:21,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2159#true} #res := ~__retres1~6; {2159#true} is VALID [2022-02-20 19:59:21,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,974 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2159#true} {2160#false} #749#return; {2160#false} is VALID [2022-02-20 19:59:21,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {2159#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#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; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {2159#true} is VALID [2022-02-20 19:59:21,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,977 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2159#true} {2161#(= ~T1_E~0 ~M_E~0)} #741#return; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {2161#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:21,979 INFO L272 TraceCheckUtils]: 11: Hoare triple {2161#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:21,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2196#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:21,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2196#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:21,982 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2197#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2161#(= ~T1_E~0 ~M_E~0)} #743#return; {2160#false} is VALID [2022-02-20 19:59:21,982 INFO L272 TraceCheckUtils]: 18: Hoare triple {2160#false} call activate_threads2(); {2198#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:21,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2198#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {2159#true} is VALID [2022-02-20 19:59:21,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {2159#true} assume !(1 == ~m_pc~0); {2159#true} is VALID [2022-02-20 19:59:21,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#true} is_master_triggered_~__retres1~4#1 := 0; {2159#true} is VALID [2022-02-20 19:59:21,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2159#true} is VALID [2022-02-20 19:59:21,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {2159#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {2159#true} is VALID [2022-02-20 19:59:21,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {2159#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2159#true} is VALID [2022-02-20 19:59:21,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {2159#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; {2159#true} is VALID [2022-02-20 19:59:21,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {2159#true} assume 1 == ~t1_pc~0; {2159#true} is VALID [2022-02-20 19:59:21,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {2159#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2159#true} is VALID [2022-02-20 19:59:21,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {2159#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2159#true} is VALID [2022-02-20 19:59:21,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {2159#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {2159#true} is VALID [2022-02-20 19:59:21,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {2159#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {2159#true} is VALID [2022-02-20 19:59:21,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,985 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2159#true} {2160#false} #745#return; {2160#false} is VALID [2022-02-20 19:59:21,985 INFO L272 TraceCheckUtils]: 33: Hoare triple {2160#false} call reset_delta_events2(); {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:21,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {2195#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2159#true} is VALID [2022-02-20 19:59:21,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {2159#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {2159#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {2159#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2159#true} is VALID [2022-02-20 19:59:21,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,987 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2159#true} {2160#false} #747#return; {2160#false} is VALID [2022-02-20 19:59:21,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2022-02-20 19:59:21,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {2160#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {2160#false} is VALID [2022-02-20 19:59:21,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2022-02-20 19:59:21,987 INFO L272 TraceCheckUtils]: 43: Hoare triple {2160#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {2159#true} is VALID [2022-02-20 19:59:21,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {2159#true} havoc ~__retres1~6; {2159#true} is VALID [2022-02-20 19:59:21,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {2159#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2159#true} is VALID [2022-02-20 19:59:21,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {2159#true} #res := ~__retres1~6; {2159#true} is VALID [2022-02-20 19:59:21,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {2159#true} assume true; {2159#true} is VALID [2022-02-20 19:59:21,988 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2159#true} {2160#false} #749#return; {2160#false} is VALID [2022-02-20 19:59:21,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {2160#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {2160#false} is VALID [2022-02-20 19:59:21,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {2160#false} assume 0 != eval2_~tmp~5#1; {2160#false} is VALID [2022-02-20 19:59:21,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {2160#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {2160#false} is VALID [2022-02-20 19:59:21,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {2160#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {2160#false} is VALID [2022-02-20 19:59:21,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {2160#false} assume !(0 == ~m_pc~0); {2160#false} is VALID [2022-02-20 19:59:21,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {2160#false} assume 1 == ~m_pc~0; {2160#false} is VALID [2022-02-20 19:59:21,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {2160#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {2160#false} is VALID [2022-02-20 19:59:21,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2022-02-20 19:59:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:21,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:21,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672787172] [2022-02-20 19:59:21,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672787172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:21,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:21,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:21,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210500793] [2022-02-20 19:59:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:21,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:21,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:22,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:22,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:22,031 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,346 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2022-02-20 19:59:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 625 transitions. [2022-02-20 19:59:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 625 transitions. [2022-02-20 19:59:24,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 625 transitions. [2022-02-20 19:59:24,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:24,844 INFO L225 Difference]: With dead ends: 636 [2022-02-20 19:59:24,844 INFO L226 Difference]: Without dead ends: 453 [2022-02-20 19:59:24,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:24,847 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 533 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 1105 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-20 19:59:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2022-02-20 19:59:24,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:24,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:24,872 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:24,873 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,892 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-02-20 19:59:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 642 transitions. [2022-02-20 19:59:24,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:24,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:24,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 453 states. [2022-02-20 19:59:24,897 INFO L87 Difference]: Start difference. First operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 453 states. [2022-02-20 19:59:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,915 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-02-20 19:59:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 642 transitions. [2022-02-20 19:59:24,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:24,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:24,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2022-02-20 19:59:24,935 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2022-02-20 19:59:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:24,936 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2022-02-20 19:59:24,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2022-02-20 19:59:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:59:24,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:24,938 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] [2022-02-20 19:59:24,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:24,938 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2022-02-20 19:59:24,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:24,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250799038] [2022-02-20 19:59:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:24,983 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4523#true} {4525#(= ~E_M~0 ~M_E~0)} #741#return; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:25,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:25,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,019 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {4525#(= ~E_M~0 ~M_E~0)} #743#return; {4524#false} is VALID [2022-02-20 19:59:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {4562#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {4523#true} is VALID [2022-02-20 19:59:25,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {4523#true} assume !(1 == ~m_pc~0); {4523#true} is VALID [2022-02-20 19:59:25,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4523#true} is_master_triggered_~__retres1~4#1 := 0; {4523#true} is VALID [2022-02-20 19:59:25,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {4523#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4523#true} is VALID [2022-02-20 19:59:25,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {4523#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {4523#true} is VALID [2022-02-20 19:59:25,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {4523#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {4523#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; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {4523#true} assume 1 == ~t1_pc~0; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {4523#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {4523#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {4523#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {4523#true} is VALID [2022-02-20 19:59:25,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {4523#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {4523#true} is VALID [2022-02-20 19:59:25,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,059 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4523#true} {4524#false} #745#return; {4524#false} is VALID [2022-02-20 19:59:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4523#true} is VALID [2022-02-20 19:59:25,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {4523#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {4523#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {4523#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,067 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4523#true} {4524#false} #747#return; {4524#false} is VALID [2022-02-20 19:59:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {4523#true} havoc ~__retres1~6; {4523#true} is VALID [2022-02-20 19:59:25,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {4523#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4523#true} is VALID [2022-02-20 19:59:25,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {4523#true} #res := ~__retres1~6; {4523#true} is VALID [2022-02-20 19:59:25,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,075 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4523#true} {4524#false} #749#return; {4524#false} is VALID [2022-02-20 19:59:25,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {4523#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#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; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} call update_channels2(); {4523#true} is VALID [2022-02-20 19:59:25,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,078 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4523#true} {4525#(= ~E_M~0 ~M_E~0)} #741#return; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {4525#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:59:25,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#(= ~E_M~0 ~M_E~0)} call fire_delta_events2(); {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {4560#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:25,083 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4561#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {4525#(= ~E_M~0 ~M_E~0)} #743#return; {4524#false} is VALID [2022-02-20 19:59:25,083 INFO L272 TraceCheckUtils]: 18: Hoare triple {4524#false} call activate_threads2(); {4562#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {4562#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {4523#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {4523#true} assume !(1 == ~m_pc~0); {4523#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {4523#true} is_master_triggered_~__retres1~4#1 := 0; {4523#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {4523#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4523#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {4523#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {4523#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {4523#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4523#true} is VALID [2022-02-20 19:59:25,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {4523#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; {4523#true} is VALID [2022-02-20 19:59:25,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {4523#true} assume 1 == ~t1_pc~0; {4523#true} is VALID [2022-02-20 19:59:25,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {4523#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4523#true} is VALID [2022-02-20 19:59:25,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {4523#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4523#true} is VALID [2022-02-20 19:59:25,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {4523#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {4523#true} is VALID [2022-02-20 19:59:25,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {4523#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {4523#true} is VALID [2022-02-20 19:59:25,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,093 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4523#true} {4524#false} #745#return; {4524#false} is VALID [2022-02-20 19:59:25,093 INFO L272 TraceCheckUtils]: 33: Hoare triple {4524#false} call reset_delta_events2(); {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:25,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {4559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4523#true} is VALID [2022-02-20 19:59:25,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {4523#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {4523#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {4523#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4523#true} is VALID [2022-02-20 19:59:25,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,095 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4523#true} {4524#false} #747#return; {4524#false} is VALID [2022-02-20 19:59:25,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {4524#false} assume !false; {4524#false} is VALID [2022-02-20 19:59:25,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {4524#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {4524#false} is VALID [2022-02-20 19:59:25,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {4524#false} assume !false; {4524#false} is VALID [2022-02-20 19:59:25,098 INFO L272 TraceCheckUtils]: 43: Hoare triple {4524#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {4523#true} is VALID [2022-02-20 19:59:25,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {4523#true} havoc ~__retres1~6; {4523#true} is VALID [2022-02-20 19:59:25,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {4523#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4523#true} is VALID [2022-02-20 19:59:25,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {4523#true} #res := ~__retres1~6; {4523#true} is VALID [2022-02-20 19:59:25,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {4523#true} assume true; {4523#true} is VALID [2022-02-20 19:59:25,099 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4523#true} {4524#false} #749#return; {4524#false} is VALID [2022-02-20 19:59:25,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {4524#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {4524#false} is VALID [2022-02-20 19:59:25,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {4524#false} assume 0 != eval2_~tmp~5#1; {4524#false} is VALID [2022-02-20 19:59:25,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {4524#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {4524#false} is VALID [2022-02-20 19:59:25,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {4524#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {4524#false} is VALID [2022-02-20 19:59:25,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {4524#false} assume !(0 == ~m_pc~0); {4524#false} is VALID [2022-02-20 19:59:25,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {4524#false} assume 1 == ~m_pc~0; {4524#false} is VALID [2022-02-20 19:59:25,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {4524#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {4524#false} is VALID [2022-02-20 19:59:25,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {4524#false} assume !false; {4524#false} is VALID [2022-02-20 19:59:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:25,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:25,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250799038] [2022-02-20 19:59:25,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250799038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:25,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:25,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:25,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334234230] [2022-02-20 19:59:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:25,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:25,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:25,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:25,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:25,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:25,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:25,148 INFO L87 Difference]: Start difference. First operand 389 states and 547 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,344 INFO L93 Difference]: Finished difference Result 972 states and 1371 transitions. [2022-02-20 19:59:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:59:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 662 transitions. [2022-02-20 19:59:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 662 transitions. [2022-02-20 19:59:27,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 662 transitions. [2022-02-20 19:59:27,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 662 edges. 662 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:27,872 INFO L225 Difference]: With dead ends: 972 [2022-02-20 19:59:27,872 INFO L226 Difference]: Without dead ends: 704 [2022-02-20 19:59:27,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:27,881 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 546 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:27,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1110 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-20 19:59:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 554. [2022-02-20 19:59:27,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:27,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:27,921 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:27,923 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,948 INFO L93 Difference]: Finished difference Result 704 states and 989 transitions. [2022-02-20 19:59:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 989 transitions. [2022-02-20 19:59:27,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) Second operand 704 states. [2022-02-20 19:59:27,953 INFO L87 Difference]: Start difference. First operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) Second operand 704 states. [2022-02-20 19:59:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,982 INFO L93 Difference]: Finished difference Result 704 states and 989 transitions. [2022-02-20 19:59:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 989 transitions. [2022-02-20 19:59:27,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:27,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 778 transitions. [2022-02-20 19:59:28,012 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 778 transitions. Word has length 57 [2022-02-20 19:59:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:28,012 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 778 transitions. [2022-02-20 19:59:28,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 778 transitions. [2022-02-20 19:59:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:59:28,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:28,014 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] [2022-02-20 19:59:28,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:28,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2022-02-20 19:59:28,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:28,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765995387] [2022-02-20 19:59:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,056 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {8059#true} {8059#true} #741#return; {8059#true} is VALID [2022-02-20 19:59:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {8059#true} is VALID [2022-02-20 19:59:28,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} assume !(0 == ~T1_E~0); {8059#true} is VALID [2022-02-20 19:59:28,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} assume !(0 == ~E_M~0); {8059#true} is VALID [2022-02-20 19:59:28,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {8059#true} assume !(0 == ~E_1~0); {8059#true} is VALID [2022-02-20 19:59:28,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,075 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8059#true} {8059#true} #743#return; {8059#true} is VALID [2022-02-20 19:59:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {8095#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {8059#true} is VALID [2022-02-20 19:59:28,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} assume !(1 == ~m_pc~0); {8059#true} is VALID [2022-02-20 19:59:28,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} is_master_triggered_~__retres1~4#1 := 0; {8096#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:59:28,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {8096#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8097#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:28,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {8097#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {8098#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:28,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {8098#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {8060#false} is VALID [2022-02-20 19:59:28,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {8060#false} 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; {8060#false} is VALID [2022-02-20 19:59:28,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {8060#false} assume 1 == ~t1_pc~0; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {8060#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {8060#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {8060#false} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {8060#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {8060#false} assume true; {8060#false} is VALID [2022-02-20 19:59:28,154 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8060#false} {8059#true} #745#return; {8060#false} is VALID [2022-02-20 19:59:28,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {8059#true} is VALID [2022-02-20 19:59:28,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {8059#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,162 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8059#true} {8060#false} #747#return; {8060#false} is VALID [2022-02-20 19:59:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {8059#true} havoc ~__retres1~6; {8059#true} is VALID [2022-02-20 19:59:28,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8059#true} is VALID [2022-02-20 19:59:28,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} #res := ~__retres1~6; {8059#true} is VALID [2022-02-20 19:59:28,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,167 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8059#true} {8060#false} #749#return; {8060#false} is VALID [2022-02-20 19:59:28,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {8059#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {8059#true} is VALID [2022-02-20 19:59:28,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {8059#true} is VALID [2022-02-20 19:59:28,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {8059#true} is VALID [2022-02-20 19:59:28,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {8059#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#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; {8059#true} is VALID [2022-02-20 19:59:28,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {8059#true} call update_channels2(); {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8059#true} {8059#true} #741#return; {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {8059#true} assume { :begin_inline_init_threads2 } true; {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {8059#true} assume 1 == ~m_i~0;~m_st~0 := 0; {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {8059#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {8059#true} is VALID [2022-02-20 19:59:28,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {8059#true} assume { :end_inline_init_threads2 } true; {8059#true} is VALID [2022-02-20 19:59:28,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {8059#true} call fire_delta_events2(); {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:28,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {8059#true} is VALID [2022-02-20 19:59:28,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {8059#true} assume !(0 == ~T1_E~0); {8059#true} is VALID [2022-02-20 19:59:28,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {8059#true} assume !(0 == ~E_M~0); {8059#true} is VALID [2022-02-20 19:59:28,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {8059#true} assume !(0 == ~E_1~0); {8059#true} is VALID [2022-02-20 19:59:28,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,174 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8059#true} {8059#true} #743#return; {8059#true} is VALID [2022-02-20 19:59:28,174 INFO L272 TraceCheckUtils]: 18: Hoare triple {8059#true} call activate_threads2(); {8095#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:28,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {8095#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {8059#true} is VALID [2022-02-20 19:59:28,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {8059#true} assume !(1 == ~m_pc~0); {8059#true} is VALID [2022-02-20 19:59:28,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#true} is_master_triggered_~__retres1~4#1 := 0; {8096#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:59:28,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {8096#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8097#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:28,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {8097#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {8098#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {8098#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {8060#false} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {8060#false} 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; {8060#false} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {8060#false} assume 1 == ~t1_pc~0; {8060#false} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {8060#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8060#false} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {8060#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8060#false} is VALID [2022-02-20 19:59:28,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {8060#false} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {8060#false} is VALID [2022-02-20 19:59:28,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {8060#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {8060#false} is VALID [2022-02-20 19:59:28,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {8060#false} assume true; {8060#false} is VALID [2022-02-20 19:59:28,178 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8060#false} {8059#true} #745#return; {8060#false} is VALID [2022-02-20 19:59:28,178 INFO L272 TraceCheckUtils]: 33: Hoare triple {8060#false} call reset_delta_events2(); {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:28,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {8094#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {8059#true} is VALID [2022-02-20 19:59:28,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {8059#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {8059#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {8059#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8059#true} is VALID [2022-02-20 19:59:28,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,184 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8059#true} {8060#false} #747#return; {8060#false} is VALID [2022-02-20 19:59:28,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {8060#false} assume !false; {8060#false} is VALID [2022-02-20 19:59:28,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {8060#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {8060#false} is VALID [2022-02-20 19:59:28,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {8060#false} assume !false; {8060#false} is VALID [2022-02-20 19:59:28,184 INFO L272 TraceCheckUtils]: 43: Hoare triple {8060#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {8059#true} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {8059#true} havoc ~__retres1~6; {8059#true} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {8059#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8059#true} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {8059#true} #res := ~__retres1~6; {8059#true} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-02-20 19:59:28,185 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8059#true} {8060#false} #749#return; {8060#false} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {8060#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {8060#false} is VALID [2022-02-20 19:59:28,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {8060#false} assume 0 != eval2_~tmp~5#1; {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {8060#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {8060#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {8060#false} assume !(0 == ~m_pc~0); {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {8060#false} assume 1 == ~m_pc~0; {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {8060#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {8060#false} is VALID [2022-02-20 19:59:28,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {8060#false} assume !false; {8060#false} is VALID [2022-02-20 19:59:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:28,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:28,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765995387] [2022-02-20 19:59:28,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765995387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:28,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:28,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:28,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801152171] [2022-02-20 19:59:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:28,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:28,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:28,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:28,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:28,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:28,229 INFO L87 Difference]: Start difference. First operand 554 states and 778 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,114 INFO L93 Difference]: Finished difference Result 1144 states and 1638 transitions. [2022-02-20 19:59:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 502 transitions. [2022-02-20 19:59:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 502 transitions. [2022-02-20 19:59:30,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 502 transitions. [2022-02-20 19:59:30,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:30,530 INFO L225 Difference]: With dead ends: 1144 [2022-02-20 19:59:30,530 INFO L226 Difference]: Without dead ends: 712 [2022-02-20 19:59:30,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:59:30,532 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 284 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:30,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1019 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-02-20 19:59:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 569. [2022-02-20 19:59:30,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:30,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 712 states. Second operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:30,607 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:30,609 INFO L87 Difference]: Start difference. First operand 712 states. Second operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,636 INFO L93 Difference]: Finished difference Result 712 states and 1008 transitions. [2022-02-20 19:59:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1008 transitions. [2022-02-20 19:59:30,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:30,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:30,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) Second operand 712 states. [2022-02-20 19:59:30,641 INFO L87 Difference]: Start difference. First operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) Second operand 712 states. [2022-02-20 19:59:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,669 INFO L93 Difference]: Finished difference Result 712 states and 1008 transitions. [2022-02-20 19:59:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1008 transitions. [2022-02-20 19:59:30,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:30,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:30,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:30,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-02-20 19:59:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 793 transitions. [2022-02-20 19:59:30,697 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 793 transitions. Word has length 57 [2022-02-20 19:59:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:30,697 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 793 transitions. [2022-02-20 19:59:30,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 793 transitions. [2022-02-20 19:59:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:59:30,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:30,699 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] [2022-02-20 19:59:30,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:30,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2022-02-20 19:59:30,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:30,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547160601] [2022-02-20 19:59:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,754 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {11859#true} {11861#(= ~m_pc~0 ~t1_pc~0)} #741#return; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11859#true} is VALID [2022-02-20 19:59:30,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {11859#true} assume !(0 == ~T1_E~0); {11859#true} is VALID [2022-02-20 19:59:30,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {11859#true} assume !(0 == ~E_M~0); {11859#true} is VALID [2022-02-20 19:59:30,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {11859#true} assume !(0 == ~E_1~0); {11859#true} is VALID [2022-02-20 19:59:30,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,766 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11859#true} {11861#(= ~m_pc~0 ~t1_pc~0)} #743#return; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {11896#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {11859#true} is VALID [2022-02-20 19:59:30,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {11859#true} assume !(1 == ~m_pc~0); {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,834 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {11861#(= ~m_pc~0 ~t1_pc~0)} #745#return; {11860#false} is VALID [2022-02-20 19:59:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11859#true} is VALID [2022-02-20 19:59:30,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {11859#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {11859#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {11859#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,841 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11859#true} {11860#false} #747#return; {11860#false} is VALID [2022-02-20 19:59:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {11859#true} havoc ~__retres1~6; {11859#true} is VALID [2022-02-20 19:59:30,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {11859#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11859#true} is VALID [2022-02-20 19:59:30,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {11859#true} #res := ~__retres1~6; {11859#true} is VALID [2022-02-20 19:59:30,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,845 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11859#true} {11860#false} #749#return; {11860#false} is VALID [2022-02-20 19:59:30,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {11859#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#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; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {11859#true} is VALID [2022-02-20 19:59:30,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,848 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11859#true} {11861#(= ~m_pc~0 ~t1_pc~0)} #741#return; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,850 INFO L272 TraceCheckUtils]: 11: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:30,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11859#true} is VALID [2022-02-20 19:59:30,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {11859#true} assume !(0 == ~T1_E~0); {11859#true} is VALID [2022-02-20 19:59:30,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {11859#true} assume !(0 == ~E_M~0); {11859#true} is VALID [2022-02-20 19:59:30,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {11859#true} assume !(0 == ~E_1~0); {11859#true} is VALID [2022-02-20 19:59:30,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,851 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11859#true} {11861#(= ~m_pc~0 ~t1_pc~0)} #743#return; {11861#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:30,852 INFO L272 TraceCheckUtils]: 18: Hoare triple {11861#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {11896#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:30,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {11896#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {11859#true} is VALID [2022-02-20 19:59:30,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {11859#true} assume !(1 == ~m_pc~0); {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:30,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {11897#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~4#1 := #t~ret25#1;havoc #t~ret25#1; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:30,858 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11898#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {11861#(= ~m_pc~0 ~t1_pc~0)} #745#return; {11860#false} is VALID [2022-02-20 19:59:30,858 INFO L272 TraceCheckUtils]: 33: Hoare triple {11860#false} call reset_delta_events2(); {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:30,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {11895#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11859#true} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {11859#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {11859#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {11859#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11859#true} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,859 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11859#true} {11860#false} #747#return; {11860#false} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {11860#false} assume !false; {11860#false} is VALID [2022-02-20 19:59:30,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {11860#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {11860#false} is VALID [2022-02-20 19:59:30,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {11860#false} assume !false; {11860#false} is VALID [2022-02-20 19:59:30,860 INFO L272 TraceCheckUtils]: 43: Hoare triple {11860#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {11859#true} is VALID [2022-02-20 19:59:30,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {11859#true} havoc ~__retres1~6; {11859#true} is VALID [2022-02-20 19:59:30,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {11859#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11859#true} is VALID [2022-02-20 19:59:30,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {11859#true} #res := ~__retres1~6; {11859#true} is VALID [2022-02-20 19:59:30,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {11859#true} assume true; {11859#true} is VALID [2022-02-20 19:59:30,860 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11859#true} {11860#false} #749#return; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {11860#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {11860#false} assume 0 != eval2_~tmp~5#1; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {11860#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {11860#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {11860#false} assume !(0 == ~m_pc~0); {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {11860#false} assume 1 == ~m_pc~0; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {11860#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {11860#false} is VALID [2022-02-20 19:59:30,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {11860#false} assume !false; {11860#false} is VALID [2022-02-20 19:59:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:30,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:30,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547160601] [2022-02-20 19:59:30,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547160601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:30,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:30,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:30,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014426050] [2022-02-20 19:59:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:30,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:30,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:30,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:30,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:30,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:30,910 INFO L87 Difference]: Start difference. First operand 569 states and 793 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,302 INFO L93 Difference]: Finished difference Result 2430 states and 3520 transitions. [2022-02-20 19:59:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:59:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:59:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 923 transitions. [2022-02-20 19:59:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 923 transitions. [2022-02-20 19:59:35,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 923 transitions. [2022-02-20 19:59:36,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:36,353 INFO L225 Difference]: With dead ends: 2430 [2022-02-20 19:59:36,353 INFO L226 Difference]: Without dead ends: 1983 [2022-02-20 19:59:36,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:59:36,356 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 1005 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:36,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 985 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2022-02-20 19:59:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1728. [2022-02-20 19:59:37,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:37,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1983 states. Second operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-02-20 19:59:37,110 INFO L74 IsIncluded]: Start isIncluded. First operand 1983 states. Second operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-02-20 19:59:37,115 INFO L87 Difference]: Start difference. First operand 1983 states. Second operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-02-20 19:59:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,295 INFO L93 Difference]: Finished difference Result 1983 states and 2808 transitions. [2022-02-20 19:59:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2808 transitions. [2022-02-20 19:59:37,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:37,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:37,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) Second operand 1983 states. [2022-02-20 19:59:37,312 INFO L87 Difference]: Start difference. First operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) Second operand 1983 states. [2022-02-20 19:59:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,501 INFO L93 Difference]: Finished difference Result 1983 states and 2808 transitions. [2022-02-20 19:59:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2808 transitions. [2022-02-20 19:59:37,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:37,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:37,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:37,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-02-20 19:59:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2405 transitions. [2022-02-20 19:59:37,711 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2405 transitions. Word has length 57 [2022-02-20 19:59:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:37,712 INFO L470 AbstractCegarLoop]: Abstraction has 1728 states and 2405 transitions. [2022-02-20 19:59:37,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2405 transitions. [2022-02-20 19:59:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:37,714 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:37,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:37,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:37,715 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2022-02-20 19:59:37,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:37,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521693973] [2022-02-20 19:59:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {21516#(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); {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21478#(= ~q_read_ev~0 2)} #713#return; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {21518#(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; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {21519#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {21519#(= |old(~q_read_ev~0)| 0)} assume true; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21519#(= |old(~q_read_ev~0)| 0)} {21478#(= ~q_read_ev~0 2)} #715#return; {21477#false} is VALID [2022-02-20 19:59:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {21476#true} havoc ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {21476#true} assume 1 == ~p_dw_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {21476#true} is VALID [2022-02-20 19:59:37,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {21476#true} #res := ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,820 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21476#true} {21476#true} #709#return; {21476#true} is VALID [2022-02-20 19:59:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {21476#true} havoc ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {21476#true} assume 1 == ~c_dr_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {21476#true} #res := ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21476#true} {21476#true} #711#return; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {21520#(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; {21476#true} is VALID [2022-02-20 19:59:37,825 INFO L272 TraceCheckUtils]: 1: Hoare triple {21476#true} call #t~ret8 := is_do_write_p_triggered(); {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} havoc ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {21476#true} assume 1 == ~p_dw_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {21476#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {21476#true} #res := ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21476#true} {21476#true} #709#return; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {21476#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21476#true} is VALID [2022-02-20 19:59:37,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {21476#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L272 TraceCheckUtils]: 10: Hoare triple {21476#true} call #t~ret9 := is_do_read_c_triggered(); {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {21476#true} havoc ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {21476#true} assume 1 == ~c_dr_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {21476#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {21476#true} #res := ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,827 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21476#true} {21476#true} #711#return; {21476#true} is VALID [2022-02-20 19:59:37,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {21476#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21476#true} is VALID [2022-02-20 19:59:37,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {21476#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21476#true} is VALID [2022-02-20 19:59:37,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,829 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21476#true} {21477#false} #717#return; {21477#false} is VALID [2022-02-20 19:59:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {21518#(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); {21476#true} is VALID [2022-02-20 19:59:37,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {21476#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21476#true} is VALID [2022-02-20 19:59:37,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21476#true} {21477#false} #719#return; {21477#false} is VALID [2022-02-20 19:59:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {21476#true} havoc ~__retres1~2; {21476#true} is VALID [2022-02-20 19:59:37,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {21476#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21476#true} is VALID [2022-02-20 19:59:37,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} #res := ~__retres1~2; {21476#true} is VALID [2022-02-20 19:59:37,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,849 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21476#true} {21477#false} #721#return; {21477#false} is VALID [2022-02-20 19:59:37,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {21476#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {21476#true} is VALID [2022-02-20 19:59:37,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {21476#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {21476#true} is VALID [2022-02-20 19:59:37,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {21476#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {21478#(= ~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; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {21478#(= ~q_read_ev~0 2)} call update_channels1(); {21516#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:37,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {21516#(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); {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,852 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21517#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21478#(= ~q_read_ev~0 2)} #713#return; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {21478#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {21478#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {21478#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {21478#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {21478#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {21478#(= ~q_read_ev~0 2)} call fire_delta_events1(); {21518#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:37,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {21518#(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; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {21519#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {21519#(= |old(~q_read_ev~0)| 0)} assume true; {21519#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,856 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21519#(= |old(~q_read_ev~0)| 0)} {21478#(= ~q_read_ev~0 2)} #715#return; {21477#false} is VALID [2022-02-20 19:59:37,856 INFO L272 TraceCheckUtils]: 17: Hoare triple {21477#false} call activate_threads1(); {21520#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:37,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {21520#(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; {21476#true} is VALID [2022-02-20 19:59:37,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {21476#true} call #t~ret8 := is_do_write_p_triggered(); {21476#true} is VALID [2022-02-20 19:59:37,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {21476#true} havoc ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {21476#true} assume 1 == ~p_dw_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {21476#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {21476#true} is VALID [2022-02-20 19:59:37,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {21476#true} #res := ~__retres1~0; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21476#true} {21476#true} #709#return; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {21476#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {21476#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L272 TraceCheckUtils]: 28: Hoare triple {21476#true} call #t~ret9 := is_do_read_c_triggered(); {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {21476#true} havoc ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {21476#true} assume 1 == ~c_dr_pc~0; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {21476#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {21476#true} #res := ~__retres1~1; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21476#true} {21476#true} #711#return; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {21476#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {21476#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,858 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21476#true} {21477#false} #717#return; {21477#false} is VALID [2022-02-20 19:59:37,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {21477#false} call reset_delta_events1(); {21518#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:37,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {21518#(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); {21476#true} is VALID [2022-02-20 19:59:37,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {21476#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21476#true} is VALID [2022-02-20 19:59:37,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,859 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21476#true} {21477#false} #719#return; {21477#false} is VALID [2022-02-20 19:59:37,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {21477#false} assume !false; {21477#false} is VALID [2022-02-20 19:59:37,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {21477#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; {21477#false} is VALID [2022-02-20 19:59:37,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {21477#false} assume !false; {21477#false} is VALID [2022-02-20 19:59:37,860 INFO L272 TraceCheckUtils]: 47: Hoare triple {21477#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21476#true} is VALID [2022-02-20 19:59:37,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {21476#true} havoc ~__retres1~2; {21476#true} is VALID [2022-02-20 19:59:37,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {21476#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21476#true} is VALID [2022-02-20 19:59:37,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {21476#true} #res := ~__retres1~2; {21476#true} is VALID [2022-02-20 19:59:37,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {21476#true} assume true; {21476#true} is VALID [2022-02-20 19:59:37,860 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21476#true} {21477#false} #721#return; {21477#false} is VALID [2022-02-20 19:59:37,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {21477#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; {21477#false} is VALID [2022-02-20 19:59:37,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {21477#false} assume 0 != eval1_~tmp___1~0#1; {21477#false} is VALID [2022-02-20 19:59:37,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {21477#false} assume !(0 == ~p_dw_st~0); {21477#false} is VALID [2022-02-20 19:59:37,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {21477#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; {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {21477#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; {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {21477#false} assume !(0 == ~c_dr_pc~0); {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {21477#false} assume 2 == ~c_dr_pc~0; {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {21477#false} do_read_c_~a~0#1 := ~a_t~0; {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {21477#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; {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {21477#false} assume !(~p_last_write~0 == ~c_last_read~0); {21477#false} is VALID [2022-02-20 19:59:37,862 INFO L272 TraceCheckUtils]: 63: Hoare triple {21477#false} call error1(); {21477#false} is VALID [2022-02-20 19:59:37,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {21477#false} assume !false; {21477#false} is VALID [2022-02-20 19:59:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:37,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:37,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521693973] [2022-02-20 19:59:37,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521693973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:37,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:37,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:37,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641976887] [2022-02-20 19:59:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:37,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:37,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:37,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:37,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:37,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:37,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:37,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:37,905 INFO L87 Difference]: Start difference. First operand 1728 states and 2405 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,760 INFO L93 Difference]: Finished difference Result 1983 states and 2775 transitions. [2022-02-20 19:59:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 672 transitions. [2022-02-20 19:59:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 672 transitions. [2022-02-20 19:59:40,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 672 transitions. [2022-02-20 19:59:41,262 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 19:59:41,431 INFO L225 Difference]: With dead ends: 1983 [2022-02-20 19:59:41,431 INFO L226 Difference]: Without dead ends: 1879 [2022-02-20 19:59:41,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:41,434 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 758 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:41,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 938 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-02-20 19:59:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1840. [2022-02-20 19:59:42,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:42,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1879 states. Second operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-02-20 19:59:42,282 INFO L74 IsIncluded]: Start isIncluded. First operand 1879 states. Second operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-02-20 19:59:42,284 INFO L87 Difference]: Start difference. First operand 1879 states. Second operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-02-20 19:59:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,446 INFO L93 Difference]: Finished difference Result 1879 states and 2619 transitions. [2022-02-20 19:59:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2619 transitions. [2022-02-20 19:59:42,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) Second operand 1879 states. [2022-02-20 19:59:42,458 INFO L87 Difference]: Start difference. First operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) Second operand 1879 states. [2022-02-20 19:59:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,623 INFO L93 Difference]: Finished difference Result 1879 states and 2619 transitions. [2022-02-20 19:59:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2619 transitions. [2022-02-20 19:59:42,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:42,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-02-20 19:59:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2563 transitions. [2022-02-20 19:59:42,875 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2563 transitions. Word has length 65 [2022-02-20 19:59:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:42,876 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2563 transitions. [2022-02-20 19:59:42,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2563 transitions. [2022-02-20 19:59:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:42,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:42,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:42,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:42,878 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2022-02-20 19:59:42,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:42,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219131695] [2022-02-20 19:59:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {30543#(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); {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {30505#(= ~q_write_ev~0 ~q_read_ev~0)} #713#return; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {30544#(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); {30545#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {30545#(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; {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {30505#(= ~q_write_ev~0 ~q_read_ev~0)} #715#return; {30504#false} is VALID [2022-02-20 19:59:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {30503#true} havoc ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:42,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#true} assume 1 == ~p_dw_pc~0; {30503#true} is VALID [2022-02-20 19:59:42,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {30503#true} is VALID [2022-02-20 19:59:42,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#true} #res := ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:42,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,985 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30503#true} {30503#true} #709#return; {30503#true} is VALID [2022-02-20 19:59:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {30503#true} havoc ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:42,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#true} assume 1 == ~c_dr_pc~0; {30503#true} is VALID [2022-02-20 19:59:42,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30503#true} is VALID [2022-02-20 19:59:42,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#true} #res := ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:42,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,989 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30503#true} {30503#true} #711#return; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {30547#(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; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L272 TraceCheckUtils]: 1: Hoare triple {30503#true} call #t~ret8 := is_do_write_p_triggered(); {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} havoc ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#true} assume 1 == ~p_dw_pc~0; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {30503#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {30503#true} #res := ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:42,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30503#true} {30503#true} #709#return; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {30503#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {30503#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L272 TraceCheckUtils]: 10: Hoare triple {30503#true} call #t~ret9 := is_do_read_c_triggered(); {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {30503#true} havoc ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {30503#true} assume 1 == ~c_dr_pc~0; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {30503#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30503#true} is VALID [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {30503#true} #res := ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30503#true} {30503#true} #711#return; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {30503#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {30503#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,992 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30503#true} {30504#false} #717#return; {30504#false} is VALID [2022-02-20 19:59:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {30544#(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); {30503#true} is VALID [2022-02-20 19:59:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30503#true} is VALID [2022-02-20 19:59:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:42,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30503#true} {30504#false} #719#return; {30504#false} is VALID [2022-02-20 19:59:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {30503#true} havoc ~__retres1~2; {30503#true} is VALID [2022-02-20 19:59:43,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30503#true} is VALID [2022-02-20 19:59:43,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} #res := ~__retres1~2; {30503#true} is VALID [2022-02-20 19:59:43,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,002 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30503#true} {30504#false} #721#return; {30504#false} is VALID [2022-02-20 19:59:43,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {30503#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {30503#true} is VALID [2022-02-20 19:59:43,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {30503#true} is VALID [2022-02-20 19:59:43,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {30505#(= ~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; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {30543#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:43,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {30543#(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); {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:43,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:43,005 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {30505#(= ~q_write_ev~0 ~q_read_ev~0)} #713#return; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {30505#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {30505#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {30544#(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); {30545#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {30545#(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; {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:43,008 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30546#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {30505#(= ~q_write_ev~0 ~q_read_ev~0)} #715#return; {30504#false} is VALID [2022-02-20 19:59:43,008 INFO L272 TraceCheckUtils]: 17: Hoare triple {30504#false} call activate_threads1(); {30547#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {30547#(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; {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {30503#true} call #t~ret8 := is_do_write_p_triggered(); {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {30503#true} havoc ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {30503#true} assume 1 == ~p_dw_pc~0; {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {30503#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {30503#true} #res := ~__retres1~0; {30503#true} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30503#true} {30503#true} #709#return; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {30503#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {30503#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L272 TraceCheckUtils]: 28: Hoare triple {30503#true} call #t~ret9 := is_do_read_c_triggered(); {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {30503#true} havoc ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {30503#true} assume 1 == ~c_dr_pc~0; {30503#true} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {30503#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {30503#true} #res := ~__retres1~1; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30503#true} {30503#true} #711#return; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {30503#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {30503#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,011 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30503#true} {30504#false} #717#return; {30504#false} is VALID [2022-02-20 19:59:43,011 INFO L272 TraceCheckUtils]: 39: Hoare triple {30504#false} call reset_delta_events1(); {30544#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {30544#(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); {30503#true} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {30503#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30503#true} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,012 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30503#true} {30504#false} #719#return; {30504#false} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {30504#false} assume !false; {30504#false} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {30504#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; {30504#false} is VALID [2022-02-20 19:59:43,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {30504#false} assume !false; {30504#false} is VALID [2022-02-20 19:59:43,013 INFO L272 TraceCheckUtils]: 47: Hoare triple {30504#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30503#true} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {30503#true} havoc ~__retres1~2; {30503#true} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {30503#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30503#true} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {30503#true} #res := ~__retres1~2; {30503#true} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {30503#true} assume true; {30503#true} is VALID [2022-02-20 19:59:43,013 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30503#true} {30504#false} #721#return; {30504#false} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {30504#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; {30504#false} is VALID [2022-02-20 19:59:43,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {30504#false} assume 0 != eval1_~tmp___1~0#1; {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {30504#false} assume !(0 == ~p_dw_st~0); {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {30504#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; {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {30504#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; {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {30504#false} assume !(0 == ~c_dr_pc~0); {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {30504#false} assume 2 == ~c_dr_pc~0; {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {30504#false} do_read_c_~a~0#1 := ~a_t~0; {30504#false} is VALID [2022-02-20 19:59:43,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {30504#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; {30504#false} is VALID [2022-02-20 19:59:43,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {30504#false} assume !(~p_last_write~0 == ~c_last_read~0); {30504#false} is VALID [2022-02-20 19:59:43,015 INFO L272 TraceCheckUtils]: 63: Hoare triple {30504#false} call error1(); {30504#false} is VALID [2022-02-20 19:59:43,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {30504#false} assume !false; {30504#false} is VALID [2022-02-20 19:59:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:43,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:43,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219131695] [2022-02-20 19:59:43,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219131695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:43,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:43,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:43,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287370887] [2022-02-20 19:59:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:43,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:43,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:43,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:43,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:43,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:43,058 INFO L87 Difference]: Start difference. First operand 1840 states and 2563 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,506 INFO L93 Difference]: Finished difference Result 2237 states and 3129 transitions. [2022-02-20 19:59:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 702 transitions. [2022-02-20 19:59:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 702 transitions. [2022-02-20 19:59:46,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 702 transitions. [2022-02-20 19:59:47,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:47,245 INFO L225 Difference]: With dead ends: 2237 [2022-02-20 19:59:47,245 INFO L226 Difference]: Without dead ends: 2028 [2022-02-20 19:59:47,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:47,246 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 583 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:47,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 1417 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-02-20 19:59:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1952. [2022-02-20 19:59:48,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:48,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2028 states. Second operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-02-20 19:59:48,268 INFO L74 IsIncluded]: Start isIncluded. First operand 2028 states. Second operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-02-20 19:59:48,271 INFO L87 Difference]: Start difference. First operand 2028 states. Second operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-02-20 19:59:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,396 INFO L93 Difference]: Finished difference Result 2028 states and 2837 transitions. [2022-02-20 19:59:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2837 transitions. [2022-02-20 19:59:48,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) Second operand 2028 states. [2022-02-20 19:59:48,409 INFO L87 Difference]: Start difference. First operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) Second operand 2028 states. [2022-02-20 19:59:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,584 INFO L93 Difference]: Finished difference Result 2028 states and 2837 transitions. [2022-02-20 19:59:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2837 transitions. [2022-02-20 19:59:48,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:48,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-02-20 19:59:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2723 transitions. [2022-02-20 19:59:48,822 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2723 transitions. Word has length 65 [2022-02-20 19:59:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:48,822 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2723 transitions. [2022-02-20 19:59:48,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2723 transitions. [2022-02-20 19:59:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:48,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:48,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:48,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:48,825 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2022-02-20 19:59:48,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:48,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023004531] [2022-02-20 19:59:48,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:48,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {40362#(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); {40322#true} is VALID [2022-02-20 19:59:48,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40322#true} {40324#(= ~p_dw_pc~0 0)} #713#return; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {40363#(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); {40322#true} is VALID [2022-02-20 19:59:48,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume !(0 == ~q_write_ev~0); {40322#true} is VALID [2022-02-20 19:59:48,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40322#true} {40324#(= ~p_dw_pc~0 0)} #715#return; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {40322#true} havoc ~__retres1~0; {40322#true} is VALID [2022-02-20 19:59:48,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume 1 == ~p_dw_pc~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} #res := ~__retres1~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume true; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,924 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40371#(<= 1 ~p_dw_pc~0)} {40322#true} #709#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {40322#true} havoc ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume 1 == ~c_dr_pc~0; {40322#true} is VALID [2022-02-20 19:59:48,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {40322#true} is VALID [2022-02-20 19:59:48,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {40322#true} #res := ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,932 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40322#true} {40371#(<= 1 ~p_dw_pc~0)} #711#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {40364#(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; {40322#true} is VALID [2022-02-20 19:59:48,933 INFO L272 TraceCheckUtils]: 1: Hoare triple {40322#true} call #t~ret8 := is_do_write_p_triggered(); {40322#true} is VALID [2022-02-20 19:59:48,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} havoc ~__retres1~0; {40322#true} is VALID [2022-02-20 19:59:48,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {40322#true} assume 1 == ~p_dw_pc~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} #res := ~__retres1~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume true; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,948 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40371#(<= 1 ~p_dw_pc~0)} {40322#true} #709#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,949 INFO L272 TraceCheckUtils]: 10: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} call #t~ret9 := is_do_read_c_triggered(); {40322#true} is VALID [2022-02-20 19:59:48,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {40322#true} havoc ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {40322#true} assume 1 == ~c_dr_pc~0; {40322#true} is VALID [2022-02-20 19:59:48,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {40322#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {40322#true} is VALID [2022-02-20 19:59:48,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {40322#true} #res := ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,950 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40322#true} {40371#(<= 1 ~p_dw_pc~0)} #711#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume true; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,952 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40371#(<= 1 ~p_dw_pc~0)} {40324#(= ~p_dw_pc~0 0)} #717#return; {40323#false} is VALID [2022-02-20 19:59:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {40363#(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); {40322#true} is VALID [2022-02-20 19:59:48,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40322#true} is VALID [2022-02-20 19:59:48,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40322#true} {40323#false} #719#return; {40323#false} is VALID [2022-02-20 19:59:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {40322#true} havoc ~__retres1~2; {40322#true} is VALID [2022-02-20 19:59:48,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40322#true} is VALID [2022-02-20 19:59:48,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} #res := ~__retres1~2; {40322#true} is VALID [2022-02-20 19:59:48,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,960 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40322#true} {40323#false} #721#return; {40323#false} is VALID [2022-02-20 19:59:48,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {40322#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {40322#true} is VALID [2022-02-20 19:59:48,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {40322#true} is VALID [2022-02-20 19:59:48,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {40322#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {40324#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#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; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {40324#(= ~p_dw_pc~0 0)} call update_channels1(); {40362#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:48,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {40362#(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); {40322#true} is VALID [2022-02-20 19:59:48,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,963 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40322#true} {40324#(= ~p_dw_pc~0 0)} #713#return; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {40324#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {40324#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {40324#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {40324#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,964 INFO L272 TraceCheckUtils]: 12: Hoare triple {40324#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {40363#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:48,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {40363#(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); {40322#true} is VALID [2022-02-20 19:59:48,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {40322#true} assume !(0 == ~q_write_ev~0); {40322#true} is VALID [2022-02-20 19:59:48,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,965 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40322#true} {40324#(= ~p_dw_pc~0 0)} #715#return; {40324#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:48,966 INFO L272 TraceCheckUtils]: 17: Hoare triple {40324#(= ~p_dw_pc~0 0)} call activate_threads1(); {40364#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:48,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {40364#(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; {40322#true} is VALID [2022-02-20 19:59:48,966 INFO L272 TraceCheckUtils]: 19: Hoare triple {40322#true} call #t~ret8 := is_do_write_p_triggered(); {40322#true} is VALID [2022-02-20 19:59:48,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {40322#true} havoc ~__retres1~0; {40322#true} is VALID [2022-02-20 19:59:48,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {40322#true} assume 1 == ~p_dw_pc~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} #res := ~__retres1~0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume true; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,968 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40371#(<= 1 ~p_dw_pc~0)} {40322#true} #709#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,969 INFO L272 TraceCheckUtils]: 28: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} call #t~ret9 := is_do_read_c_triggered(); {40322#true} is VALID [2022-02-20 19:59:48,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {40322#true} havoc ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {40322#true} assume 1 == ~c_dr_pc~0; {40322#true} is VALID [2022-02-20 19:59:48,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {40322#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {40322#true} is VALID [2022-02-20 19:59:48,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {40322#true} #res := ~__retres1~1; {40322#true} is VALID [2022-02-20 19:59:48,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,970 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {40322#true} {40371#(<= 1 ~p_dw_pc~0)} #711#return; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {40371#(<= 1 ~p_dw_pc~0)} assume true; {40371#(<= 1 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:48,971 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40371#(<= 1 ~p_dw_pc~0)} {40324#(= ~p_dw_pc~0 0)} #717#return; {40323#false} is VALID [2022-02-20 19:59:48,972 INFO L272 TraceCheckUtils]: 39: Hoare triple {40323#false} call reset_delta_events1(); {40363#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:48,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {40363#(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); {40322#true} is VALID [2022-02-20 19:59:48,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {40322#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40322#true} is VALID [2022-02-20 19:59:48,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,972 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40322#true} {40323#false} #719#return; {40323#false} is VALID [2022-02-20 19:59:48,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {40323#false} assume !false; {40323#false} is VALID [2022-02-20 19:59:48,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {40323#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; {40323#false} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {40323#false} assume !false; {40323#false} is VALID [2022-02-20 19:59:48,973 INFO L272 TraceCheckUtils]: 47: Hoare triple {40323#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40322#true} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {40322#true} havoc ~__retres1~2; {40322#true} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {40322#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40322#true} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {40322#true} #res := ~__retres1~2; {40322#true} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {40322#true} assume true; {40322#true} is VALID [2022-02-20 19:59:48,973 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40322#true} {40323#false} #721#return; {40323#false} is VALID [2022-02-20 19:59:48,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {40323#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; {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {40323#false} assume 0 != eval1_~tmp___1~0#1; {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {40323#false} assume !(0 == ~p_dw_st~0); {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {40323#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; {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {40323#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; {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {40323#false} assume !(0 == ~c_dr_pc~0); {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {40323#false} assume 2 == ~c_dr_pc~0; {40323#false} is VALID [2022-02-20 19:59:48,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {40323#false} do_read_c_~a~0#1 := ~a_t~0; {40323#false} is VALID [2022-02-20 19:59:48,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {40323#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; {40323#false} is VALID [2022-02-20 19:59:48,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {40323#false} assume !(~p_last_write~0 == ~c_last_read~0); {40323#false} is VALID [2022-02-20 19:59:48,975 INFO L272 TraceCheckUtils]: 63: Hoare triple {40323#false} call error1(); {40323#false} is VALID [2022-02-20 19:59:48,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {40323#false} assume !false; {40323#false} is VALID [2022-02-20 19:59:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:48,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:48,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023004531] [2022-02-20 19:59:48,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023004531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:48,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:48,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:48,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948135023] [2022-02-20 19:59:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:59:48,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:48,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:49,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:49,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:49,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:49,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:49,020 INFO L87 Difference]: Start difference. First operand 1952 states and 2723 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,761 INFO L93 Difference]: Finished difference Result 2624 states and 3665 transitions. [2022-02-20 19:59:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:51,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:59:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 631 transitions. [2022-02-20 19:59:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 631 transitions. [2022-02-20 19:59:51,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 631 transitions. [2022-02-20 19:59:52,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:52,431 INFO L225 Difference]: With dead ends: 2624 [2022-02-20 19:59:52,432 INFO L226 Difference]: Without dead ends: 2309 [2022-02-20 19:59:52,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:59:52,433 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 682 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:52,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 1087 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2022-02-20 19:59:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2233. [2022-02-20 19:59:53,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:53,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2309 states. Second operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-02-20 19:59:53,431 INFO L74 IsIncluded]: Start isIncluded. First operand 2309 states. Second operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-02-20 19:59:53,433 INFO L87 Difference]: Start difference. First operand 2309 states. Second operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-02-20 19:59:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,668 INFO L93 Difference]: Finished difference Result 2309 states and 3202 transitions. [2022-02-20 19:59:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3202 transitions. [2022-02-20 19:59:53,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) Second operand 2309 states. [2022-02-20 19:59:53,679 INFO L87 Difference]: Start difference. First operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) Second operand 2309 states. [2022-02-20 19:59:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,898 INFO L93 Difference]: Finished difference Result 2309 states and 3202 transitions. [2022-02-20 19:59:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3202 transitions. [2022-02-20 19:59:53,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:53,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-02-20 19:59:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3098 transitions. [2022-02-20 19:59:54,187 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3098 transitions. Word has length 65 [2022-02-20 19:59:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:54,188 INFO L470 AbstractCegarLoop]: Abstraction has 2233 states and 3098 transitions. [2022-02-20 19:59:54,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3098 transitions. [2022-02-20 19:59:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:54,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:54,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:54,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:54,192 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2022-02-20 19:59:54,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:54,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67758385] [2022-02-20 19:59:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {51630#(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); {51590#true} is VALID [2022-02-20 19:59:54,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51590#true} {51590#true} #713#return; {51590#true} is VALID [2022-02-20 19:59:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {51631#(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); {51590#true} is VALID [2022-02-20 19:59:54,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume !(0 == ~q_write_ev~0); {51590#true} is VALID [2022-02-20 19:59:54,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51590#true} {51590#true} #715#return; {51590#true} is VALID [2022-02-20 19:59:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {51590#true} havoc ~__retres1~0; {51590#true} is VALID [2022-02-20 19:59:54,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume !(1 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} assume !(2 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {51590#true} ~__retres1~0 := 0; {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {51590#true} #709#return; {51640#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {51590#true} havoc ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume 1 == ~c_dr_pc~0; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {51590#true} #res := ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {51590#true} {51591#false} #711#return; {51591#false} is VALID [2022-02-20 19:59:54,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {51632#(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; {51590#true} is VALID [2022-02-20 19:59:54,312 INFO L272 TraceCheckUtils]: 1: Hoare triple {51590#true} call #t~ret8 := is_do_write_p_triggered(); {51590#true} is VALID [2022-02-20 19:59:54,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} havoc ~__retres1~0; {51590#true} is VALID [2022-02-20 19:59:54,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {51590#true} assume !(1 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {51590#true} assume !(2 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {51590#true} ~__retres1~0 := 0; {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,315 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {51590#true} #709#return; {51640#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {51640#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {51641#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:54,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {51641#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {51591#false} is VALID [2022-02-20 19:59:54,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {51591#false} call #t~ret9 := is_do_read_c_triggered(); {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {51590#true} havoc ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {51590#true} assume 1 == ~c_dr_pc~0; {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {51590#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {51590#true} #res := ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,316 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {51590#true} {51591#false} #711#return; {51591#false} is VALID [2022-02-20 19:59:54,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {51591#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {51591#false} is VALID [2022-02-20 19:59:54,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {51591#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {51591#false} is VALID [2022-02-20 19:59:54,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {51591#false} assume true; {51591#false} is VALID [2022-02-20 19:59:54,317 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {51591#false} {51590#true} #717#return; {51591#false} is VALID [2022-02-20 19:59:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {51631#(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); {51590#true} is VALID [2022-02-20 19:59:54,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {51590#true} is VALID [2022-02-20 19:59:54,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51590#true} {51591#false} #719#return; {51591#false} is VALID [2022-02-20 19:59:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {51590#true} havoc ~__retres1~2; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} #res := ~__retres1~2; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {51590#true} {51591#false} #721#return; {51591#false} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {51590#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {51590#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {51590#true} is VALID [2022-02-20 19:59:54,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {51590#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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; {51590#true} is VALID [2022-02-20 19:59:54,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {51590#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; {51590#true} is VALID [2022-02-20 19:59:54,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {51590#true} call update_channels1(); {51630#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:54,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {51630#(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); {51590#true} is VALID [2022-02-20 19:59:54,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {51590#true} {51590#true} #713#return; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {51590#true} assume { :begin_inline_init_threads1 } true; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {51590#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {51590#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {51590#true} assume { :end_inline_init_threads1 } true; {51590#true} is VALID [2022-02-20 19:59:54,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {51590#true} call fire_delta_events1(); {51631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:54,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {51631#(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); {51590#true} is VALID [2022-02-20 19:59:54,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {51590#true} assume !(0 == ~q_write_ev~0); {51590#true} is VALID [2022-02-20 19:59:54,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {51590#true} {51590#true} #715#return; {51590#true} is VALID [2022-02-20 19:59:54,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {51590#true} call activate_threads1(); {51632#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:54,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {51632#(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; {51590#true} is VALID [2022-02-20 19:59:54,333 INFO L272 TraceCheckUtils]: 19: Hoare triple {51590#true} call #t~ret8 := is_do_write_p_triggered(); {51590#true} is VALID [2022-02-20 19:59:54,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {51590#true} havoc ~__retres1~0; {51590#true} is VALID [2022-02-20 19:59:54,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {51590#true} assume !(1 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {51590#true} assume !(2 == ~p_dw_pc~0); {51590#true} is VALID [2022-02-20 19:59:54,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {51590#true} ~__retres1~0 := 0; {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {51648#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,335 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {51649#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {51590#true} #709#return; {51640#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {51640#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {51641#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {51641#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {51591#false} is VALID [2022-02-20 19:59:54,336 INFO L272 TraceCheckUtils]: 29: Hoare triple {51591#false} call #t~ret9 := is_do_read_c_triggered(); {51590#true} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {51590#true} havoc ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {51590#true} assume 1 == ~c_dr_pc~0; {51590#true} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {51590#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {51590#true} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {51590#true} #res := ~__retres1~1; {51590#true} is VALID [2022-02-20 19:59:54,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,337 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {51590#true} {51591#false} #711#return; {51591#false} is VALID [2022-02-20 19:59:54,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {51591#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {51591#false} is VALID [2022-02-20 19:59:54,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {51591#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {51591#false} is VALID [2022-02-20 19:59:54,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {51591#false} assume true; {51591#false} is VALID [2022-02-20 19:59:54,337 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51591#false} {51590#true} #717#return; {51591#false} is VALID [2022-02-20 19:59:54,337 INFO L272 TraceCheckUtils]: 40: Hoare triple {51591#false} call reset_delta_events1(); {51631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:54,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {51631#(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); {51590#true} is VALID [2022-02-20 19:59:54,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {51590#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {51590#true} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,338 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {51590#true} {51591#false} #719#return; {51591#false} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {51591#false} assume !false; {51591#false} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {51591#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; {51591#false} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {51591#false} assume !false; {51591#false} is VALID [2022-02-20 19:59:54,338 INFO L272 TraceCheckUtils]: 48: Hoare triple {51591#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {51590#true} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {51590#true} havoc ~__retres1~2; {51590#true} is VALID [2022-02-20 19:59:54,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {51590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {51590#true} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {51590#true} #res := ~__retres1~2; {51590#true} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {51590#true} assume true; {51590#true} is VALID [2022-02-20 19:59:54,339 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {51590#true} {51591#false} #721#return; {51591#false} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {51591#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; {51591#false} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {51591#false} assume 0 != eval1_~tmp___1~0#1; {51591#false} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {51591#false} assume !(0 == ~p_dw_st~0); {51591#false} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {51591#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; {51591#false} is VALID [2022-02-20 19:59:54,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {51591#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; {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {51591#false} assume !(0 == ~c_dr_pc~0); {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {51591#false} assume 2 == ~c_dr_pc~0; {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {51591#false} do_read_c_~a~0#1 := ~a_t~0; {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {51591#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; {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {51591#false} assume !(~p_last_write~0 == ~c_last_read~0); {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L272 TraceCheckUtils]: 64: Hoare triple {51591#false} call error1(); {51591#false} is VALID [2022-02-20 19:59:54,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {51591#false} assume !false; {51591#false} is VALID [2022-02-20 19:59:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:54,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:54,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67758385] [2022-02-20 19:59:54,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67758385] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:54,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:54,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:54,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064532309] [2022-02-20 19:59:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:54,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:54,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:54,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:54,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:54,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:54,382 INFO L87 Difference]: Start difference. First operand 2233 states and 3098 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:57,566 INFO L93 Difference]: Finished difference Result 2907 states and 4034 transitions. [2022-02-20 19:59:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 486 transitions. [2022-02-20 19:59:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 486 transitions. [2022-02-20 19:59:57,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 486 transitions. [2022-02-20 19:59:57,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:58,103 INFO L225 Difference]: With dead ends: 2907 [2022-02-20 19:59:58,103 INFO L226 Difference]: Without dead ends: 2311 [2022-02-20 19:59:58,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:58,105 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 332 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:58,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1198 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-02-20 19:59:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2248. [2022-02-20 19:59:59,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:59,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2311 states. Second operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-02-20 19:59:59,159 INFO L74 IsIncluded]: Start isIncluded. First operand 2311 states. Second operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-02-20 19:59:59,162 INFO L87 Difference]: Start difference. First operand 2311 states. Second operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-02-20 19:59:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,376 INFO L93 Difference]: Finished difference Result 2311 states and 3199 transitions. [2022-02-20 19:59:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3199 transitions. [2022-02-20 19:59:59,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) Second operand 2311 states. [2022-02-20 19:59:59,388 INFO L87 Difference]: Start difference. First operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) Second operand 2311 states. [2022-02-20 19:59:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,605 INFO L93 Difference]: Finished difference Result 2311 states and 3199 transitions. [2022-02-20 19:59:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3199 transitions. [2022-02-20 19:59:59,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:59,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-02-20 19:59:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3110 transitions. [2022-02-20 19:59:59,914 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3110 transitions. Word has length 66 [2022-02-20 19:59:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:59,915 INFO L470 AbstractCegarLoop]: Abstraction has 2248 states and 3110 transitions. [2022-02-20 19:59:59,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3110 transitions. [2022-02-20 19:59:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:59,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:59,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:59,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:59:59,922 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2022-02-20 19:59:59,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:59,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174739436] [2022-02-20 19:59:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {63291#(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); {63250#true} is VALID [2022-02-20 19:59:59,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 19:59:59,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63250#true} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #713#return; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {63292#(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); {63250#true} is VALID [2022-02-20 19:59:59,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume !(0 == ~q_write_ev~0); {63250#true} is VALID [2022-02-20 19:59:59,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 19:59:59,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63250#true} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #715#return; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {63250#true} havoc ~__retres1~0; {63250#true} is VALID [2022-02-20 20:00:00,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume !(1 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(2 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,041 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {63250#true} #709#return; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {63250#true} havoc ~__retres1~1; {63250#true} is VALID [2022-02-20 20:00:00,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume 1 == ~c_dr_pc~0; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,062 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #711#return; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {63293#(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; {63250#true} is VALID [2022-02-20 20:00:00,062 INFO L272 TraceCheckUtils]: 1: Hoare triple {63250#true} call #t~ret8 := is_do_write_p_triggered(); {63250#true} is VALID [2022-02-20 20:00:00,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {63250#true} havoc ~__retres1~0; {63250#true} is VALID [2022-02-20 20:00:00,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {63250#true} assume !(1 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(2 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,064 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {63250#true} #709#return; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {63250#true} is VALID [2022-02-20 20:00:00,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {63250#true} havoc ~__retres1~1; {63250#true} is VALID [2022-02-20 20:00:00,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {63250#true} assume 1 == ~c_dr_pc~0; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,067 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #711#return; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,069 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #717#return; {63251#false} is VALID [2022-02-20 20:00:00,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {63292#(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); {63250#true} is VALID [2022-02-20 20:00:00,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {63250#true} is VALID [2022-02-20 20:00:00,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63250#true} {63251#false} #719#return; {63251#false} is VALID [2022-02-20 20:00:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {63250#true} havoc ~__retres1~2; {63250#true} is VALID [2022-02-20 20:00:00,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {63250#true} is VALID [2022-02-20 20:00:00,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {63250#true} #res := ~__retres1~2; {63250#true} is VALID [2022-02-20 20:00:00,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,097 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63250#true} {63251#false} #721#return; {63251#false} is VALID [2022-02-20 20:00:00,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {63250#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {63250#true} is VALID [2022-02-20 20:00:00,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {63250#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {63250#true} is VALID [2022-02-20 20:00:00,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {63250#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {63252#(= ~c_dr_pc~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; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {63291#(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,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {63291#(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); {63250#true} is VALID [2022-02-20 20:00:00,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,100 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63250#true} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #713#return; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,102 INFO L272 TraceCheckUtils]: 12: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {63292#(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,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {63292#(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); {63250#true} is VALID [2022-02-20 20:00:00,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {63250#true} assume !(0 == ~q_write_ev~0); {63250#true} is VALID [2022-02-20 20:00:00,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,103 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63250#true} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #715#return; {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:00,103 INFO L272 TraceCheckUtils]: 17: Hoare triple {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {63293#(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,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {63293#(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; {63250#true} is VALID [2022-02-20 20:00:00,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {63250#true} call #t~ret8 := is_do_write_p_triggered(); {63250#true} is VALID [2022-02-20 20:00:00,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {63250#true} havoc ~__retres1~0; {63250#true} is VALID [2022-02-20 20:00:00,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {63250#true} assume !(1 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(2 == ~p_dw_pc~0); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,106 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {63250#true} #709#return; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 20:00:00,107 INFO L272 TraceCheckUtils]: 29: Hoare triple {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {63250#true} is VALID [2022-02-20 20:00:00,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {63250#true} havoc ~__retres1~1; {63250#true} is VALID [2022-02-20 20:00:00,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {63250#true} assume 1 == ~c_dr_pc~0; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,109 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {63309#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {63301#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #711#return; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 20:00:00,111 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {63308#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {63252#(= ~c_dr_pc~0 ~p_dw_pc~0)} #717#return; {63251#false} is VALID [2022-02-20 20:00:00,111 INFO L272 TraceCheckUtils]: 40: Hoare triple {63251#false} call reset_delta_events1(); {63292#(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,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {63292#(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); {63250#true} is VALID [2022-02-20 20:00:00,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {63250#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {63250#true} is VALID [2022-02-20 20:00:00,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,112 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {63250#true} {63251#false} #719#return; {63251#false} is VALID [2022-02-20 20:00:00,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {63251#false} assume !false; {63251#false} is VALID [2022-02-20 20:00:00,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {63251#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; {63251#false} is VALID [2022-02-20 20:00:00,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {63251#false} assume !false; {63251#false} is VALID [2022-02-20 20:00:00,113 INFO L272 TraceCheckUtils]: 48: Hoare triple {63251#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {63250#true} is VALID [2022-02-20 20:00:00,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {63250#true} havoc ~__retres1~2; {63250#true} is VALID [2022-02-20 20:00:00,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {63250#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {63250#true} is VALID [2022-02-20 20:00:00,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {63250#true} #res := ~__retres1~2; {63250#true} is VALID [2022-02-20 20:00:00,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {63250#true} assume true; {63250#true} is VALID [2022-02-20 20:00:00,113 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {63250#true} {63251#false} #721#return; {63251#false} is VALID [2022-02-20 20:00:00,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {63251#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; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {63251#false} assume 0 != eval1_~tmp___1~0#1; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {63251#false} assume !(0 == ~p_dw_st~0); {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {63251#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; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {63251#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; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {63251#false} assume !(0 == ~c_dr_pc~0); {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {63251#false} assume 2 == ~c_dr_pc~0; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {63251#false} do_read_c_~a~0#1 := ~a_t~0; {63251#false} is VALID [2022-02-20 20:00:00,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {63251#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; {63251#false} is VALID [2022-02-20 20:00:00,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {63251#false} assume !(~p_last_write~0 == ~c_last_read~0); {63251#false} is VALID [2022-02-20 20:00:00,115 INFO L272 TraceCheckUtils]: 64: Hoare triple {63251#false} call error1(); {63251#false} is VALID [2022-02-20 20:00:00,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {63251#false} assume !false; {63251#false} is VALID [2022-02-20 20:00:00,115 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,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:00,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174739436] [2022-02-20 20:00:00,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174739436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:00,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:00,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:00,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486387636] [2022-02-20 20:00:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:00,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:00,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:00,159 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:00,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:00,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:00,161 INFO L87 Difference]: Start difference. First operand 2248 states and 3110 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,282 INFO L93 Difference]: Finished difference Result 4453 states and 6231 transitions. [2022-02-20 20:00:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1241 transitions. [2022-02-20 20:00:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1241 transitions. [2022-02-20 20:00:08,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1241 transitions.