./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.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.02.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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:22,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:22,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:22,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:22,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:22,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:22,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:22,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:22,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:22,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:22,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:22,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:22,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:22,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:22,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:22,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:22,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:22,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:22,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:22,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:22,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:22,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:22,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:22,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:22,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:22,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:22,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:22,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:22,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:22,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:22,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:22,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:22,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:22,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:22,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:22,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:22,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:22,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:22,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:22,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:22,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:22,261 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:22,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:22,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:22,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:22,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:22,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:22,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:22,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:22,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:22,287 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:22,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:22,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:22,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:22,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:22,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:22,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:22,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:22,291 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2022-02-20 19:59:22,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:22,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:22,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:22,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:22,516 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:22,517 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.02.cil-1.c [2022-02-20 19:59:22,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6479ca67e/ebedc036860f4bbb9426227177835833/FLAG37f6a438c [2022-02-20 19:59:22,941 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:22,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-02-20 19:59:22,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6479ca67e/ebedc036860f4bbb9426227177835833/FLAG37f6a438c [2022-02-20 19:59:23,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6479ca67e/ebedc036860f4bbb9426227177835833 [2022-02-20 19:59:23,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:23,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:23,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:23,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:23,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:23,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:23" (1/1) ... [2022-02-20 19:59:23,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553461e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:23, skipping insertion in model container [2022-02-20 19:59:23,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:23" (1/1) ... [2022-02-20 19:59:23,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:23,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:23,512 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.02.cil-1.c[911,924] [2022-02-20 19:59:23,552 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.02.cil-1.c[8416,8429] [2022-02-20 19:59:23,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:23,587 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:23,595 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.02.cil-1.c[911,924] [2022-02-20 19:59:23,613 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.02.cil-1.c[8416,8429] [2022-02-20 19:59:23,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:23,643 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:23,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:23 WrapperNode [2022-02-20 19:59:23,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:23,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:23,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:23,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:23,649 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:23" (1/1) ... [2022-02-20 19:59:23,657 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:23" (1/1) ... [2022-02-20 19:59:23,684 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2022-02-20 19:59:23,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:23,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:23,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:23,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:23,691 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:23" (1/1) ... [2022-02-20 19:59:23,694 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:23" (1/1) ... [2022-02-20 19:59:23,697 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:23" (1/1) ... [2022-02-20 19:59:23,698 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:23" (1/1) ... [2022-02-20 19:59:23,705 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:23" (1/1) ... [2022-02-20 19:59:23,711 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:23" (1/1) ... [2022-02-20 19:59:23,713 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:23" (1/1) ... [2022-02-20 19:59:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:23,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:23,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:23,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:23,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:23" (1/1) ... [2022-02-20 19:59:23,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:23,743 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:23,750 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:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:23,778 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:23,780 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:23,780 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:23,780 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:23,780 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:23,872 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:23,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:24,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:24,220 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:24,247 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:24,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:24,254 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:59:24,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:24 BoogieIcfgContainer [2022-02-20 19:59:24,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:24,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:24,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:24,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:24,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:23" (1/3) ... [2022-02-20 19:59:24,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb83363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:24, skipping insertion in model container [2022-02-20 19:59:24,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:23" (2/3) ... [2022-02-20 19:59:24,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb83363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:24, skipping insertion in model container [2022-02-20 19:59:24,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:24" (3/3) ... [2022-02-20 19:59:24,262 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-02-20 19:59:24,265 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:24,266 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:24,302 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:24,306 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:24,307 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 200 states have (on average 1.555) internal successors, (311), 206 states have internal predecessors, (311), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 19:59:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:24,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:24,337 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:24,337 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1783891232, now seen corresponding path program 1 times [2022-02-20 19:59:24,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:24,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559515037] [2022-02-20 19:59:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#(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); {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:24,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:24,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {254#(= ~q_read_ev~0 2)} #825#return; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(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; {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#(= |old(~q_read_ev~0)| 0)} assume true; {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#(= |old(~q_read_ev~0)| 0)} {254#(= ~q_read_ev~0 2)} #827#return; {253#false} is VALID [2022-02-20 19:59:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#true} havoc ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} assume 1 == ~p_dw_pc~0; {252#true} is VALID [2022-02-20 19:59:24,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {252#true} is VALID [2022-02-20 19:59:24,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#true} #res := ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,625 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {252#true} {252#true} #821#return; {252#true} is VALID [2022-02-20 19:59:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#true} havoc ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} assume 1 == ~c_dr_pc~0; {252#true} is VALID [2022-02-20 19:59:24,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {252#true} is VALID [2022-02-20 19:59:24,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#true} #res := ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,629 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {252#true} {252#true} #823#return; {252#true} is VALID [2022-02-20 19:59:24,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#(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; {252#true} is VALID [2022-02-20 19:59:24,630 INFO L272 TraceCheckUtils]: 1: Hoare triple {252#true} call #t~ret8 := is_do_write_p_triggered(); {252#true} is VALID [2022-02-20 19:59:24,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} havoc ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#true} assume 1 == ~p_dw_pc~0; {252#true} is VALID [2022-02-20 19:59:24,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {252#true} is VALID [2022-02-20 19:59:24,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#true} #res := ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,632 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {252#true} {252#true} #821#return; {252#true} is VALID [2022-02-20 19:59:24,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {252#true} is VALID [2022-02-20 19:59:24,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {252#true} is VALID [2022-02-20 19:59:24,633 INFO L272 TraceCheckUtils]: 10: Hoare triple {252#true} call #t~ret9 := is_do_read_c_triggered(); {252#true} is VALID [2022-02-20 19:59:24,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#true} havoc ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#true} assume 1 == ~c_dr_pc~0; {252#true} is VALID [2022-02-20 19:59:24,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {252#true} is VALID [2022-02-20 19:59:24,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {252#true} #res := ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {252#true} {252#true} #823#return; {252#true} is VALID [2022-02-20 19:59:24,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {252#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {252#true} is VALID [2022-02-20 19:59:24,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {252#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {252#true} is VALID [2022-02-20 19:59:24,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,636 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {252#true} {253#false} #829#return; {253#false} is VALID [2022-02-20 19:59:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {252#true} is VALID [2022-02-20 19:59:24,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {252#true} is VALID [2022-02-20 19:59:24,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {252#true} {253#false} #831#return; {253#false} is VALID [2022-02-20 19:59:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#true} havoc ~__retres1~2; {252#true} is VALID [2022-02-20 19:59:24,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {252#true} is VALID [2022-02-20 19:59:24,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} #res := ~__retres1~2; {252#true} is VALID [2022-02-20 19:59:24,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,656 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {252#true} {253#false} #833#return; {253#false} is VALID [2022-02-20 19:59:24,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {252#true} is VALID [2022-02-20 19:59:24,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {252#true} is VALID [2022-02-20 19:59:24,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#(= ~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; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#(= ~q_read_ev~0 2)} call update_channels1(); {292#(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:24,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(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); {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:24,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:24,661 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {293#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {254#(= ~q_read_ev~0 2)} #825#return; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {254#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {254#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:24,664 INFO L272 TraceCheckUtils]: 12: Hoare triple {254#(= ~q_read_ev~0 2)} call fire_delta_events1(); {294#(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:24,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(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; {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#(= |old(~q_read_ev~0)| 0)} assume true; {295#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:24,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#(= |old(~q_read_ev~0)| 0)} {254#(= ~q_read_ev~0 2)} #827#return; {253#false} is VALID [2022-02-20 19:59:24,666 INFO L272 TraceCheckUtils]: 17: Hoare triple {253#false} call activate_threads1(); {296#(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:24,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {296#(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; {252#true} is VALID [2022-02-20 19:59:24,666 INFO L272 TraceCheckUtils]: 19: Hoare triple {252#true} call #t~ret8 := is_do_write_p_triggered(); {252#true} is VALID [2022-02-20 19:59:24,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {252#true} havoc ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {252#true} assume 1 == ~p_dw_pc~0; {252#true} is VALID [2022-02-20 19:59:24,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {252#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {252#true} is VALID [2022-02-20 19:59:24,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {252#true} #res := ~__retres1~0; {252#true} is VALID [2022-02-20 19:59:24,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,668 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {252#true} {252#true} #821#return; {252#true} is VALID [2022-02-20 19:59:24,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {252#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {252#true} is VALID [2022-02-20 19:59:24,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {252#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {252#true} is VALID [2022-02-20 19:59:24,668 INFO L272 TraceCheckUtils]: 28: Hoare triple {252#true} call #t~ret9 := is_do_read_c_triggered(); {252#true} is VALID [2022-02-20 19:59:24,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {252#true} havoc ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {252#true} assume 1 == ~c_dr_pc~0; {252#true} is VALID [2022-02-20 19:59:24,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {252#true} is VALID [2022-02-20 19:59:24,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {252#true} #res := ~__retres1~1; {252#true} is VALID [2022-02-20 19:59:24,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,669 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {252#true} {252#true} #823#return; {252#true} is VALID [2022-02-20 19:59:24,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {252#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {252#true} is VALID [2022-02-20 19:59:24,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {252#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {252#true} is VALID [2022-02-20 19:59:24,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,670 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {252#true} {253#false} #829#return; {253#false} is VALID [2022-02-20 19:59:24,670 INFO L272 TraceCheckUtils]: 39: Hoare triple {253#false} call reset_delta_events1(); {294#(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:24,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {294#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {252#true} is VALID [2022-02-20 19:59:24,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {252#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {252#true} is VALID [2022-02-20 19:59:24,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,671 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {252#true} {253#false} #831#return; {253#false} is VALID [2022-02-20 19:59:24,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {253#false} assume !false; {253#false} is VALID [2022-02-20 19:59:24,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {253#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; {253#false} is VALID [2022-02-20 19:59:24,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {253#false} assume !false; {253#false} is VALID [2022-02-20 19:59:24,672 INFO L272 TraceCheckUtils]: 47: Hoare triple {253#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {252#true} is VALID [2022-02-20 19:59:24,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {252#true} havoc ~__retres1~2; {252#true} is VALID [2022-02-20 19:59:24,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {252#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {252#true} is VALID [2022-02-20 19:59:24,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {252#true} #res := ~__retres1~2; {252#true} is VALID [2022-02-20 19:59:24,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {252#true} assume true; {252#true} is VALID [2022-02-20 19:59:24,674 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {252#true} {253#false} #833#return; {253#false} is VALID [2022-02-20 19:59:24,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {253#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; {253#false} is VALID [2022-02-20 19:59:24,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {253#false} assume 0 != eval1_~tmp___1~0#1; {253#false} is VALID [2022-02-20 19:59:24,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {253#false} assume !(0 == ~p_dw_st~0); {253#false} is VALID [2022-02-20 19:59:24,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {253#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; {253#false} is VALID [2022-02-20 19:59:24,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {253#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; {253#false} is VALID [2022-02-20 19:59:24,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {253#false} assume !(0 == ~c_dr_pc~0); {253#false} is VALID [2022-02-20 19:59:24,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {253#false} assume 2 == ~c_dr_pc~0; {253#false} is VALID [2022-02-20 19:59:24,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {253#false} do_read_c_~a~0#1 := ~a_t~0; {253#false} is VALID [2022-02-20 19:59:24,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {253#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; {253#false} is VALID [2022-02-20 19:59:24,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {253#false} assume !(~p_last_write~0 == ~c_last_read~0); {253#false} is VALID [2022-02-20 19:59:24,677 INFO L272 TraceCheckUtils]: 63: Hoare triple {253#false} call error1(); {253#false} is VALID [2022-02-20 19:59:24,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {253#false} assume !false; {253#false} is VALID [2022-02-20 19:59:24,678 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:24,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:24,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559515037] [2022-02-20 19:59:24,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559515037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:24,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:24,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:24,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420725089] [2022-02-20 19:59:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:24,686 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:24,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:24,691 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:24,749 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:24,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:24,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:24,775 INFO L87 Difference]: Start difference. First operand has 249 states, 200 states have (on average 1.555) internal successors, (311), 206 states have internal predecessors, (311), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,991 INFO L93 Difference]: Finished difference Result 631 states and 957 transitions. [2022-02-20 19:59:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:26,992 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:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:26,993 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:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 957 transitions. [2022-02-20 19:59:27,010 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:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 957 transitions. [2022-02-20 19:59:27,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 957 transitions. [2022-02-20 19:59:27,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 957 edges. 957 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:27,680 INFO L225 Difference]: With dead ends: 631 [2022-02-20 19:59:27,680 INFO L226 Difference]: Without dead ends: 390 [2022-02-20 19:59:27,684 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:27,686 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 515 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:27,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 1334 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-20 19:59:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2022-02-20 19:59:27,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:27,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:27,747 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,761 INFO L93 Difference]: Finished difference Result 390 states and 557 transitions. [2022-02-20 19:59:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 557 transitions. [2022-02-20 19:59:27,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 390 states. [2022-02-20 19:59:27,766 INFO L87 Difference]: Start difference. First operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 390 states. [2022-02-20 19:59:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,779 INFO L93 Difference]: Finished difference Result 390 states and 557 transitions. [2022-02-20 19:59:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 557 transitions. [2022-02-20 19:59:27,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:27,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.446808510638298) internal successors, (408), 288 states have internal predecessors, (408), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 501 transitions. [2022-02-20 19:59:27,794 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 501 transitions. Word has length 65 [2022-02-20 19:59:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:27,795 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 501 transitions. [2022-02-20 19:59:27,795 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:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 501 transitions. [2022-02-20 19:59:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:27,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:27,797 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:27,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:27,797 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -832187424, now seen corresponding path program 1 times [2022-02-20 19:59:27,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:27,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273492855] [2022-02-20 19:59:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {2497#(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); {2498#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:27,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#(not (= |old(~q_req_up~0)| 1))} assume true; {2498#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:27,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2498#(not (= |old(~q_req_up~0)| 1))} {2458#(= ~q_req_up~0 ~p_dw_pc~0)} #825#return; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {2499#(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); {2455#true} is VALID [2022-02-20 19:59:27,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume !(0 == ~q_write_ev~0); {2455#true} is VALID [2022-02-20 19:59:27,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2462#(not (= ~p_dw_pc~0 1))} #827#return; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} havoc ~__retres1~0; {2455#true} is VALID [2022-02-20 19:59:27,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume 1 == ~p_dw_pc~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,910 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} {2455#true} #821#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} havoc ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume 1 == ~c_dr_pc~0; {2455#true} is VALID [2022-02-20 19:59:27,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2455#true} is VALID [2022-02-20 19:59:27,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {2455#true} #res := ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,916 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2455#true} {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #823#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {2500#(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; {2455#true} is VALID [2022-02-20 19:59:27,917 INFO L272 TraceCheckUtils]: 1: Hoare triple {2455#true} call #t~ret8 := is_do_write_p_triggered(); {2455#true} is VALID [2022-02-20 19:59:27,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} havoc ~__retres1~0; {2455#true} is VALID [2022-02-20 19:59:27,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {2455#true} assume 1 == ~p_dw_pc~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,918 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} {2455#true} #821#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,919 INFO L272 TraceCheckUtils]: 10: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2455#true} is VALID [2022-02-20 19:59:27,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#true} havoc ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {2455#true} assume 1 == ~c_dr_pc~0; {2455#true} is VALID [2022-02-20 19:59:27,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2455#true} is VALID [2022-02-20 19:59:27,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#true} #res := ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,920 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2455#true} {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #823#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,922 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} {2462#(not (= ~p_dw_pc~0 1))} #829#return; {2456#false} is VALID [2022-02-20 19:59:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {2499#(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); {2455#true} is VALID [2022-02-20 19:59:27,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2455#true} is VALID [2022-02-20 19:59:27,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2456#false} #831#return; {2456#false} is VALID [2022-02-20 19:59:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} havoc ~__retres1~2; {2455#true} is VALID [2022-02-20 19:59:27,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2455#true} is VALID [2022-02-20 19:59:27,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} #res := ~__retres1~2; {2455#true} is VALID [2022-02-20 19:59:27,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,931 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2455#true} {2456#false} #833#return; {2456#false} is VALID [2022-02-20 19:59:27,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {2457#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:27,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {2457#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {2457#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:27,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {2457#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {2458#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:27,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {2458#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {2458#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:27,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {2458#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {2497#(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:27,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {2497#(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); {2498#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:27,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {2498#(not (= |old(~q_req_up~0)| 1))} assume true; {2498#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:27,934 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2498#(not (= |old(~q_req_up~0)| 1))} {2458#(= ~q_req_up~0 ~p_dw_pc~0)} #825#return; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,936 INFO L272 TraceCheckUtils]: 12: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {2499#(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:27,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#(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); {2455#true} is VALID [2022-02-20 19:59:27,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#true} assume !(0 == ~q_write_ev~0); {2455#true} is VALID [2022-02-20 19:59:27,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,937 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2455#true} {2462#(not (= ~p_dw_pc~0 1))} #827#return; {2462#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:27,937 INFO L272 TraceCheckUtils]: 17: Hoare triple {2462#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {2500#(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:27,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {2500#(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; {2455#true} is VALID [2022-02-20 19:59:27,937 INFO L272 TraceCheckUtils]: 19: Hoare triple {2455#true} call #t~ret8 := is_do_write_p_triggered(); {2455#true} is VALID [2022-02-20 19:59:27,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {2455#true} havoc ~__retres1~0; {2455#true} is VALID [2022-02-20 19:59:27,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {2455#true} assume 1 == ~p_dw_pc~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,939 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} {2455#true} #821#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,940 INFO L272 TraceCheckUtils]: 28: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2455#true} is VALID [2022-02-20 19:59:27,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {2455#true} havoc ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {2455#true} assume 1 == ~c_dr_pc~0; {2455#true} is VALID [2022-02-20 19:59:27,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {2455#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2455#true} is VALID [2022-02-20 19:59:27,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {2455#true} #res := ~__retres1~1; {2455#true} is VALID [2022-02-20 19:59:27,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,941 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2455#true} {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} #823#return; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:27,943 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2507#(= (+ (- 1) ~p_dw_pc~0) 0)} {2462#(not (= ~p_dw_pc~0 1))} #829#return; {2456#false} is VALID [2022-02-20 19:59:27,943 INFO L272 TraceCheckUtils]: 39: Hoare triple {2456#false} call reset_delta_events1(); {2499#(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:27,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {2499#(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); {2455#true} is VALID [2022-02-20 19:59:27,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {2455#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2455#true} is VALID [2022-02-20 19:59:27,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,944 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2455#true} {2456#false} #831#return; {2456#false} is VALID [2022-02-20 19:59:27,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 19:59:27,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {2456#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; {2456#false} is VALID [2022-02-20 19:59:27,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 19:59:27,944 INFO L272 TraceCheckUtils]: 47: Hoare triple {2456#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2455#true} is VALID [2022-02-20 19:59:27,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {2455#true} havoc ~__retres1~2; {2455#true} is VALID [2022-02-20 19:59:27,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {2455#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2455#true} is VALID [2022-02-20 19:59:27,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {2455#true} #res := ~__retres1~2; {2455#true} is VALID [2022-02-20 19:59:27,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-02-20 19:59:27,945 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2455#true} {2456#false} #833#return; {2456#false} is VALID [2022-02-20 19:59:27,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {2456#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; {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {2456#false} assume 0 != eval1_~tmp___1~0#1; {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {2456#false} assume !(0 == ~p_dw_st~0); {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {2456#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; {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {2456#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; {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {2456#false} assume !(0 == ~c_dr_pc~0); {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {2456#false} assume 2 == ~c_dr_pc~0; {2456#false} is VALID [2022-02-20 19:59:27,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {2456#false} do_read_c_~a~0#1 := ~a_t~0; {2456#false} is VALID [2022-02-20 19:59:27,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {2456#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; {2456#false} is VALID [2022-02-20 19:59:27,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {2456#false} assume !(~p_last_write~0 == ~c_last_read~0); {2456#false} is VALID [2022-02-20 19:59:27,947 INFO L272 TraceCheckUtils]: 63: Hoare triple {2456#false} call error1(); {2456#false} is VALID [2022-02-20 19:59:27,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 19:59:27,947 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:27,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:27,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273492855] [2022-02-20 19:59:27,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273492855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:27,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:27,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:27,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795573988] [2022-02-20 19:59:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:27,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:27,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:27,985 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:27,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:27,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:27,986 INFO L87 Difference]: Start difference. First operand 351 states and 501 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,849 INFO L93 Difference]: Finished difference Result 1384 states and 1961 transitions. [2022-02-20 19:59:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:32,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1149 transitions. [2022-02-20 19:59:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1149 transitions. [2022-02-20 19:59:32,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1149 transitions. [2022-02-20 19:59:33,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1149 edges. 1149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:33,727 INFO L225 Difference]: With dead ends: 1384 [2022-02-20 19:59:33,728 INFO L226 Difference]: Without dead ends: 1163 [2022-02-20 19:59:33,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:33,730 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 2089 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:33,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2109 Valid, 1909 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-02-20 19:59:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1024. [2022-02-20 19:59:33,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:33,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:33,800 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:33,802 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,849 INFO L93 Difference]: Finished difference Result 1163 states and 1571 transitions. [2022-02-20 19:59:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1571 transitions. [2022-02-20 19:59:33,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:33,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:33,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) Second operand 1163 states. [2022-02-20 19:59:33,855 INFO L87 Difference]: Start difference. First operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) Second operand 1163 states. [2022-02-20 19:59:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,898 INFO L93 Difference]: Finished difference Result 1163 states and 1571 transitions. [2022-02-20 19:59:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1571 transitions. [2022-02-20 19:59:33,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:33,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:33,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:33,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 825 states have (on average 1.3903030303030304) internal successors, (1147), 839 states have internal predecessors, (1147), 116 states have call successors, (116), 74 states have call predecessors, (116), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1391 transitions. [2022-02-20 19:59:33,946 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1391 transitions. Word has length 65 [2022-02-20 19:59:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:33,948 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1391 transitions. [2022-02-20 19:59:33,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1391 transitions. [2022-02-20 19:59:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:33,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:33,951 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:33,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:33,951 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1785966606, now seen corresponding path program 1 times [2022-02-20 19:59:33,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:33,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499264358] [2022-02-20 19:59:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {8206#(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); {8166#true} is VALID [2022-02-20 19:59:34,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8166#true} {8166#true} #825#return; {8166#true} is VALID [2022-02-20 19:59:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {8207#(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); {8166#true} is VALID [2022-02-20 19:59:34,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume !(0 == ~q_write_ev~0); {8166#true} is VALID [2022-02-20 19:59:34,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8166#true} {8166#true} #827#return; {8166#true} is VALID [2022-02-20 19:59:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {8166#true} havoc ~__retres1~0; {8166#true} is VALID [2022-02-20 19:59:34,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume !(1 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} assume !(2 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {8166#true} ~__retres1~0 := 0; {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:34,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,128 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8166#true} #821#return; {8216#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {8166#true} havoc ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume 1 == ~c_dr_pc~0; {8166#true} is VALID [2022-02-20 19:59:34,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8166#true} is VALID [2022-02-20 19:59:34,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {8166#true} #res := ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,141 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8166#true} {8167#false} #823#return; {8167#false} is VALID [2022-02-20 19:59:34,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {8208#(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; {8166#true} is VALID [2022-02-20 19:59:34,146 INFO L272 TraceCheckUtils]: 1: Hoare triple {8166#true} call #t~ret8 := is_do_write_p_triggered(); {8166#true} is VALID [2022-02-20 19:59:34,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} havoc ~__retres1~0; {8166#true} is VALID [2022-02-20 19:59:34,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {8166#true} assume !(1 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {8166#true} assume !(2 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {8166#true} ~__retres1~0 := 0; {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:34,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,152 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8166#true} #821#return; {8216#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:34,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {8216#(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; {8217#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:34,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {8217#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8167#false} is VALID [2022-02-20 19:59:34,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {8167#false} call #t~ret9 := is_do_read_c_triggered(); {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {8166#true} havoc ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {8166#true} assume 1 == ~c_dr_pc~0; {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {8166#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {8166#true} #res := ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,155 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8166#true} {8167#false} #823#return; {8167#false} is VALID [2022-02-20 19:59:34,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {8167#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8167#false} is VALID [2022-02-20 19:59:34,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {8167#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8167#false} is VALID [2022-02-20 19:59:34,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {8167#false} assume true; {8167#false} is VALID [2022-02-20 19:59:34,156 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8167#false} {8166#true} #829#return; {8167#false} is VALID [2022-02-20 19:59:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {8207#(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); {8166#true} is VALID [2022-02-20 19:59:34,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8166#true} is VALID [2022-02-20 19:59:34,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8166#true} {8167#false} #831#return; {8167#false} is VALID [2022-02-20 19:59:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {8166#true} havoc ~__retres1~2; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} #res := ~__retres1~2; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8166#true} {8167#false} #833#return; {8167#false} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {8166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {8166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {8166#true} is VALID [2022-02-20 19:59:34,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {8166#true} is VALID [2022-02-20 19:59:34,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {8166#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; {8166#true} is VALID [2022-02-20 19:59:34,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {8166#true} call update_channels1(); {8206#(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:34,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {8206#(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); {8166#true} is VALID [2022-02-20 19:59:34,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,165 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8166#true} {8166#true} #825#return; {8166#true} is VALID [2022-02-20 19:59:34,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {8166#true} assume { :begin_inline_init_threads1 } true; {8166#true} is VALID [2022-02-20 19:59:34,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {8166#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8166#true} is VALID [2022-02-20 19:59:34,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {8166#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8166#true} is VALID [2022-02-20 19:59:34,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {8166#true} assume { :end_inline_init_threads1 } true; {8166#true} is VALID [2022-02-20 19:59:34,166 INFO L272 TraceCheckUtils]: 12: Hoare triple {8166#true} call fire_delta_events1(); {8207#(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:34,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {8207#(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); {8166#true} is VALID [2022-02-20 19:59:34,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {8166#true} assume !(0 == ~q_write_ev~0); {8166#true} is VALID [2022-02-20 19:59:34,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,167 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8166#true} {8166#true} #827#return; {8166#true} is VALID [2022-02-20 19:59:34,167 INFO L272 TraceCheckUtils]: 17: Hoare triple {8166#true} call activate_threads1(); {8208#(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:34,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {8208#(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; {8166#true} is VALID [2022-02-20 19:59:34,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {8166#true} call #t~ret8 := is_do_write_p_triggered(); {8166#true} is VALID [2022-02-20 19:59:34,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {8166#true} havoc ~__retres1~0; {8166#true} is VALID [2022-02-20 19:59:34,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {8166#true} assume !(1 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {8166#true} assume !(2 == ~p_dw_pc~0); {8166#true} is VALID [2022-02-20 19:59:34,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {8166#true} ~__retres1~0 := 0; {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:34,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {8224#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:34,169 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8225#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8166#true} #821#return; {8216#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:34,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {8216#(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; {8217#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:34,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {8217#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8167#false} is VALID [2022-02-20 19:59:34,170 INFO L272 TraceCheckUtils]: 29: Hoare triple {8167#false} call #t~ret9 := is_do_read_c_triggered(); {8166#true} is VALID [2022-02-20 19:59:34,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {8166#true} havoc ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {8166#true} assume 1 == ~c_dr_pc~0; {8166#true} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {8166#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8166#true} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {8166#true} #res := ~__retres1~1; {8166#true} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,171 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8166#true} {8167#false} #823#return; {8167#false} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {8167#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8167#false} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {8167#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8167#false} is VALID [2022-02-20 19:59:34,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {8167#false} assume true; {8167#false} is VALID [2022-02-20 19:59:34,171 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8167#false} {8166#true} #829#return; {8167#false} is VALID [2022-02-20 19:59:34,172 INFO L272 TraceCheckUtils]: 40: Hoare triple {8167#false} call reset_delta_events1(); {8207#(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:34,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {8207#(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); {8166#true} is VALID [2022-02-20 19:59:34,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {8166#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8166#true} is VALID [2022-02-20 19:59:34,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,172 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8166#true} {8167#false} #831#return; {8167#false} is VALID [2022-02-20 19:59:34,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {8167#false} assume !false; {8167#false} is VALID [2022-02-20 19:59:34,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {8167#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; {8167#false} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {8167#false} assume !false; {8167#false} is VALID [2022-02-20 19:59:34,173 INFO L272 TraceCheckUtils]: 48: Hoare triple {8167#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8166#true} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {8166#true} havoc ~__retres1~2; {8166#true} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {8166#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8166#true} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {8166#true} #res := ~__retres1~2; {8166#true} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {8166#true} assume true; {8166#true} is VALID [2022-02-20 19:59:34,173 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8166#true} {8167#false} #833#return; {8167#false} is VALID [2022-02-20 19:59:34,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {8167#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; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {8167#false} assume 0 != eval1_~tmp___1~0#1; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {8167#false} assume !(0 == ~p_dw_st~0); {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {8167#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; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {8167#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; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {8167#false} assume !(0 == ~c_dr_pc~0); {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {8167#false} assume 2 == ~c_dr_pc~0; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {8167#false} do_read_c_~a~0#1 := ~a_t~0; {8167#false} is VALID [2022-02-20 19:59:34,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {8167#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; {8167#false} is VALID [2022-02-20 19:59:34,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {8167#false} assume !(~p_last_write~0 == ~c_last_read~0); {8167#false} is VALID [2022-02-20 19:59:34,175 INFO L272 TraceCheckUtils]: 64: Hoare triple {8167#false} call error1(); {8167#false} is VALID [2022-02-20 19:59:34,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {8167#false} assume !false; {8167#false} is VALID [2022-02-20 19:59:34,175 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:34,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:34,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499264358] [2022-02-20 19:59:34,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499264358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:34,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:34,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:34,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865481744] [2022-02-20 19:59:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:34,177 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:34,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:34,177 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:34,207 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:34,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:34,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:34,209 INFO L87 Difference]: Start difference. First operand 1024 states and 1391 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:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,304 INFO L93 Difference]: Finished difference Result 2050 states and 2785 transitions. [2022-02-20 19:59:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:36,304 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:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:36,305 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:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 525 transitions. [2022-02-20 19:59:36,308 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:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 525 transitions. [2022-02-20 19:59:36,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 525 transitions. [2022-02-20 19:59:36,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:36,685 INFO L225 Difference]: With dead ends: 2050 [2022-02-20 19:59:36,685 INFO L226 Difference]: Without dead ends: 1162 [2022-02-20 19:59:36,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:36,688 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 266 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:36,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1505 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-02-20 19:59:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1054. [2022-02-20 19:59:36,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:36,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:36,740 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:36,742 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,783 INFO L93 Difference]: Finished difference Result 1162 states and 1566 transitions. [2022-02-20 19:59:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1566 transitions. [2022-02-20 19:59:36,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:36,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:36,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) Second operand 1162 states. [2022-02-20 19:59:36,790 INFO L87 Difference]: Start difference. First operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) Second operand 1162 states. [2022-02-20 19:59:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,832 INFO L93 Difference]: Finished difference Result 1162 states and 1566 transitions. [2022-02-20 19:59:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1566 transitions. [2022-02-20 19:59:36,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:36,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:36,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:36,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 849 states have (on average 1.375736160188457) internal successors, (1168), 863 states have internal predecessors, (1168), 116 states have call successors, (116), 74 states have call predecessors, (116), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1418 transitions. [2022-02-20 19:59:36,882 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1418 transitions. Word has length 66 [2022-02-20 19:59:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:36,882 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 1418 transitions. [2022-02-20 19:59:36,882 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:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1418 transitions. [2022-02-20 19:59:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:36,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:36,884 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:36,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:36,884 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1479641392, now seen corresponding path program 1 times [2022-02-20 19:59:36,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:36,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420849958] [2022-02-20 19:59:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {14790#(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); {14791#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:36,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {14791#(not (= |old(~q_req_up~0)| 1))} assume true; {14791#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:36,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14791#(not (= |old(~q_req_up~0)| 1))} {14750#(= ~c_dr_pc~0 ~q_req_up~0)} #825#return; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {14792#(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); {14747#true} is VALID [2022-02-20 19:59:36,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {14747#true} assume !(0 == ~q_write_ev~0); {14747#true} is VALID [2022-02-20 19:59:36,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:36,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14747#true} {14754#(not (= ~c_dr_pc~0 1))} #827#return; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {14747#true} havoc ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {14747#true} assume !(1 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {14747#true} assume !(2 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {14747#true} ~__retres1~0 := 0; {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {14747#true} #res := ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14747#true} {14747#true} #821#return; {14747#true} is VALID [2022-02-20 19:59:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {14747#true} havoc ~__retres1~1; {14747#true} is VALID [2022-02-20 19:59:37,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {14747#true} assume 1 == ~c_dr_pc~0; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,001 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} {14747#true} #823#return; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {14793#(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; {14747#true} is VALID [2022-02-20 19:59:37,001 INFO L272 TraceCheckUtils]: 1: Hoare triple {14747#true} call #t~ret8 := is_do_write_p_triggered(); {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {14747#true} havoc ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {14747#true} assume !(1 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {14747#true} assume !(2 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {14747#true} ~__retres1~0 := 0; {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {14747#true} #res := ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14747#true} {14747#true} #821#return; {14747#true} is VALID [2022-02-20 19:59:37,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {14747#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14747#true} is VALID [2022-02-20 19:59:37,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {14747#true} assume !(0 != ~tmp~1); {14747#true} is VALID [2022-02-20 19:59:37,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {14747#true} call #t~ret9 := is_do_read_c_triggered(); {14747#true} is VALID [2022-02-20 19:59:37,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {14747#true} havoc ~__retres1~1; {14747#true} is VALID [2022-02-20 19:59:37,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {14747#true} assume 1 == ~c_dr_pc~0; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,004 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} {14747#true} #823#return; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,005 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} {14754#(not (= ~c_dr_pc~0 1))} #829#return; {14748#false} is VALID [2022-02-20 19:59:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {14792#(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); {14747#true} is VALID [2022-02-20 19:59:37,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {14747#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14747#true} is VALID [2022-02-20 19:59:37,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14747#true} {14748#false} #831#return; {14748#false} is VALID [2022-02-20 19:59:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {14747#true} havoc ~__retres1~2; {14747#true} is VALID [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {14747#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14747#true} is VALID [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {14747#true} #res := ~__retres1~2; {14747#true} is VALID [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,013 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14747#true} {14748#false} #833#return; {14748#false} is VALID [2022-02-20 19:59:37,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {14747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {14749#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:37,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {14749#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {14749#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:37,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {14749#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {14750#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:37,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {14750#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {14750#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:37,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {14750#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {14790#(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,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {14790#(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); {14791#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:37,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {14791#(not (= |old(~q_req_up~0)| 1))} assume true; {14791#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:37,016 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14791#(not (= |old(~q_req_up~0)| 1))} {14750#(= ~c_dr_pc~0 ~q_req_up~0)} #825#return; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {14792#(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,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {14792#(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); {14747#true} is VALID [2022-02-20 19:59:37,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {14747#true} assume !(0 == ~q_write_ev~0); {14747#true} is VALID [2022-02-20 19:59:37,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,018 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14747#true} {14754#(not (= ~c_dr_pc~0 1))} #827#return; {14754#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:37,018 INFO L272 TraceCheckUtils]: 17: Hoare triple {14754#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {14793#(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,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {14793#(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; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L272 TraceCheckUtils]: 19: Hoare triple {14747#true} call #t~ret8 := is_do_write_p_triggered(); {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {14747#true} havoc ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {14747#true} assume !(1 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {14747#true} assume !(2 == ~p_dw_pc~0); {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {14747#true} ~__retres1~0 := 0; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {14747#true} #res := ~__retres1~0; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14747#true} {14747#true} #821#return; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {14747#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {14747#true} assume !(0 != ~tmp~1); {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L272 TraceCheckUtils]: 29: Hoare triple {14747#true} call #t~ret9 := is_do_read_c_triggered(); {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {14747#true} havoc ~__retres1~1; {14747#true} is VALID [2022-02-20 19:59:37,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {14747#true} assume 1 == ~c_dr_pc~0; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,021 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} {14747#true} #823#return; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:37,022 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14807#(= (+ (- 1) ~c_dr_pc~0) 0)} {14754#(not (= ~c_dr_pc~0 1))} #829#return; {14748#false} is VALID [2022-02-20 19:59:37,022 INFO L272 TraceCheckUtils]: 40: Hoare triple {14748#false} call reset_delta_events1(); {14792#(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,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {14792#(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); {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {14747#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14747#true} {14748#false} #831#return; {14748#false} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {14748#false} assume !false; {14748#false} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {14748#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; {14748#false} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {14748#false} assume !false; {14748#false} is VALID [2022-02-20 19:59:37,022 INFO L272 TraceCheckUtils]: 48: Hoare triple {14748#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {14747#true} havoc ~__retres1~2; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {14747#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {14747#true} #res := ~__retres1~2; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {14747#true} assume true; {14747#true} is VALID [2022-02-20 19:59:37,022 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14747#true} {14748#false} #833#return; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {14748#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; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {14748#false} assume 0 != eval1_~tmp___1~0#1; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {14748#false} assume !(0 == ~p_dw_st~0); {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {14748#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; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {14748#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; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {14748#false} assume !(0 == ~c_dr_pc~0); {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {14748#false} assume 2 == ~c_dr_pc~0; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {14748#false} do_read_c_~a~0#1 := ~a_t~0; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {14748#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; {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {14748#false} assume !(~p_last_write~0 == ~c_last_read~0); {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L272 TraceCheckUtils]: 64: Hoare triple {14748#false} call error1(); {14748#false} is VALID [2022-02-20 19:59:37,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {14748#false} assume !false; {14748#false} is VALID [2022-02-20 19:59:37,023 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,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:37,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420849958] [2022-02-20 19:59:37,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420849958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:37,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:37,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:37,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728585522] [2022-02-20 19:59:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 19:59:37,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:37,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:37,055 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:37,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:37,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:37,057 INFO L87 Difference]: Start difference. First operand 1054 states and 1418 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,070 INFO L93 Difference]: Finished difference Result 3392 states and 4605 transitions. [2022-02-20 19:59:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 19:59:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1138 transitions. [2022-02-20 19:59:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1138 transitions. [2022-02-20 19:59:42,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1138 transitions. [2022-02-20 19:59:42,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1138 edges. 1138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:42,917 INFO L225 Difference]: With dead ends: 3392 [2022-02-20 19:59:42,917 INFO L226 Difference]: Without dead ends: 1297 [2022-02-20 19:59:42,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:42,927 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 2156 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:42,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2176 Valid, 1932 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-02-20 19:59:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1142. [2022-02-20 19:59:42,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:42,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1297 states. Second operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:42,980 INFO L74 IsIncluded]: Start isIncluded. First operand 1297 states. Second operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:42,982 INFO L87 Difference]: Start difference. First operand 1297 states. Second operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:43,028 INFO L93 Difference]: Finished difference Result 1297 states and 1692 transitions. [2022-02-20 19:59:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1692 transitions. [2022-02-20 19:59:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:43,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) Second operand 1297 states. [2022-02-20 19:59:43,047 INFO L87 Difference]: Start difference. First operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) Second operand 1297 states. [2022-02-20 19:59:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:43,096 INFO L93 Difference]: Finished difference Result 1297 states and 1692 transitions. [2022-02-20 19:59:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1692 transitions. [2022-02-20 19:59:43,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:43,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:43,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:43,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 902 states have (on average 1.335920177383592) internal successors, (1205), 916 states have internal predecessors, (1205), 136 states have call successors, (136), 88 states have call predecessors, (136), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1496 transitions. [2022-02-20 19:59:43,154 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1496 transitions. Word has length 66 [2022-02-20 19:59:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:43,154 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1496 transitions. [2022-02-20 19:59:43,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1496 transitions. [2022-02-20 19:59:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:43,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:43,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:43,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:43,156 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 864637062, now seen corresponding path program 1 times [2022-02-20 19:59:43,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:43,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969987520] [2022-02-20 19:59:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,195 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {23576#true} {23578#(= ~M_E~0 2)} #853#return; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume true; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,222 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23623#(= |old(~M_E~0)| 0)} {23578#(= ~M_E~0 2)} #855#return; {23577#false} is VALID [2022-02-20 19:59:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {23624#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {23576#true} is VALID [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {23576#true} assume !(1 == ~m_pc~0); {23576#true} is VALID [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {23576#true} is_master_triggered_~__retres1~4#1 := 0; {23576#true} is VALID [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {23576#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {23576#true} is VALID [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {23576#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {23576#true} is VALID [2022-02-20 19:59:43,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {23576#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {23576#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; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {23576#true} assume 1 == ~t1_pc~0; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {23576#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {23576#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {23576#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {23576#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {23576#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {23576#true} is VALID [2022-02-20 19:59:43,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {23576#true} assume !(1 == ~t2_pc~0); {23576#true} is VALID [2022-02-20 19:59:43,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {23576#true} is_transmit2_triggered_~__retres1~6#1 := 0; {23576#true} is VALID [2022-02-20 19:59:43,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {23576#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {23576#true} is VALID [2022-02-20 19:59:43,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {23576#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {23576#true} is VALID [2022-02-20 19:59:43,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {23576#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,240 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {23576#true} {23577#false} #857#return; {23577#false} is VALID [2022-02-20 19:59:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {23576#true} is VALID [2022-02-20 19:59:43,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {23576#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {23576#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {23576#true} assume 1 == ~E_M~0;~E_M~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {23576#true} assume 1 == ~E_1~0;~E_1~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {23576#true} assume 1 == ~E_2~0;~E_2~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,245 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23576#true} {23577#false} #859#return; {23577#false} is VALID [2022-02-20 19:59:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:43,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {23576#true} havoc ~__retres1~7; {23576#true} is VALID [2022-02-20 19:59:43,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {23576#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {23576#true} is VALID [2022-02-20 19:59:43,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {23576#true} #res := ~__retres1~7; {23576#true} is VALID [2022-02-20 19:59:43,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,253 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23576#true} {23577#false} #861#return; {23577#false} is VALID [2022-02-20 19:59:43,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {23576#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {23578#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {23578#(= ~M_E~0 2)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {23578#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {23578#(= ~M_E~0 2)} call update_channels2(); {23576#true} is VALID [2022-02-20 19:59:43,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,257 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23576#true} {23578#(= ~M_E~0 2)} #853#return; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {23578#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {23578#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {23578#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {23578#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {23578#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {23578#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:43,259 INFO L272 TraceCheckUtils]: 12: Hoare triple {23578#(= ~M_E~0 2)} call fire_delta_events2(); {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:43,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {23623#(= |old(~M_E~0)| 0)} assume true; {23623#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:43,261 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23623#(= |old(~M_E~0)| 0)} {23578#(= ~M_E~0 2)} #855#return; {23577#false} is VALID [2022-02-20 19:59:43,261 INFO L272 TraceCheckUtils]: 21: Hoare triple {23577#false} call activate_threads2(); {23624#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {23624#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {23576#true} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {23576#true} assume !(1 == ~m_pc~0); {23576#true} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {23576#true} is_master_triggered_~__retres1~4#1 := 0; {23576#true} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {23576#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {23576#true} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {23576#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {23576#true} is VALID [2022-02-20 19:59:43,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {23576#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {23576#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; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {23576#true} assume 1 == ~t1_pc~0; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {23576#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {23576#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {23576#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {23576#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {23576#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {23576#true} assume !(1 == ~t2_pc~0); {23576#true} is VALID [2022-02-20 19:59:43,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {23576#true} is_transmit2_triggered_~__retres1~6#1 := 0; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {23576#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {23576#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {23576#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23576#true} {23577#false} #857#return; {23577#false} is VALID [2022-02-20 19:59:43,263 INFO L272 TraceCheckUtils]: 42: Hoare triple {23577#false} call reset_delta_events2(); {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {23622#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {23576#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {23576#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {23576#true} assume 1 == ~E_M~0;~E_M~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {23576#true} assume 1 == ~E_1~0;~E_1~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {23576#true} assume 1 == ~E_2~0;~E_2~0 := 2; {23576#true} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,264 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23576#true} {23577#false} #859#return; {23577#false} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {23577#false} assume !false; {23577#false} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {23577#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {23577#false} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {23577#false} assume !false; {23577#false} is VALID [2022-02-20 19:59:43,264 INFO L272 TraceCheckUtils]: 54: Hoare triple {23577#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {23576#true} is VALID [2022-02-20 19:59:43,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {23576#true} havoc ~__retres1~7; {23576#true} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {23576#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {23576#true} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {23576#true} #res := ~__retres1~7; {23576#true} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {23576#true} assume true; {23576#true} is VALID [2022-02-20 19:59:43,265 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23576#true} {23577#false} #861#return; {23577#false} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {23577#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; {23577#false} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {23577#false} assume 0 != eval2_~tmp~5#1; {23577#false} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {23577#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; {23577#false} is VALID [2022-02-20 19:59:43,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {23577#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {23577#false} is VALID [2022-02-20 19:59:43,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {23577#false} assume !(0 == ~m_pc~0); {23577#false} is VALID [2022-02-20 19:59:43,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {23577#false} assume 1 == ~m_pc~0; {23577#false} is VALID [2022-02-20 19:59:43,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {23577#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {23577#false} is VALID [2022-02-20 19:59:43,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {23577#false} assume !false; {23577#false} is VALID [2022-02-20 19:59:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:43,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:43,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969987520] [2022-02-20 19:59:43,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969987520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:43,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:43,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:43,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324717607] [2022-02-20 19:59:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:43,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:43,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:43,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:43,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:43,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:43,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:43,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:43,300 INFO L87 Difference]: Start difference. First operand 1142 states and 1496 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,051 INFO L93 Difference]: Finished difference Result 1438 states and 1943 transitions. [2022-02-20 19:59:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 781 transitions. [2022-02-20 19:59:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 781 transitions. [2022-02-20 19:59:45,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 781 transitions. [2022-02-20 19:59:45,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 781 edges. 781 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,631 INFO L225 Difference]: With dead ends: 1438 [2022-02-20 19:59:45,631 INFO L226 Difference]: Without dead ends: 1321 [2022-02-20 19:59:45,632 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:45,633 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 648 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:45,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 883 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-02-20 19:59:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1258. [2022-02-20 19:59:45,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:45,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1321 states. Second operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:45,690 INFO L74 IsIncluded]: Start isIncluded. First operand 1321 states. Second operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:45,691 INFO L87 Difference]: Start difference. First operand 1321 states. Second operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,737 INFO L93 Difference]: Finished difference Result 1321 states and 1767 transitions. [2022-02-20 19:59:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1767 transitions. [2022-02-20 19:59:45,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) Second operand 1321 states. [2022-02-20 19:59:45,743 INFO L87 Difference]: Start difference. First operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) Second operand 1321 states. [2022-02-20 19:59:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,790 INFO L93 Difference]: Finished difference Result 1321 states and 1767 transitions. [2022-02-20 19:59:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1767 transitions. [2022-02-20 19:59:45,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:45,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1000 states have (on average 1.351) internal successors, (1351), 1015 states have internal predecessors, (1351), 147 states have call successors, (147), 94 states have call predecessors, (147), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1667 transitions. [2022-02-20 19:59:45,854 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1667 transitions. Word has length 68 [2022-02-20 19:59:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:45,854 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1667 transitions. [2022-02-20 19:59:45,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1667 transitions. [2022-02-20 19:59:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:45,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:45,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:45,855 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2043544824, now seen corresponding path program 1 times [2022-02-20 19:59:45,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:45,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400451222] [2022-02-20 19:59:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,888 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {29921#true} {29923#(= ~T1_E~0 ~M_E~0)} #853#return; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {29968#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:45,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {29968#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,918 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {29923#(= ~T1_E~0 ~M_E~0)} #855#return; {29922#false} is VALID [2022-02-20 19:59:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {29970#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {29921#true} assume !(1 == ~m_pc~0); {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {29921#true} is_master_triggered_~__retres1~4#1 := 0; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {29921#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {29921#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {29921#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {29921#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; {29921#true} is VALID [2022-02-20 19:59:45,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {29921#true} assume 1 == ~t1_pc~0; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {29921#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {29921#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {29921#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {29921#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {29921#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {29921#true} assume !(1 == ~t2_pc~0); {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {29921#true} is_transmit2_triggered_~__retres1~6#1 := 0; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {29921#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {29921#true} is VALID [2022-02-20 19:59:45,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {29921#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {29921#true} is VALID [2022-02-20 19:59:45,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {29921#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,936 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {29921#true} {29922#false} #857#return; {29922#false} is VALID [2022-02-20 19:59:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {29921#true} is VALID [2022-02-20 19:59:45,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {29921#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {29921#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {29921#true} assume 1 == ~E_M~0;~E_M~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {29921#true} assume 1 == ~E_1~0;~E_1~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {29921#true} assume 1 == ~E_2~0;~E_2~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,940 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29921#true} {29922#false} #859#return; {29922#false} is VALID [2022-02-20 19:59:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {29921#true} havoc ~__retres1~7; {29921#true} is VALID [2022-02-20 19:59:45,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {29921#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {29921#true} is VALID [2022-02-20 19:59:45,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {29921#true} #res := ~__retres1~7; {29921#true} is VALID [2022-02-20 19:59:45,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,943 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29921#true} {29922#false} #861#return; {29922#false} is VALID [2022-02-20 19:59:45,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {29921#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {29921#true} is VALID [2022-02-20 19:59:45,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,945 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29921#true} {29923#(= ~T1_E~0 ~M_E~0)} #853#return; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {29923#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:45,947 INFO L272 TraceCheckUtils]: 12: Hoare triple {29923#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:45,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {29968#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:45,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {29968#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:45,949 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29969#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {29923#(= ~T1_E~0 ~M_E~0)} #855#return; {29922#false} is VALID [2022-02-20 19:59:45,949 INFO L272 TraceCheckUtils]: 21: Hoare triple {29922#false} call activate_threads2(); {29970#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:45,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {29970#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {29921#true} is VALID [2022-02-20 19:59:45,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {29921#true} assume !(1 == ~m_pc~0); {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {29921#true} is_master_triggered_~__retres1~4#1 := 0; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {29921#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {29921#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {29921#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {29921#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; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {29921#true} assume 1 == ~t1_pc~0; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {29921#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {29921#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {29921#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {29921#true} is VALID [2022-02-20 19:59:45,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {29921#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {29921#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {29921#true} assume !(1 == ~t2_pc~0); {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {29921#true} is_transmit2_triggered_~__retres1~6#1 := 0; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {29921#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {29921#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {29921#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,951 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29921#true} {29922#false} #857#return; {29922#false} is VALID [2022-02-20 19:59:45,951 INFO L272 TraceCheckUtils]: 42: Hoare triple {29922#false} call reset_delta_events2(); {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {29967#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {29921#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {29921#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {29921#true} assume 1 == ~E_M~0;~E_M~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {29921#true} assume 1 == ~E_1~0;~E_1~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {29921#true} assume 1 == ~E_2~0;~E_2~0 := 2; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,952 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29921#true} {29922#false} #859#return; {29922#false} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {29922#false} assume !false; {29922#false} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {29922#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {29922#false} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {29922#false} assume !false; {29922#false} is VALID [2022-02-20 19:59:45,959 INFO L272 TraceCheckUtils]: 54: Hoare triple {29922#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {29921#true} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {29921#true} havoc ~__retres1~7; {29921#true} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {29921#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {29921#true} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {29921#true} #res := ~__retres1~7; {29921#true} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {29921#true} assume true; {29921#true} is VALID [2022-02-20 19:59:45,959 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29921#true} {29922#false} #861#return; {29922#false} is VALID [2022-02-20 19:59:45,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {29922#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; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {29922#false} assume 0 != eval2_~tmp~5#1; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {29922#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; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {29922#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {29922#false} assume !(0 == ~m_pc~0); {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {29922#false} assume 1 == ~m_pc~0; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {29922#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {29922#false} is VALID [2022-02-20 19:59:45,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {29922#false} assume !false; {29922#false} is VALID [2022-02-20 19:59:45,960 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:45,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:45,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400451222] [2022-02-20 19:59:45,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400451222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:45,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:45,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:45,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658768507] [2022-02-20 19:59:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:45,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:45,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:45,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:45,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:45,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:45,993 INFO L87 Difference]: Start difference. First operand 1258 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,341 INFO L93 Difference]: Finished difference Result 1701 states and 2327 transitions. [2022-02-20 19:59:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 781 transitions. [2022-02-20 19:59:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 781 transitions. [2022-02-20 19:59:48,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 781 transitions. [2022-02-20 19:59:48,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 781 edges. 781 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:48,919 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 19:59:48,920 INFO L226 Difference]: Without dead ends: 1468 [2022-02-20 19:59:48,920 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:48,921 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 642 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:48,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1270 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-02-20 19:59:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1367. [2022-02-20 19:59:48,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:48,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1468 states. Second operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:48,979 INFO L74 IsIncluded]: Start isIncluded. First operand 1468 states. Second operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:48,980 INFO L87 Difference]: Start difference. First operand 1468 states. Second operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,035 INFO L93 Difference]: Finished difference Result 1468 states and 1983 transitions. [2022-02-20 19:59:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1983 transitions. [2022-02-20 19:59:49,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:49,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:49,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1468 states. [2022-02-20 19:59:49,042 INFO L87 Difference]: Start difference. First operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1468 states. [2022-02-20 19:59:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,097 INFO L93 Difference]: Finished difference Result 1468 states and 1983 transitions. [2022-02-20 19:59:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1983 transitions. [2022-02-20 19:59:49,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:49,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:49,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:49,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1107 states have internal predecessors, (1483), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1823 transitions. [2022-02-20 19:59:49,171 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1823 transitions. Word has length 68 [2022-02-20 19:59:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:49,171 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 1823 transitions. [2022-02-20 19:59:49,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1823 transitions. [2022-02-20 19:59:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:49,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:49,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:49,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:49,173 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1167525818, now seen corresponding path program 1 times [2022-02-20 19:59:49,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:49,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221091478] [2022-02-20 19:59:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,212 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37058#true} {37060#(not (= ~E_M~0 0))} #853#return; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume true; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,233 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37106#(= |old(~E_M~0)| 0)} {37060#(not (= ~E_M~0 0))} #855#return; {37059#false} is VALID [2022-02-20 19:59:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {37107#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume !(1 == ~m_pc~0); {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} is_master_triggered_~__retres1~4#1 := 0; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {37058#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {37058#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {37058#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {37058#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; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {37058#true} assume 1 == ~t1_pc~0; {37058#true} is VALID [2022-02-20 19:59:49,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {37058#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {37058#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {37058#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {37058#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {37058#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {37058#true} assume !(1 == ~t2_pc~0); {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {37058#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {37058#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {37058#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {37058#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,249 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {37058#true} {37059#false} #857#return; {37059#false} is VALID [2022-02-20 19:59:49,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {37058#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {37058#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {37058#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,253 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37058#true} {37059#false} #859#return; {37059#false} is VALID [2022-02-20 19:59:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {37058#true} havoc ~__retres1~7; {37058#true} is VALID [2022-02-20 19:59:49,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {37058#true} is VALID [2022-02-20 19:59:49,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} #res := ~__retres1~7; {37058#true} is VALID [2022-02-20 19:59:49,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37058#true} {37059#false} #861#return; {37059#false} is VALID [2022-02-20 19:59:49,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {37058#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {37060#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {37060#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {37060#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {37060#(not (= ~E_M~0 0))} call update_channels2(); {37058#true} is VALID [2022-02-20 19:59:49,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,263 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37058#true} {37060#(not (= ~E_M~0 0))} #853#return; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {37060#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {37060#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {37060#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {37060#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {37060#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {37060#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:49,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {37060#(not (= ~E_M~0 0))} call fire_delta_events2(); {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:49,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {37105#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:49,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {37105#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {37106#(= |old(~E_M~0)| 0)} assume true; {37106#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:49,266 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37106#(= |old(~E_M~0)| 0)} {37060#(not (= ~E_M~0 0))} #855#return; {37059#false} is VALID [2022-02-20 19:59:49,266 INFO L272 TraceCheckUtils]: 21: Hoare triple {37059#false} call activate_threads2(); {37107#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {37107#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {37058#true} assume !(1 == ~m_pc~0); {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {37058#true} is_master_triggered_~__retres1~4#1 := 0; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {37058#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {37058#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {37058#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {37058#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; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {37058#true} assume 1 == ~t1_pc~0; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {37058#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37058#true} is VALID [2022-02-20 19:59:49,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {37058#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {37058#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {37058#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {37058#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {37058#true} assume !(1 == ~t2_pc~0); {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {37058#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {37058#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {37058#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {37058#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,268 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37058#true} {37059#false} #857#return; {37059#false} is VALID [2022-02-20 19:59:49,269 INFO L272 TraceCheckUtils]: 42: Hoare triple {37059#false} call reset_delta_events2(); {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:49,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {37104#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37058#true} is VALID [2022-02-20 19:59:49,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {37058#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {37058#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {37058#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {37058#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {37058#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,270 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37058#true} {37059#false} #859#return; {37059#false} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {37059#false} assume !false; {37059#false} is VALID [2022-02-20 19:59:49,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {37059#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {37059#false} is VALID [2022-02-20 19:59:49,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {37059#false} assume !false; {37059#false} is VALID [2022-02-20 19:59:49,271 INFO L272 TraceCheckUtils]: 54: Hoare triple {37059#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {37058#true} is VALID [2022-02-20 19:59:49,271 INFO L290 TraceCheckUtils]: 55: Hoare triple {37058#true} havoc ~__retres1~7; {37058#true} is VALID [2022-02-20 19:59:49,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {37058#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {37058#true} is VALID [2022-02-20 19:59:49,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {37058#true} #res := ~__retres1~7; {37058#true} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 19:59:49,272 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {37058#true} {37059#false} #861#return; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {37059#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; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {37059#false} assume 0 != eval2_~tmp~5#1; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 62: Hoare triple {37059#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; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {37059#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {37059#false} assume !(0 == ~m_pc~0); {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {37059#false} assume 1 == ~m_pc~0; {37059#false} is VALID [2022-02-20 19:59:49,272 INFO L290 TraceCheckUtils]: 66: Hoare triple {37059#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {37059#false} is VALID [2022-02-20 19:59:49,273 INFO L290 TraceCheckUtils]: 67: Hoare triple {37059#false} assume !false; {37059#false} is VALID [2022-02-20 19:59:49,273 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:49,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:49,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221091478] [2022-02-20 19:59:49,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221091478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:49,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:49,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:49,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328327632] [2022-02-20 19:59:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:49,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:49,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:49,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:49,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:49,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:49,306 INFO L87 Difference]: Start difference. First operand 1367 states and 1823 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,832 INFO L93 Difference]: Finished difference Result 1808 states and 2485 transitions. [2022-02-20 19:59:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:59:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 568 transitions. [2022-02-20 19:59:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 568 transitions. [2022-02-20 19:59:50,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 568 transitions. [2022-02-20 19:59:51,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,290 INFO L225 Difference]: With dead ends: 1808 [2022-02-20 19:59:51,290 INFO L226 Difference]: Without dead ends: 1466 [2022-02-20 19:59:51,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:51,291 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 542 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:51,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 844 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-02-20 19:59:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1367. [2022-02-20 19:59:51,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1466 states. Second operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:51,351 INFO L74 IsIncluded]: Start isIncluded. First operand 1466 states. Second operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:51,352 INFO L87 Difference]: Start difference. First operand 1466 states. Second operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,408 INFO L93 Difference]: Finished difference Result 1466 states and 1978 transitions. [2022-02-20 19:59:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1978 transitions. [2022-02-20 19:59:51,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1466 states. [2022-02-20 19:59:51,414 INFO L87 Difference]: Start difference. First operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1466 states. [2022-02-20 19:59:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,469 INFO L93 Difference]: Finished difference Result 1466 states and 1978 transitions. [2022-02-20 19:59:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1978 transitions. [2022-02-20 19:59:51,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1091 states have (on average 1.3565536205316224) internal successors, (1480), 1107 states have internal predecessors, (1480), 158 states have call successors, (158), 100 states have call predecessors, (158), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1820 transitions. [2022-02-20 19:59:51,545 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1820 transitions. Word has length 68 [2022-02-20 19:59:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 1820 transitions. [2022-02-20 19:59:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1820 transitions. [2022-02-20 19:59:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:51,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:51,546 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash 370814212, now seen corresponding path program 1 times [2022-02-20 19:59:51,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:51,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042739847] [2022-02-20 19:59:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,573 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {44324#true} {44326#(= ~E_1~0 ~M_E~0)} #853#return; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,600 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {44326#(= ~E_1~0 ~M_E~0)} #855#return; {44325#false} is VALID [2022-02-20 19:59:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {44373#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {44324#true} assume !(1 == ~m_pc~0); {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {44324#true} is_master_triggered_~__retres1~4#1 := 0; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {44324#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {44324#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {44324#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {44324#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; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {44324#true} assume 1 == ~t1_pc~0; {44324#true} is VALID [2022-02-20 19:59:51,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {44324#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {44324#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {44324#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {44324#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {44324#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {44324#true} assume !(1 == ~t2_pc~0); {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {44324#true} is_transmit2_triggered_~__retres1~6#1 := 0; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {44324#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {44324#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {44324#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,620 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {44324#true} {44325#false} #857#return; {44325#false} is VALID [2022-02-20 19:59:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {44324#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {44324#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {44324#true} assume 1 == ~E_M~0;~E_M~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {44324#true} assume 1 == ~E_1~0;~E_1~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {44324#true} assume 1 == ~E_2~0;~E_2~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,626 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44324#true} {44325#false} #859#return; {44325#false} is VALID [2022-02-20 19:59:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {44324#true} havoc ~__retres1~7; {44324#true} is VALID [2022-02-20 19:59:51,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {44324#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {44324#true} is VALID [2022-02-20 19:59:51,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {44324#true} #res := ~__retres1~7; {44324#true} is VALID [2022-02-20 19:59:51,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,652 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44324#true} {44325#false} #861#return; {44325#false} is VALID [2022-02-20 19:59:51,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {44324#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} call update_channels2(); {44324#true} is VALID [2022-02-20 19:59:51,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,654 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {44324#true} {44326#(= ~E_1~0 ~M_E~0)} #853#return; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {44326#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:59:51,656 INFO L272 TraceCheckUtils]: 12: Hoare triple {44326#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:51,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:51,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {44371#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:51,658 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44372#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {44326#(= ~E_1~0 ~M_E~0)} #855#return; {44325#false} is VALID [2022-02-20 19:59:51,658 INFO L272 TraceCheckUtils]: 21: Hoare triple {44325#false} call activate_threads2(); {44373#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:51,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {44373#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {44324#true} is VALID [2022-02-20 19:59:51,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {44324#true} assume !(1 == ~m_pc~0); {44324#true} is VALID [2022-02-20 19:59:51,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {44324#true} is_master_triggered_~__retres1~4#1 := 0; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {44324#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {44324#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {44324#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {44324#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; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {44324#true} assume 1 == ~t1_pc~0; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {44324#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {44324#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {44324#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {44324#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {44324#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {44324#true} assume !(1 == ~t2_pc~0); {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {44324#true} is_transmit2_triggered_~__retres1~6#1 := 0; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {44324#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {44324#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {44324#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44324#true} {44325#false} #857#return; {44325#false} is VALID [2022-02-20 19:59:51,660 INFO L272 TraceCheckUtils]: 42: Hoare triple {44325#false} call reset_delta_events2(); {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {44370#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {44324#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {44324#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {44324#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {44324#true} assume 1 == ~E_M~0;~E_M~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {44324#true} assume 1 == ~E_1~0;~E_1~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {44324#true} assume 1 == ~E_2~0;~E_2~0 := 2; {44324#true} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {44324#true} {44325#false} #859#return; {44325#false} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {44325#false} assume !false; {44325#false} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {44325#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {44325#false} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {44325#false} assume !false; {44325#false} is VALID [2022-02-20 19:59:51,662 INFO L272 TraceCheckUtils]: 54: Hoare triple {44325#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {44324#true} havoc ~__retres1~7; {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {44324#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {44324#true} #res := ~__retres1~7; {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {44324#true} assume true; {44324#true} is VALID [2022-02-20 19:59:51,662 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {44324#true} {44325#false} #861#return; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {44325#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; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {44325#false} assume 0 != eval2_~tmp~5#1; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 62: Hoare triple {44325#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; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 63: Hoare triple {44325#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {44325#false} assume !(0 == ~m_pc~0); {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {44325#false} assume 1 == ~m_pc~0; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {44325#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {44325#false} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 67: Hoare triple {44325#false} assume !false; {44325#false} is VALID [2022-02-20 19:59:51,664 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:51,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:51,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042739847] [2022-02-20 19:59:51,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042739847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:51,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:51,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:51,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864696297] [2022-02-20 19:59:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:51,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:51,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:51,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:51,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:51,699 INFO L87 Difference]: Start difference. First operand 1367 states and 1820 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,106 INFO L93 Difference]: Finished difference Result 2132 states and 2941 transitions. [2022-02-20 19:59:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:59:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 814 transitions. [2022-02-20 19:59:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 814 transitions. [2022-02-20 19:59:54,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 814 transitions. [2022-02-20 19:59:54,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 814 edges. 814 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:54,765 INFO L225 Difference]: With dead ends: 2132 [2022-02-20 19:59:54,765 INFO L226 Difference]: Without dead ends: 1790 [2022-02-20 19:59:54,767 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:54,767 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 685 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:54,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 1238 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2022-02-20 19:59:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1576. [2022-02-20 19:59:54,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:54,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1790 states. Second operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 19:59:54,840 INFO L74 IsIncluded]: Start isIncluded. First operand 1790 states. Second operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 19:59:54,843 INFO L87 Difference]: Start difference. First operand 1790 states. Second operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 19:59:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,932 INFO L93 Difference]: Finished difference Result 1790 states and 2439 transitions. [2022-02-20 19:59:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2439 transitions. [2022-02-20 19:59:54,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:54,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:54,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) Second operand 1790 states. [2022-02-20 19:59:54,939 INFO L87 Difference]: Start difference. First operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) Second operand 1790 states. [2022-02-20 19:59:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,024 INFO L93 Difference]: Finished difference Result 1790 states and 2439 transitions. [2022-02-20 19:59:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2439 transitions. [2022-02-20 19:59:55,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:55,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1266 states have (on average 1.3688783570300158) internal successors, (1733), 1284 states have internal predecessors, (1733), 178 states have call successors, (178), 112 states have call predecessors, (178), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 19:59:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2121 transitions. [2022-02-20 19:59:55,126 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2121 transitions. Word has length 68 [2022-02-20 19:59:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:55,126 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2121 transitions. [2022-02-20 19:59:55,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2121 transitions. [2022-02-20 19:59:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:55,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:55,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:55,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:55,128 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1657771898, now seen corresponding path program 1 times [2022-02-20 19:59:55,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:55,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950202163] [2022-02-20 19:59:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,151 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {52946#true} {52948#(= ~E_2~0 ~M_E~0)} #853#return; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,176 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {52948#(= ~E_2~0 ~M_E~0)} #855#return; {52947#false} is VALID [2022-02-20 19:59:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {52995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {52946#true} is VALID [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {52946#true} assume !(1 == ~m_pc~0); {52946#true} is VALID [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {52946#true} is_master_triggered_~__retres1~4#1 := 0; {52946#true} is VALID [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {52946#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {52946#true} is VALID [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {52946#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {52946#true} is VALID [2022-02-20 19:59:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {52946#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {52946#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; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {52946#true} assume 1 == ~t1_pc~0; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {52946#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {52946#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {52946#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {52946#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {52946#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {52946#true} assume !(1 == ~t2_pc~0); {52946#true} is VALID [2022-02-20 19:59:55,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {52946#true} is_transmit2_triggered_~__retres1~6#1 := 0; {52946#true} is VALID [2022-02-20 19:59:55,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {52946#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {52946#true} is VALID [2022-02-20 19:59:55,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {52946#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {52946#true} is VALID [2022-02-20 19:59:55,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {52946#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,193 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {52946#true} {52947#false} #857#return; {52947#false} is VALID [2022-02-20 19:59:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {52946#true} is VALID [2022-02-20 19:59:55,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {52946#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {52946#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {52946#true} assume 1 == ~E_M~0;~E_M~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {52946#true} assume 1 == ~E_1~0;~E_1~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {52946#true} assume 1 == ~E_2~0;~E_2~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,197 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52946#true} {52947#false} #859#return; {52947#false} is VALID [2022-02-20 19:59:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {52946#true} havoc ~__retres1~7; {52946#true} is VALID [2022-02-20 19:59:55,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {52946#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {52946#true} is VALID [2022-02-20 19:59:55,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {52946#true} #res := ~__retres1~7; {52946#true} is VALID [2022-02-20 19:59:55,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,200 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52946#true} {52947#false} #861#return; {52947#false} is VALID [2022-02-20 19:59:55,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {52946#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} call update_channels2(); {52946#true} is VALID [2022-02-20 19:59:55,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,202 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {52946#true} {52948#(= ~E_2~0 ~M_E~0)} #853#return; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {52948#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {52948#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:55,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {52993#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,206 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52994#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {52948#(= ~E_2~0 ~M_E~0)} #855#return; {52947#false} is VALID [2022-02-20 19:59:55,206 INFO L272 TraceCheckUtils]: 21: Hoare triple {52947#false} call activate_threads2(); {52995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:55,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {52995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {52946#true} is VALID [2022-02-20 19:59:55,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {52946#true} assume !(1 == ~m_pc~0); {52946#true} is VALID [2022-02-20 19:59:55,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {52946#true} is_master_triggered_~__retres1~4#1 := 0; {52946#true} is VALID [2022-02-20 19:59:55,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {52946#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {52946#true} is VALID [2022-02-20 19:59:55,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {52946#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {52946#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {52946#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; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {52946#true} assume 1 == ~t1_pc~0; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {52946#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {52946#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {52946#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {52946#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {52946#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {52946#true} assume !(1 == ~t2_pc~0); {52946#true} is VALID [2022-02-20 19:59:55,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {52946#true} is_transmit2_triggered_~__retres1~6#1 := 0; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {52946#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {52946#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {52946#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {52946#true} {52947#false} #857#return; {52947#false} is VALID [2022-02-20 19:59:55,208 INFO L272 TraceCheckUtils]: 42: Hoare triple {52947#false} call reset_delta_events2(); {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {52992#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {52946#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {52946#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {52946#true} assume 1 == ~E_M~0;~E_M~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {52946#true} assume 1 == ~E_1~0;~E_1~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {52946#true} assume 1 == ~E_2~0;~E_2~0 := 2; {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {52946#true} {52947#false} #859#return; {52947#false} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {52947#false} assume !false; {52947#false} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {52947#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {52947#false} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {52947#false} assume !false; {52947#false} is VALID [2022-02-20 19:59:55,209 INFO L272 TraceCheckUtils]: 54: Hoare triple {52947#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {52946#true} is VALID [2022-02-20 19:59:55,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {52946#true} havoc ~__retres1~7; {52946#true} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {52946#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {52946#true} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {52946#true} #res := ~__retres1~7; {52946#true} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {52946#true} assume true; {52946#true} is VALID [2022-02-20 19:59:55,210 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {52946#true} {52947#false} #861#return; {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {52947#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; {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {52947#false} assume 0 != eval2_~tmp~5#1; {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {52947#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; {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {52947#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {52947#false} assume !(0 == ~m_pc~0); {52947#false} is VALID [2022-02-20 19:59:55,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {52947#false} assume 1 == ~m_pc~0; {52947#false} is VALID [2022-02-20 19:59:55,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {52947#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {52947#false} is VALID [2022-02-20 19:59:55,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {52947#false} assume !false; {52947#false} is VALID [2022-02-20 19:59:55,211 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:55,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:55,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950202163] [2022-02-20 19:59:55,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950202163] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:55,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:55,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:55,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097184758] [2022-02-20 19:59:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:55,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:55,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:55,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:55,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:55,245 INFO L87 Difference]: Start difference. First operand 1576 states and 2121 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:57,913 INFO L93 Difference]: Finished difference Result 2835 states and 3948 transitions. [2022-02-20 19:59:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:59:57,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 793 transitions. [2022-02-20 19:59:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 793 transitions. [2022-02-20 19:59:57,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 793 transitions. [2022-02-20 19:59:58,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 793 edges. 793 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:58,620 INFO L225 Difference]: With dead ends: 2835 [2022-02-20 19:59:58,620 INFO L226 Difference]: Without dead ends: 2284 [2022-02-20 19:59:58,621 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:58,622 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 631 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:58,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 1250 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-02-20 19:59:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 1997. [2022-02-20 19:59:58,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:58,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2284 states. Second operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 19:59:58,711 INFO L74 IsIncluded]: Start isIncluded. First operand 2284 states. Second operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 19:59:58,714 INFO L87 Difference]: Start difference. First operand 2284 states. Second operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 19:59:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,855 INFO L93 Difference]: Finished difference Result 2284 states and 3139 transitions. [2022-02-20 19:59:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3139 transitions. [2022-02-20 19:59:58,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:58,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:58,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2284 states. [2022-02-20 19:59:58,864 INFO L87 Difference]: Start difference. First operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2284 states. [2022-02-20 19:59:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,998 INFO L93 Difference]: Finished difference Result 2284 states and 3139 transitions. [2022-02-20 19:59:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3139 transitions. [2022-02-20 19:59:59,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:59,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1621 states have (on average 1.3861813695249845) internal successors, (2247), 1643 states have internal predecessors, (2247), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 19:59:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2733 transitions. [2022-02-20 19:59:59,160 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2733 transitions. Word has length 68 [2022-02-20 19:59:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:59,160 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 2733 transitions. [2022-02-20 19:59:59,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2733 transitions. [2022-02-20 19:59:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:59:59,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:59,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:59,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:59:59,162 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2138852156, now seen corresponding path program 1 times [2022-02-20 19:59:59,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:59,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345060349] [2022-02-20 19:59:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,190 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {64026#true} {64026#true} #853#return; {64026#true} is VALID [2022-02-20 19:59:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {64026#true} is VALID [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {64026#true} assume !(0 == ~T1_E~0); {64026#true} is VALID [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {64026#true} assume !(0 == ~T2_E~0); {64026#true} is VALID [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {64026#true} assume !(0 == ~E_M~0); {64026#true} is VALID [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {64026#true} assume !(0 == ~E_1~0); {64026#true} is VALID [2022-02-20 19:59:59,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {64026#true} assume !(0 == ~E_2~0); {64026#true} is VALID [2022-02-20 19:59:59,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,199 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64026#true} {64026#true} #855#return; {64026#true} is VALID [2022-02-20 19:59:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {64072#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {64026#true} is VALID [2022-02-20 19:59:59,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {64026#true} assume !(1 == ~m_pc~0); {64026#true} is VALID [2022-02-20 19:59:59,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {64026#true} is_master_triggered_~__retres1~4#1 := 0; {64073#(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:59,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {64073#(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; {64074#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:59,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {64074#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {64075#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:59,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {64075#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {64027#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; {64027#false} is VALID [2022-02-20 19:59:59,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {64027#false} assume 1 == ~t1_pc~0; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {64027#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {64027#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {64027#false} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {64027#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {64027#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {64027#false} assume !(1 == ~t2_pc~0); {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {64027#false} is_transmit2_triggered_~__retres1~6#1 := 0; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {64027#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {64027#false} is VALID [2022-02-20 19:59:59,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {64027#false} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {64027#false} is VALID [2022-02-20 19:59:59,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {64027#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {64027#false} assume true; {64027#false} is VALID [2022-02-20 19:59:59,249 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {64027#false} {64026#true} #857#return; {64027#false} is VALID [2022-02-20 19:59:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {64026#true} is VALID [2022-02-20 19:59:59,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {64026#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {64026#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {64026#true} assume 1 == ~E_M~0;~E_M~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {64026#true} assume 1 == ~E_1~0;~E_1~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {64026#true} assume 1 == ~E_2~0;~E_2~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,253 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64026#true} {64027#false} #859#return; {64027#false} is VALID [2022-02-20 19:59:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {64026#true} havoc ~__retres1~7; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {64026#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {64026#true} #res := ~__retres1~7; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64026#true} {64027#false} #861#return; {64027#false} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {64026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {64026#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {64026#true} is VALID [2022-02-20 19:59:59,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {64026#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {64026#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {64026#true} call update_channels2(); {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64026#true} {64026#true} #853#return; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {64026#true} assume { :begin_inline_init_threads2 } true; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {64026#true} assume 1 == ~m_i~0;~m_st~0 := 0; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {64026#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {64026#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {64026#true} is VALID [2022-02-20 19:59:59,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {64026#true} assume { :end_inline_init_threads2 } true; {64026#true} is VALID [2022-02-20 19:59:59,259 INFO L272 TraceCheckUtils]: 12: Hoare triple {64026#true} call fire_delta_events2(); {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:59,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {64026#true} is VALID [2022-02-20 19:59:59,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {64026#true} assume !(0 == ~T1_E~0); {64026#true} is VALID [2022-02-20 19:59:59,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {64026#true} assume !(0 == ~T2_E~0); {64026#true} is VALID [2022-02-20 19:59:59,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {64026#true} assume !(0 == ~E_M~0); {64026#true} is VALID [2022-02-20 19:59:59,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {64026#true} assume !(0 == ~E_1~0); {64026#true} is VALID [2022-02-20 19:59:59,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {64026#true} assume !(0 == ~E_2~0); {64026#true} is VALID [2022-02-20 19:59:59,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,260 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {64026#true} {64026#true} #855#return; {64026#true} is VALID [2022-02-20 19:59:59,260 INFO L272 TraceCheckUtils]: 21: Hoare triple {64026#true} call activate_threads2(); {64072#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:59,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {64072#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {64026#true} is VALID [2022-02-20 19:59:59,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {64026#true} assume !(1 == ~m_pc~0); {64026#true} is VALID [2022-02-20 19:59:59,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {64026#true} is_master_triggered_~__retres1~4#1 := 0; {64073#(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:59,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {64073#(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; {64074#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:59,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {64074#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {64075#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {64075#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {64027#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; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {64027#false} assume 1 == ~t1_pc~0; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {64027#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {64027#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {64027#false} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {64027#false} is VALID [2022-02-20 19:59:59,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {64027#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {64027#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {64027#false} assume !(1 == ~t2_pc~0); {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {64027#false} is_transmit2_triggered_~__retres1~6#1 := 0; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {64027#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {64027#false} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {64027#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {64027#false} assume true; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {64027#false} {64026#true} #857#return; {64027#false} is VALID [2022-02-20 19:59:59,263 INFO L272 TraceCheckUtils]: 42: Hoare triple {64027#false} call reset_delta_events2(); {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:59,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {64071#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {64026#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {64026#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {64026#true} assume 1 == ~E_M~0;~E_M~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {64026#true} assume 1 == ~E_1~0;~E_1~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {64026#true} assume 1 == ~E_2~0;~E_2~0 := 2; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,264 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {64026#true} {64027#false} #859#return; {64027#false} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {64027#false} assume !false; {64027#false} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {64027#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {64027#false} is VALID [2022-02-20 19:59:59,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {64027#false} assume !false; {64027#false} is VALID [2022-02-20 19:59:59,265 INFO L272 TraceCheckUtils]: 54: Hoare triple {64027#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {64026#true} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {64026#true} havoc ~__retres1~7; {64026#true} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {64026#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {64026#true} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {64026#true} #res := ~__retres1~7; {64026#true} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {64026#true} assume true; {64026#true} is VALID [2022-02-20 19:59:59,265 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {64026#true} {64027#false} #861#return; {64027#false} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {64027#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; {64027#false} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {64027#false} assume 0 != eval2_~tmp~5#1; {64027#false} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {64027#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; {64027#false} is VALID [2022-02-20 19:59:59,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {64027#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {64027#false} is VALID [2022-02-20 19:59:59,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {64027#false} assume !(0 == ~m_pc~0); {64027#false} is VALID [2022-02-20 19:59:59,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {64027#false} assume 1 == ~m_pc~0; {64027#false} is VALID [2022-02-20 19:59:59,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {64027#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {64027#false} is VALID [2022-02-20 19:59:59,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {64027#false} assume !false; {64027#false} is VALID [2022-02-20 19:59:59,266 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:59,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:59,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345060349] [2022-02-20 19:59:59,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345060349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:59,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:59,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:59,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971911857] [2022-02-20 19:59:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 19:59:59,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:59,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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:59,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:59,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:59,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:59,305 INFO L87 Difference]: Start difference. First operand 1997 states and 2733 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,887 INFO L93 Difference]: Finished difference Result 3506 states and 4960 transitions. [2022-02-20 20:00:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 20:00:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 620 transitions. [2022-02-20 20:00:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 620 transitions. [2022-02-20 20:00:01,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 620 transitions. [2022-02-20 20:00:02,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:02,522 INFO L225 Difference]: With dead ends: 3506 [2022-02-20 20:00:02,522 INFO L226 Difference]: Without dead ends: 2535 [2022-02-20 20:00:02,524 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 20:00:02,525 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 373 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:02,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1109 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2022-02-20 20:00:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2024. [2022-02-20 20:00:02,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:02,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2535 states. Second operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:02,718 INFO L74 IsIncluded]: Start isIncluded. First operand 2535 states. Second operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:02,720 INFO L87 Difference]: Start difference. First operand 2535 states. Second operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,886 INFO L93 Difference]: Finished difference Result 2535 states and 3507 transitions. [2022-02-20 20:00:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3507 transitions. [2022-02-20 20:00:02,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2535 states. [2022-02-20 20:00:02,894 INFO L87 Difference]: Start difference. First operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2535 states. [2022-02-20 20:00:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,054 INFO L93 Difference]: Finished difference Result 2535 states and 3507 transitions. [2022-02-20 20:00:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3507 transitions. [2022-02-20 20:00:03,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:03,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:03,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:03,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1648 states have (on average 1.3798543689320388) internal successors, (2274), 1670 states have internal predecessors, (2274), 216 states have call successors, (216), 136 states have call predecessors, (216), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2760 transitions. [2022-02-20 20:00:03,222 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2760 transitions. Word has length 68 [2022-02-20 20:00:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:03,222 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2760 transitions. [2022-02-20 20:00:03,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2760 transitions. [2022-02-20 20:00:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 20:00:03,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:03,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:03,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:03,224 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1715205434, now seen corresponding path program 1 times [2022-02-20 20:00:03,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:03,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224842588] [2022-02-20 20:00:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,245 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {76513#true} {76515#(= ~m_pc~0 ~t1_pc~0)} #853#return; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {76513#true} is VALID [2022-02-20 20:00:03,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {76513#true} assume !(0 == ~T1_E~0); {76513#true} is VALID [2022-02-20 20:00:03,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {76513#true} assume !(0 == ~T2_E~0); {76513#true} is VALID [2022-02-20 20:00:03,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {76513#true} assume !(0 == ~E_M~0); {76513#true} is VALID [2022-02-20 20:00:03,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {76513#true} assume !(0 == ~E_1~0); {76513#true} is VALID [2022-02-20 20:00:03,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {76513#true} assume !(0 == ~E_2~0); {76513#true} is VALID [2022-02-20 20:00:03,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76513#true} {76515#(= ~m_pc~0 ~t1_pc~0)} #855#return; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 20:00:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {76560#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {76513#true} is VALID [2022-02-20 20:00:03,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {76513#true} assume !(1 == ~m_pc~0); {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {76561#(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; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {76562#(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 20:00:03,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {76562#(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; {76562#(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 20:00:03,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {76562#(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; {76562#(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 20:00:03,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {76562#(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~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {76562#(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 20:00:03,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {76562#(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; {76562#(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 20:00:03,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {76562#(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 { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {76562#(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 20:00:03,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {76562#(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 == ~t2_pc~0); {76562#(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 20:00:03,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {76562#(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_transmit2_triggered_~__retres1~6#1 := 0; {76562#(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 20:00:03,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {76562#(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_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {76562#(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 20:00:03,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {76562#(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~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {76562#(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 20:00:03,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {76562#(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___1~1#1;~t2_st~0 := 0; {76562#(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 20:00:03,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {76562#(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; {76562#(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 20:00:03,325 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {76562#(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)))} {76515#(= ~m_pc~0 ~t1_pc~0)} #857#return; {76514#false} is VALID [2022-02-20 20:00:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:00:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {76513#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {76513#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {76513#true} assume 1 == ~E_M~0;~E_M~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {76513#true} assume 1 == ~E_1~0;~E_1~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {76513#true} assume 1 == ~E_2~0;~E_2~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,330 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76513#true} {76514#false} #859#return; {76514#false} is VALID [2022-02-20 20:00:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 20:00:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {76513#true} havoc ~__retres1~7; {76513#true} is VALID [2022-02-20 20:00:03,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {76513#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {76513#true} is VALID [2022-02-20 20:00:03,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {76513#true} #res := ~__retres1~7; {76513#true} is VALID [2022-02-20 20:00:03,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,334 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {76513#true} {76514#false} #861#return; {76514#false} is VALID [2022-02-20 20:00:03,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {76513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#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; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {76513#true} is VALID [2022-02-20 20:00:03,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,337 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {76513#true} {76515#(= ~m_pc~0 ~t1_pc~0)} #853#return; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:03,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {76513#true} is VALID [2022-02-20 20:00:03,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {76513#true} assume !(0 == ~T1_E~0); {76513#true} is VALID [2022-02-20 20:00:03,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {76513#true} assume !(0 == ~T2_E~0); {76513#true} is VALID [2022-02-20 20:00:03,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {76513#true} assume !(0 == ~E_M~0); {76513#true} is VALID [2022-02-20 20:00:03,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {76513#true} assume !(0 == ~E_1~0); {76513#true} is VALID [2022-02-20 20:00:03,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {76513#true} assume !(0 == ~E_2~0); {76513#true} is VALID [2022-02-20 20:00:03,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,340 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {76513#true} {76515#(= ~m_pc~0 ~t1_pc~0)} #855#return; {76515#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:03,341 INFO L272 TraceCheckUtils]: 21: Hoare triple {76515#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {76560#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 20:00:03,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {76560#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {76513#true} is VALID [2022-02-20 20:00:03,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {76513#true} assume !(1 == ~m_pc~0); {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {76561#(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; {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:03,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {76561#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {76562#(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 20:00:03,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {76562#(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; {76562#(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 20:00:03,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {76562#(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; {76562#(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 20:00:03,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {76562#(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~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {76562#(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 20:00:03,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {76562#(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; {76562#(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 20:00:03,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {76562#(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 { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {76562#(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 20:00:03,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {76562#(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 == ~t2_pc~0); {76562#(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 20:00:03,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {76562#(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_transmit2_triggered_~__retres1~6#1 := 0; {76562#(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 20:00:03,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {76562#(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_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {76562#(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 20:00:03,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {76562#(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~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {76562#(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 20:00:03,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {76562#(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___1~1#1;~t2_st~0 := 0; {76562#(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 20:00:03,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {76562#(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; {76562#(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 20:00:03,349 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {76562#(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)))} {76515#(= ~m_pc~0 ~t1_pc~0)} #857#return; {76514#false} is VALID [2022-02-20 20:00:03,349 INFO L272 TraceCheckUtils]: 42: Hoare triple {76514#false} call reset_delta_events2(); {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {76559#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {76513#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {76513#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {76513#true} assume 1 == ~E_M~0;~E_M~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {76513#true} assume 1 == ~E_1~0;~E_1~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {76513#true} assume 1 == ~E_2~0;~E_2~0 := 2; {76513#true} is VALID [2022-02-20 20:00:03,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {76513#true} {76514#false} #859#return; {76514#false} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {76514#false} assume !false; {76514#false} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {76514#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_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {76514#false} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {76514#false} assume !false; {76514#false} is VALID [2022-02-20 20:00:03,350 INFO L272 TraceCheckUtils]: 54: Hoare triple {76514#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {76513#true} havoc ~__retres1~7; {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {76513#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {76513#true} #res := ~__retres1~7; {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {76513#true} assume true; {76513#true} is VALID [2022-02-20 20:00:03,350 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {76513#true} {76514#false} #861#return; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {76514#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; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {76514#false} assume 0 != eval2_~tmp~5#1; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {76514#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; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {76514#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {76514#false} assume !(0 == ~m_pc~0); {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {76514#false} assume 1 == ~m_pc~0; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {76514#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {76514#false} is VALID [2022-02-20 20:00:03,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {76514#false} assume !false; {76514#false} is VALID [2022-02-20 20:00:03,352 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:03,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:03,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224842588] [2022-02-20 20:00:03,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224842588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:03,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:03,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:03,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146623707] [2022-02-20 20:00:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 20:00:03,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:03,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:03,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:03,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:03,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:03,402 INFO L87 Difference]: Start difference. First operand 2024 states and 2760 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,604 INFO L93 Difference]: Finished difference Result 5491 states and 7964 transitions. [2022-02-20 20:00:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:00:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2022-02-20 20:00:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1187 transitions. [2022-02-20 20:00:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1187 transitions. [2022-02-20 20:00:09,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1187 transitions. [2022-02-20 20:00:10,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:11,308 INFO L225 Difference]: With dead ends: 5491 [2022-02-20 20:00:11,309 INFO L226 Difference]: Without dead ends: 4493 [2022-02-20 20:00:11,312 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 20:00:11,313 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 1409 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:11,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1433 Valid, 1105 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2022-02-20 20:00:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 3942. [2022-02-20 20:00:12,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:12,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4493 states. Second operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-02-20 20:00:12,896 INFO L74 IsIncluded]: Start isIncluded. First operand 4493 states. Second operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-02-20 20:00:12,900 INFO L87 Difference]: Start difference. First operand 4493 states. Second operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-02-20 20:00:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,442 INFO L93 Difference]: Finished difference Result 4493 states and 6383 transitions. [2022-02-20 20:00:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 6383 transitions. [2022-02-20 20:00:13,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:13,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:13,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) Second operand 4493 states. [2022-02-20 20:00:13,458 INFO L87 Difference]: Start difference. First operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) Second operand 4493 states. [2022-02-20 20:00:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,033 INFO L93 Difference]: Finished difference Result 4493 states and 6383 transitions. [2022-02-20 20:00:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 6383 transitions. [2022-02-20 20:00:14,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:14,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:14,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:14,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3244 states have (on average 1.3982737361282367) internal successors, (4536), 3297 states have internal predecessors, (4536), 408 states have call successors, (408), 250 states have call predecessors, (408), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-02-20 20:00:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5523 transitions. [2022-02-20 20:00:14,698 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5523 transitions. Word has length 68 [2022-02-20 20:00:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:14,699 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 5523 transitions. [2022-02-20 20:00:14,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 20:00:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5523 transitions. [2022-02-20 20:00:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:14,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:14,701 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:14,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:14,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash 163766987, now seen corresponding path program 1 times [2022-02-20 20:00:14,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:14,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285836551] [2022-02-20 20:00:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {98071#(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); {98025#true} is VALID [2022-02-20 20:00:14,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98025#true} {98025#true} #825#return; {98025#true} is VALID [2022-02-20 20:00:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {98072#(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); {98025#true} is VALID [2022-02-20 20:00:14,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume !(0 == ~q_write_ev~0); {98025#true} is VALID [2022-02-20 20:00:14,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98025#true} {98025#true} #827#return; {98025#true} is VALID [2022-02-20 20:00:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {98025#true} havoc ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume !(1 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} assume !(2 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#true} ~__retres1~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {98025#true} #res := ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,777 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {98025#true} {98025#true} #821#return; {98025#true} is VALID [2022-02-20 20:00:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {98025#true} havoc ~__retres1~1; {98025#true} is VALID [2022-02-20 20:00:14,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume !(1 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} assume !(2 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#true} ~__retres1~1 := 0; {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:14,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,807 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {98025#true} #823#return; {98088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {98073#(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; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L272 TraceCheckUtils]: 1: Hoare triple {98025#true} call #t~ret8 := is_do_write_p_triggered(); {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} havoc ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#true} assume !(1 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {98025#true} assume !(2 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {98025#true} ~__retres1~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {98025#true} #res := ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {98025#true} {98025#true} #821#return; {98025#true} is VALID [2022-02-20 20:00:14,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {98025#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {98025#true} assume !(0 != ~tmp~1); {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {98025#true} call #t~ret9 := is_do_read_c_triggered(); {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {98025#true} havoc ~__retres1~1; {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {98025#true} assume !(1 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {98025#true} assume !(2 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {98025#true} ~__retres1~1 := 0; {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:14,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {98025#true} #823#return; {98088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:14,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {98088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:14,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {98089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {98026#false} is VALID [2022-02-20 20:00:14,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {98026#false} assume true; {98026#false} is VALID [2022-02-20 20:00:14,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {98026#false} {98025#true} #829#return; {98026#false} is VALID [2022-02-20 20:00:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {98072#(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); {98025#true} is VALID [2022-02-20 20:00:14,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {98025#true} is VALID [2022-02-20 20:00:14,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98025#true} {98026#false} #831#return; {98026#false} is VALID [2022-02-20 20:00:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {98025#true} havoc ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98025#true} is VALID [2022-02-20 20:00:14,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} #res := ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,820 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {98025#true} {98026#false} #833#return; {98026#false} is VALID [2022-02-20 20:00:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {98025#true} havoc ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} #res := ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {98025#true} {98026#false} #833#return; {98026#false} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {98025#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {98025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {98025#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {98025#true} is VALID [2022-02-20 20:00:14,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {98025#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; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {98025#true} call update_channels1(); {98071#(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:14,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {98071#(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); {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98025#true} {98025#true} #825#return; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {98025#true} assume { :begin_inline_init_threads1 } true; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {98025#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {98025#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {98025#true} assume { :end_inline_init_threads1 } true; {98025#true} is VALID [2022-02-20 20:00:14,826 INFO L272 TraceCheckUtils]: 12: Hoare triple {98025#true} call fire_delta_events1(); {98072#(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:14,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {98072#(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); {98025#true} is VALID [2022-02-20 20:00:14,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {98025#true} assume !(0 == ~q_write_ev~0); {98025#true} is VALID [2022-02-20 20:00:14,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,826 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98025#true} {98025#true} #827#return; {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L272 TraceCheckUtils]: 17: Hoare triple {98025#true} call activate_threads1(); {98073#(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:14,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {98073#(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; {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L272 TraceCheckUtils]: 19: Hoare triple {98025#true} call #t~ret8 := is_do_write_p_triggered(); {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {98025#true} havoc ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {98025#true} assume !(1 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {98025#true} assume !(2 == ~p_dw_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {98025#true} ~__retres1~0 := 0; {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {98025#true} #res := ~__retres1~0; {98025#true} is VALID [2022-02-20 20:00:14,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {98025#true} {98025#true} #821#return; {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {98025#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {98025#true} assume !(0 != ~tmp~1); {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L272 TraceCheckUtils]: 29: Hoare triple {98025#true} call #t~ret9 := is_do_read_c_triggered(); {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {98025#true} havoc ~__retres1~1; {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {98025#true} assume !(1 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {98025#true} assume !(2 == ~c_dr_pc~0); {98025#true} is VALID [2022-02-20 20:00:14,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {98025#true} ~__retres1~1 := 0; {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:14,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {98090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:14,829 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {98091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {98025#true} #823#return; {98088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:14,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {98088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:14,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {98089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {98026#false} is VALID [2022-02-20 20:00:14,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {98026#false} assume true; {98026#false} is VALID [2022-02-20 20:00:14,830 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {98026#false} {98025#true} #829#return; {98026#false} is VALID [2022-02-20 20:00:14,831 INFO L272 TraceCheckUtils]: 41: Hoare triple {98026#false} call reset_delta_events1(); {98072#(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:14,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {98072#(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); {98025#true} is VALID [2022-02-20 20:00:14,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {98025#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {98025#true} is VALID [2022-02-20 20:00:14,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,831 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {98025#true} {98026#false} #831#return; {98026#false} is VALID [2022-02-20 20:00:14,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,832 INFO L272 TraceCheckUtils]: 49: Hoare triple {98026#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {98025#true} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {98025#true} havoc ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {98025#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98025#true} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {98025#true} #res := ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,832 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {98025#true} {98026#false} #833#return; {98026#false} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {98026#false} assume 0 != eval1_~tmp___1~0#1; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {98026#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {98026#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {98026#false} assume 0 == ~p_dw_pc~0; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {98026#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {98026#false} assume { :end_inline_do_write_p } true; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {98026#false} assume !(0 == ~c_dr_st~0); {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,833 INFO L272 TraceCheckUtils]: 65: Hoare triple {98026#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {98025#true} is VALID [2022-02-20 20:00:14,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {98025#true} havoc ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {98025#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98025#true} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {98025#true} #res := ~__retres1~2; {98025#true} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {98025#true} assume true; {98025#true} is VALID [2022-02-20 20:00:14,834 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {98025#true} {98026#false} #833#return; {98026#false} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 71: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {98026#false} assume 0 != eval1_~tmp___1~0#1; {98026#false} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {98026#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {98026#false} is VALID [2022-02-20 20:00:14,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {98026#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 75: Hoare triple {98026#false} assume !(0 == ~p_dw_pc~0); {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 76: Hoare triple {98026#false} assume 1 == ~p_dw_pc~0; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {98026#false} assume !(0 == ~q_free~0); {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {98026#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {98026#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {98026#false} assume { :end_inline_do_write_p } true; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 84: Hoare triple {98026#false} assume !(0 == ~c_dr_pc~0); {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 85: Hoare triple {98026#false} assume 2 == ~c_dr_pc~0; {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 86: Hoare triple {98026#false} do_read_c_~a~0#1 := ~a_t~0; {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 87: Hoare triple {98026#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; {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 88: Hoare triple {98026#false} assume !(~p_last_write~0 == ~c_last_read~0); {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L272 TraceCheckUtils]: 89: Hoare triple {98026#false} call error1(); {98026#false} is VALID [2022-02-20 20:00:14,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {98026#false} assume !false; {98026#false} is VALID [2022-02-20 20:00:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:14,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:14,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285836551] [2022-02-20 20:00:14,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285836551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:14,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:14,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:14,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962220386] [2022-02-20 20:00:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:00:14,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:14,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:14,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:14,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:14,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:14,877 INFO L87 Difference]: Start difference. First operand 3942 states and 5523 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,102 INFO L93 Difference]: Finished difference Result 5119 states and 7074 transitions. [2022-02-20 20:00:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:00:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 509 transitions. [2022-02-20 20:00:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 509 transitions. [2022-02-20 20:00:19,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 509 transitions. [2022-02-20 20:00:19,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:20,109 INFO L225 Difference]: With dead ends: 5119 [2022-02-20 20:00:20,109 INFO L226 Difference]: Without dead ends: 4113 [2022-02-20 20:00:20,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:20,112 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 383 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:20,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 1305 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-02-20 20:00:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3982. [2022-02-20 20:00:21,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:21,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4113 states. Second operand has 3982 states, 3276 states have (on average 1.3934676434676434) internal successors, (4565), 3329 states have internal predecessors, (4565), 408 states have call successors, (408), 250 states have call predecessors, (408), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-02-20 20:00:21,785 INFO L74 IsIncluded]: Start isIncluded. First operand 4113 states. Second operand has 3982 states, 3276 states have (on average 1.3934676434676434) internal successors, (4565), 3329 states have internal predecessors, (4565), 408 states have call successors, (408), 250 states have call predecessors, (408), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-02-20 20:00:21,787 INFO L87 Difference]: Start difference. First operand 4113 states. Second operand has 3982 states, 3276 states have (on average 1.3934676434676434) internal successors, (4565), 3329 states have internal predecessors, (4565), 408 states have call successors, (408), 250 states have call predecessors, (408), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-02-20 20:00:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,260 INFO L93 Difference]: Finished difference Result 4113 states and 5737 transitions. [2022-02-20 20:00:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5737 transitions. [2022-02-20 20:00:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:22,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 3982 states, 3276 states have (on average 1.3934676434676434) internal successors, (4565), 3329 states have internal predecessors, (4565), 408 states have call successors, (408), 250 states have call predecessors, (408), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) Second operand 4113 states. [2022-02-20 20:00:22,273 INFO L87 Difference]: Start difference. First operand has 3982 states, 3276 states have (on average 1.3934676434676434) internal successors, (4565), 3329 states have internal predecessors, (4565), 408 states have call successors, (408), 250 states have call predecessors, (408), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) Second operand 4113 states.