./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:56,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:56,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:56,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:56,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:56,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:56,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:56,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:56,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:56,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:56,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:56,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:56,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:56,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:56,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:56,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:56,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:56,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:56,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:56,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:56,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:56,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:56,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:56,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:56,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:56,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:56,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:56,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:56,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:56,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:56,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:56,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:56,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:56,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:56,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:56,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:56,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:56,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:56,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:56,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:56,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:56,932 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:56,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:56,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:56,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:56,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:56,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:56,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:56,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:56,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:56,959 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:56,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:56,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:56,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:56,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:56,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:56,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:56,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:56,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:56,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:56,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:56,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:56,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:56,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:56,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:56,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:56,962 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:56,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:56,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:56,963 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 -> 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 [2022-02-20 19:59:57,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:57,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:57,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:57,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:57,197 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:57,198 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.05.cil-2.c [2022-02-20 19:59:57,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eba5f5f8/6a72fb5d275946d49f1431ac4938685a/FLAGcd65a0b0c [2022-02-20 19:59:57,650 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:57,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c [2022-02-20 19:59:57,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eba5f5f8/6a72fb5d275946d49f1431ac4938685a/FLAGcd65a0b0c [2022-02-20 19:59:58,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eba5f5f8/6a72fb5d275946d49f1431ac4938685a [2022-02-20 19:59:58,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:58,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:58,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:58,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:58,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:58,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@856718b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58, skipping insertion in model container [2022-02-20 19:59:58,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:58,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:58,232 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.05.cil-2.c[911,924] [2022-02-20 19:59:58,287 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.05.cil-2.c[8416,8429] [2022-02-20 19:59:58,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:58,367 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:58,376 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.05.cil-2.c[911,924] [2022-02-20 19:59:58,415 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.05.cil-2.c[8416,8429] [2022-02-20 19:59:58,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:58,454 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:58,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58 WrapperNode [2022-02-20 19:59:58,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:58,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:58,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:58,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:58,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,536 INFO L137 Inliner]: procedures = 65, calls = 77, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 677 [2022-02-20 19:59:58,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:58,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:58,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:58,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:58,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:58,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:58,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:58,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:58,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (1/1) ... [2022-02-20 19:59:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:58,616 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:58,619 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:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:58,647 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:58,647 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:58,647 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:58,647 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:58,648 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:58,648 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:58,648 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:58,770 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:58,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:59,315 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:59,315 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 19:59:59,360 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:59,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:59,370 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 19:59:59,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:59 BoogieIcfgContainer [2022-02-20 19:59:59,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:59,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:59,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:59,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:59,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:58" (1/3) ... [2022-02-20 19:59:59,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258f7b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:59, skipping insertion in model container [2022-02-20 19:59:59,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:58" (2/3) ... [2022-02-20 19:59:59,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258f7b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:59, skipping insertion in model container [2022-02-20 19:59:59,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:59" (3/3) ... [2022-02-20 19:59:59,378 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.05.cil-2.c [2022-02-20 19:59:59,382 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:59,382 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:59,412 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:59,417 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:59,418 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 277 states have (on average 1.6028880866425992) internal successors, (444), 285 states have internal predecessors, (444), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 19:59:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:59,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:59,459 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:59,459 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 481480506, now seen corresponding path program 1 times [2022-02-20 19:59:59,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:59,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270791263] [2022-02-20 19:59:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#(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); {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:59,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:59,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {337#(= ~q_read_ev~0 2)} #1190#return; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(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; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#(= |old(~q_read_ev~0)| 0)} assume true; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#(= |old(~q_read_ev~0)| 0)} {337#(= ~q_read_ev~0 2)} #1192#return; {336#false} is VALID [2022-02-20 19:59:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} havoc ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume 1 == ~p_dw_pc~0; {335#true} is VALID [2022-02-20 19:59:59,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {335#true} is VALID [2022-02-20 19:59:59,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} #res := ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,780 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {335#true} {335#true} #1186#return; {335#true} is VALID [2022-02-20 19:59:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} havoc ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume 1 == ~c_dr_pc~0; {335#true} is VALID [2022-02-20 19:59:59,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {335#true} is VALID [2022-02-20 19:59:59,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} #res := ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,786 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {335#true} {335#true} #1188#return; {335#true} is VALID [2022-02-20 19:59:59,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(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; {335#true} is VALID [2022-02-20 19:59:59,787 INFO L272 TraceCheckUtils]: 1: Hoare triple {335#true} call #t~ret8 := is_do_write_p_triggered(); {335#true} is VALID [2022-02-20 19:59:59,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} havoc ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} assume 1 == ~p_dw_pc~0; {335#true} is VALID [2022-02-20 19:59:59,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {335#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {335#true} is VALID [2022-02-20 19:59:59,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} #res := ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,793 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {335#true} {335#true} #1186#return; {335#true} is VALID [2022-02-20 19:59:59,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {335#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {335#true} is VALID [2022-02-20 19:59:59,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {335#true} is VALID [2022-02-20 19:59:59,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {335#true} call #t~ret9 := is_do_read_c_triggered(); {335#true} is VALID [2022-02-20 19:59:59,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#true} havoc ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#true} assume 1 == ~c_dr_pc~0; {335#true} is VALID [2022-02-20 19:59:59,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {335#true} is VALID [2022-02-20 19:59:59,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#true} #res := ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,795 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {335#true} {335#true} #1188#return; {335#true} is VALID [2022-02-20 19:59:59,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {335#true} is VALID [2022-02-20 19:59:59,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {335#true} is VALID [2022-02-20 19:59:59,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,798 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {335#true} {336#false} #1194#return; {336#false} is VALID [2022-02-20 19:59:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(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; {335#true} is VALID [2022-02-20 19:59:59,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume !(1 == ~q_write_ev~0); {335#true} is VALID [2022-02-20 19:59:59,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335#true} {336#false} #1196#return; {336#false} is VALID [2022-02-20 19:59:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} havoc ~__retres1~2; {335#true} is VALID [2022-02-20 19:59:59,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {335#true} is VALID [2022-02-20 19:59:59,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} #res := ~__retres1~2; {335#true} is VALID [2022-02-20 19:59:59,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,811 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {335#true} {336#false} #1198#return; {336#false} is VALID [2022-02-20 19:59:59,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {335#true} is VALID [2022-02-20 19:59:59,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {335#true} is VALID [2022-02-20 19:59:59,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#(= ~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; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {337#(= ~q_read_ev~0 2)} call update_channels1(); {375#(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:59,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(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); {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:59,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:59,815 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {376#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {337#(= ~q_read_ev~0 2)} #1190#return; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {337#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:59,818 INFO L272 TraceCheckUtils]: 12: Hoare triple {337#(= ~q_read_ev~0 2)} call fire_delta_events1(); {377#(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:59,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(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; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {378#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {378#(= |old(~q_read_ev~0)| 0)} assume true; {378#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:59,819 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {378#(= |old(~q_read_ev~0)| 0)} {337#(= ~q_read_ev~0 2)} #1192#return; {336#false} is VALID [2022-02-20 19:59:59,820 INFO L272 TraceCheckUtils]: 17: Hoare triple {336#false} call activate_threads1(); {379#(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:59,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {379#(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; {335#true} is VALID [2022-02-20 19:59:59,820 INFO L272 TraceCheckUtils]: 19: Hoare triple {335#true} call #t~ret8 := is_do_write_p_triggered(); {335#true} is VALID [2022-02-20 19:59:59,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {335#true} havoc ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {335#true} assume 1 == ~p_dw_pc~0; {335#true} is VALID [2022-02-20 19:59:59,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {335#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {335#true} is VALID [2022-02-20 19:59:59,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {335#true} #res := ~__retres1~0; {335#true} is VALID [2022-02-20 19:59:59,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,821 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {335#true} {335#true} #1186#return; {335#true} is VALID [2022-02-20 19:59:59,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {335#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {335#true} is VALID [2022-02-20 19:59:59,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {335#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {335#true} is VALID [2022-02-20 19:59:59,822 INFO L272 TraceCheckUtils]: 28: Hoare triple {335#true} call #t~ret9 := is_do_read_c_triggered(); {335#true} is VALID [2022-02-20 19:59:59,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {335#true} havoc ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {335#true} assume 1 == ~c_dr_pc~0; {335#true} is VALID [2022-02-20 19:59:59,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {335#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {335#true} is VALID [2022-02-20 19:59:59,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {335#true} #res := ~__retres1~1; {335#true} is VALID [2022-02-20 19:59:59,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,823 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {335#true} {335#true} #1188#return; {335#true} is VALID [2022-02-20 19:59:59,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {335#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {335#true} is VALID [2022-02-20 19:59:59,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {335#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {335#true} is VALID [2022-02-20 19:59:59,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,824 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {335#true} {336#false} #1194#return; {336#false} is VALID [2022-02-20 19:59:59,824 INFO L272 TraceCheckUtils]: 39: Hoare triple {336#false} call reset_delta_events1(); {377#(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:59,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {377#(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; {335#true} is VALID [2022-02-20 19:59:59,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {335#true} assume !(1 == ~q_write_ev~0); {335#true} is VALID [2022-02-20 19:59:59,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,825 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {335#true} {336#false} #1196#return; {336#false} is VALID [2022-02-20 19:59:59,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 19:59:59,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {336#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; {336#false} is VALID [2022-02-20 19:59:59,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 19:59:59,826 INFO L272 TraceCheckUtils]: 47: Hoare triple {336#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {335#true} is VALID [2022-02-20 19:59:59,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {335#true} havoc ~__retres1~2; {335#true} is VALID [2022-02-20 19:59:59,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {335#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {335#true} is VALID [2022-02-20 19:59:59,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {335#true} #res := ~__retres1~2; {335#true} is VALID [2022-02-20 19:59:59,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 19:59:59,827 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {335#true} {336#false} #1198#return; {336#false} is VALID [2022-02-20 19:59:59,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {336#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; {336#false} is VALID [2022-02-20 19:59:59,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {336#false} assume 0 != eval1_~tmp___1~0#1; {336#false} is VALID [2022-02-20 19:59:59,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {336#false} assume !(0 == ~p_dw_st~0); {336#false} is VALID [2022-02-20 19:59:59,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {336#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; {336#false} is VALID [2022-02-20 19:59:59,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {336#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; {336#false} is VALID [2022-02-20 19:59:59,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {336#false} assume !(0 == ~c_dr_pc~0); {336#false} is VALID [2022-02-20 19:59:59,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {336#false} assume 2 == ~c_dr_pc~0; {336#false} is VALID [2022-02-20 19:59:59,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {336#false} do_read_c_~a~0#1 := ~a_t~0; {336#false} is VALID [2022-02-20 19:59:59,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {336#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; {336#false} is VALID [2022-02-20 19:59:59,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {336#false} assume !(~p_last_write~0 == ~c_last_read~0); {336#false} is VALID [2022-02-20 19:59:59,829 INFO L272 TraceCheckUtils]: 63: Hoare triple {336#false} call error1(); {336#false} is VALID [2022-02-20 19:59:59,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 19:59:59,830 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,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:59,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270791263] [2022-02-20 19:59:59,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270791263] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:59,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:59,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:59,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933619558] [2022-02-20 19:59:59,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:59,837 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:59,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:59,840 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:59,894 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:59,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:59,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:59,911 INFO L87 Difference]: Start difference. First operand has 332 states, 277 states have (on average 1.6028880866425992) internal successors, (444), 285 states have internal predecessors, (444), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,534 INFO L93 Difference]: Finished difference Result 793 states and 1237 transitions. [2022-02-20 20:00:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:02,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1237 transitions. [2022-02-20 20:00:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1237 transitions. [2022-02-20 20:00:02,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1237 transitions. [2022-02-20 20:00:03,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1237 edges. 1237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:03,427 INFO L225 Difference]: With dead ends: 793 [2022-02-20 20:00:03,428 INFO L226 Difference]: Without dead ends: 472 [2022-02-20 20:00:03,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:03,436 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1089 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:03,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1096 Valid, 1421 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-20 20:00:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 433. [2022-02-20 20:00:03,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:03,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:03,508 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:03,510 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,533 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2022-02-20 20:00:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 692 transitions. [2022-02-20 20:00:03,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:03,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:03,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 472 states. [2022-02-20 20:00:03,546 INFO L87 Difference]: Start difference. First operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 472 states. [2022-02-20 20:00:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,565 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2022-02-20 20:00:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 692 transitions. [2022-02-20 20:00:03,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:03,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:03,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:03,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 359 states have (on average 1.49025069637883) internal successors, (535), 366 states have internal predecessors, (535), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 636 transitions. [2022-02-20 20:00:03,587 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 636 transitions. Word has length 65 [2022-02-20 20:00:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:03,587 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 636 transitions. [2022-02-20 20:00:03,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 636 transitions. [2022-02-20 20:00:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:03,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:03,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:03,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:03,591 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2134598150, now seen corresponding path program 1 times [2022-02-20 20:00:03,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:03,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934650088] [2022-02-20 20:00:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {3048#(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); {3049#(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:03,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {3049#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3049#(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:03,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3049#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3010#(= ~q_write_ev~0 ~q_read_ev~0)} #1190#return; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {3049#(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); {3050#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3010#(= ~q_write_ev~0 ~q_read_ev~0)} #1192#return; {3009#false} is VALID [2022-02-20 20:00:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#true} havoc ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3008#true} assume 1 == ~p_dw_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3008#true} is VALID [2022-02-20 20:00:03,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {3008#true} #res := ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,737 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3008#true} {3008#true} #1186#return; {3008#true} is VALID [2022-02-20 20:00:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#true} havoc ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {3008#true} assume 1 == ~c_dr_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3008#true} is VALID [2022-02-20 20:00:03,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {3008#true} #res := ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,743 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3008#true} {3008#true} #1188#return; {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3052#(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; {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L272 TraceCheckUtils]: 1: Hoare triple {3008#true} call #t~ret8 := is_do_write_p_triggered(); {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} havoc ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {3008#true} assume 1 == ~p_dw_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {3008#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3008#true} is VALID [2022-02-20 20:00:03,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {3008#true} #res := ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3008#true} {3008#true} #1186#return; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {3008#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {3008#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L272 TraceCheckUtils]: 10: Hoare triple {3008#true} call #t~ret9 := is_do_read_c_triggered(); {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {3008#true} havoc ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {3008#true} assume 1 == ~c_dr_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {3008#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {3008#true} #res := ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3008#true} {3008#true} #1188#return; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {3008#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3008#true} is VALID [2022-02-20 20:00:03,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {3008#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3008#true} is VALID [2022-02-20 20:00:03,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,747 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3008#true} {3009#false} #1194#return; {3009#false} is VALID [2022-02-20 20:00:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {3049#(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); {3008#true} is VALID [2022-02-20 20:00:03,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {3008#true} assume !(1 == ~q_write_ev~0); {3008#true} is VALID [2022-02-20 20:00:03,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3008#true} {3009#false} #1196#return; {3009#false} is VALID [2022-02-20 20:00:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#true} havoc ~__retres1~2; {3008#true} is VALID [2022-02-20 20:00:03,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3008#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3008#true} is VALID [2022-02-20 20:00:03,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} #res := ~__retres1~2; {3008#true} is VALID [2022-02-20 20:00:03,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,760 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3008#true} {3009#false} #1198#return; {3009#false} is VALID [2022-02-20 20:00:03,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {3008#true} is VALID [2022-02-20 20:00:03,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3008#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {3008#true} is VALID [2022-02-20 20:00:03,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3008#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3048#(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:03,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {3048#(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); {3049#(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:03,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3049#(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:03,763 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3049#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3010#(= ~q_write_ev~0 ~q_read_ev~0)} #1190#return; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3010#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:03,765 INFO L272 TraceCheckUtils]: 12: Hoare triple {3010#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3049#(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:03,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {3049#(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); {3050#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {3050#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:03,768 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3051#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3010#(= ~q_write_ev~0 ~q_read_ev~0)} #1192#return; {3009#false} is VALID [2022-02-20 20:00:03,768 INFO L272 TraceCheckUtils]: 17: Hoare triple {3009#false} call activate_threads1(); {3052#(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:03,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {3052#(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; {3008#true} is VALID [2022-02-20 20:00:03,768 INFO L272 TraceCheckUtils]: 19: Hoare triple {3008#true} call #t~ret8 := is_do_write_p_triggered(); {3008#true} is VALID [2022-02-20 20:00:03,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {3008#true} havoc ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {3008#true} assume 1 == ~p_dw_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {3008#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3008#true} is VALID [2022-02-20 20:00:03,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {3008#true} #res := ~__retres1~0; {3008#true} is VALID [2022-02-20 20:00:03,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3008#true} {3008#true} #1186#return; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {3008#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {3008#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L272 TraceCheckUtils]: 28: Hoare triple {3008#true} call #t~ret9 := is_do_read_c_triggered(); {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {3008#true} havoc ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {3008#true} assume 1 == ~c_dr_pc~0; {3008#true} is VALID [2022-02-20 20:00:03,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {3008#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3008#true} is VALID [2022-02-20 20:00:03,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {3008#true} #res := ~__retres1~1; {3008#true} is VALID [2022-02-20 20:00:03,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,773 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3008#true} {3008#true} #1188#return; {3008#true} is VALID [2022-02-20 20:00:03,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {3008#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3008#true} is VALID [2022-02-20 20:00:03,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {3008#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3008#true} is VALID [2022-02-20 20:00:03,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,774 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3008#true} {3009#false} #1194#return; {3009#false} is VALID [2022-02-20 20:00:03,775 INFO L272 TraceCheckUtils]: 39: Hoare triple {3009#false} call reset_delta_events1(); {3049#(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:03,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {3049#(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); {3008#true} is VALID [2022-02-20 20:00:03,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {3008#true} assume !(1 == ~q_write_ev~0); {3008#true} is VALID [2022-02-20 20:00:03,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,776 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3008#true} {3009#false} #1196#return; {3009#false} is VALID [2022-02-20 20:00:03,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {3009#false} assume !false; {3009#false} is VALID [2022-02-20 20:00:03,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {3009#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; {3009#false} is VALID [2022-02-20 20:00:03,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {3009#false} assume !false; {3009#false} is VALID [2022-02-20 20:00:03,776 INFO L272 TraceCheckUtils]: 47: Hoare triple {3009#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3008#true} is VALID [2022-02-20 20:00:03,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {3008#true} havoc ~__retres1~2; {3008#true} is VALID [2022-02-20 20:00:03,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {3008#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3008#true} is VALID [2022-02-20 20:00:03,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#true} #res := ~__retres1~2; {3008#true} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {3008#true} assume true; {3008#true} is VALID [2022-02-20 20:00:03,779 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3008#true} {3009#false} #1198#return; {3009#false} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {3009#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; {3009#false} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {3009#false} assume 0 != eval1_~tmp___1~0#1; {3009#false} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {3009#false} assume !(0 == ~p_dw_st~0); {3009#false} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {3009#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; {3009#false} is VALID [2022-02-20 20:00:03,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {3009#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; {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {3009#false} assume !(0 == ~c_dr_pc~0); {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {3009#false} assume 2 == ~c_dr_pc~0; {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {3009#false} do_read_c_~a~0#1 := ~a_t~0; {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {3009#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; {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {3009#false} assume !(~p_last_write~0 == ~c_last_read~0); {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L272 TraceCheckUtils]: 63: Hoare triple {3009#false} call error1(); {3009#false} is VALID [2022-02-20 20:00:03,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {3009#false} assume !false; {3009#false} is VALID [2022-02-20 20:00:03,781 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,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:03,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934650088] [2022-02-20 20:00:03,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934650088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:03,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:03,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:03,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393837282] [2022-02-20 20:00:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:03,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:03,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:03,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:03,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:03,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:03,825 INFO L87 Difference]: Start difference. First operand 433 states and 636 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,666 INFO L93 Difference]: Finished difference Result 830 states and 1202 transitions. [2022-02-20 20:00:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 878 transitions. [2022-02-20 20:00:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 878 transitions. [2022-02-20 20:00:06,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 878 transitions. [2022-02-20 20:00:07,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 878 edges. 878 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:07,352 INFO L225 Difference]: With dead ends: 830 [2022-02-20 20:00:07,353 INFO L226 Difference]: Without dead ends: 621 [2022-02-20 20:00:07,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:07,356 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 1163 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:07,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1536 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-02-20 20:00:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 545. [2022-02-20 20:00:07,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:07,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:07,385 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:07,388 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,430 INFO L93 Difference]: Finished difference Result 621 states and 910 transitions. [2022-02-20 20:00:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 910 transitions. [2022-02-20 20:00:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 621 states. [2022-02-20 20:00:07,438 INFO L87 Difference]: Start difference. First operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 621 states. [2022-02-20 20:00:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,459 INFO L93 Difference]: Finished difference Result 621 states and 910 transitions. [2022-02-20 20:00:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 910 transitions. [2022-02-20 20:00:07,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:07,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 449 states have (on average 1.4721603563474388) internal successors, (661), 458 states have internal predecessors, (661), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 796 transitions. [2022-02-20 20:00:07,480 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 796 transitions. Word has length 65 [2022-02-20 20:00:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:07,482 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 796 transitions. [2022-02-20 20:00:07,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 796 transitions. [2022-02-20 20:00:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:07,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:07,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:07,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:07,484 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 131783036, now seen corresponding path program 1 times [2022-02-20 20:00:07,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:07,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362230799] [2022-02-20 20:00:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {6227#(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); {6228#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:07,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {6228#(not (= |old(~q_req_up~0)| 1))} assume true; {6228#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:07,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6228#(not (= |old(~q_req_up~0)| 1))} {6188#(= ~q_req_up~0 ~p_dw_pc~0)} #1190#return; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {6229#(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); {6185#true} is VALID [2022-02-20 20:00:07,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume !(0 == ~q_write_ev~0); {6185#true} is VALID [2022-02-20 20:00:07,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6185#true} {6192#(not (= ~p_dw_pc~0 1))} #1192#return; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#true} havoc ~__retres1~0; {6185#true} is VALID [2022-02-20 20:00:07,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume 1 == ~p_dw_pc~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,638 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} {6185#true} #1186#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#true} havoc ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume 1 == ~c_dr_pc~0; {6185#true} is VALID [2022-02-20 20:00:07,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {6185#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6185#true} is VALID [2022-02-20 20:00:07,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {6185#true} #res := ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,653 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6185#true} {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #1188#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {6230#(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; {6185#true} is VALID [2022-02-20 20:00:07,654 INFO L272 TraceCheckUtils]: 1: Hoare triple {6185#true} call #t~ret8 := is_do_write_p_triggered(); {6185#true} is VALID [2022-02-20 20:00:07,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {6185#true} havoc ~__retres1~0; {6185#true} is VALID [2022-02-20 20:00:07,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {6185#true} assume 1 == ~p_dw_pc~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,656 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} {6185#true} #1186#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,657 INFO L272 TraceCheckUtils]: 10: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6185#true} is VALID [2022-02-20 20:00:07,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {6185#true} havoc ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {6185#true} assume 1 == ~c_dr_pc~0; {6185#true} is VALID [2022-02-20 20:00:07,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {6185#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6185#true} is VALID [2022-02-20 20:00:07,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {6185#true} #res := ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6185#true} {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #1188#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,659 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} {6192#(not (= ~p_dw_pc~0 1))} #1194#return; {6186#false} is VALID [2022-02-20 20:00:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {6229#(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); {6185#true} is VALID [2022-02-20 20:00:07,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume !(1 == ~q_write_ev~0); {6185#true} is VALID [2022-02-20 20:00:07,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6185#true} {6186#false} #1196#return; {6186#false} is VALID [2022-02-20 20:00:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#true} havoc ~__retres1~2; {6185#true} is VALID [2022-02-20 20:00:07,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6185#true} is VALID [2022-02-20 20:00:07,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {6185#true} #res := ~__retres1~2; {6185#true} is VALID [2022-02-20 20:00:07,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,666 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6185#true} {6186#false} #1198#return; {6186#false} is VALID [2022-02-20 20:00:07,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {6187#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:07,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {6187#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {6187#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:07,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {6187#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {6188#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:07,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {6188#(= ~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; {6188#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:07,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {6227#(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:07,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {6227#(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); {6228#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:07,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {6228#(not (= |old(~q_req_up~0)| 1))} assume true; {6228#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:07,676 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6228#(not (= |old(~q_req_up~0)| 1))} {6188#(= ~q_req_up~0 ~p_dw_pc~0)} #1190#return; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {6229#(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:07,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {6229#(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); {6185#true} is VALID [2022-02-20 20:00:07,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {6185#true} assume !(0 == ~q_write_ev~0); {6185#true} is VALID [2022-02-20 20:00:07,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,678 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6185#true} {6192#(not (= ~p_dw_pc~0 1))} #1192#return; {6192#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:07,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {6192#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {6230#(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:07,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {6230#(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; {6185#true} is VALID [2022-02-20 20:00:07,679 INFO L272 TraceCheckUtils]: 19: Hoare triple {6185#true} call #t~ret8 := is_do_write_p_triggered(); {6185#true} is VALID [2022-02-20 20:00:07,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {6185#true} havoc ~__retres1~0; {6185#true} is VALID [2022-02-20 20:00:07,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {6185#true} assume 1 == ~p_dw_pc~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,681 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} {6185#true} #1186#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,681 INFO L272 TraceCheckUtils]: 28: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6185#true} is VALID [2022-02-20 20:00:07,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {6185#true} havoc ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {6185#true} assume 1 == ~c_dr_pc~0; {6185#true} is VALID [2022-02-20 20:00:07,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {6185#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6185#true} is VALID [2022-02-20 20:00:07,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {6185#true} #res := ~__retres1~1; {6185#true} is VALID [2022-02-20 20:00:07,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,683 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6185#true} {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} #1188#return; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:07,684 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6237#(= (+ (- 1) ~p_dw_pc~0) 0)} {6192#(not (= ~p_dw_pc~0 1))} #1194#return; {6186#false} is VALID [2022-02-20 20:00:07,684 INFO L272 TraceCheckUtils]: 39: Hoare triple {6186#false} call reset_delta_events1(); {6229#(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:07,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {6229#(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); {6185#true} is VALID [2022-02-20 20:00:07,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {6185#true} assume !(1 == ~q_write_ev~0); {6185#true} is VALID [2022-02-20 20:00:07,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6185#true} {6186#false} #1196#return; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {6186#false} assume !false; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {6186#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; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {6186#false} assume !false; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L272 TraceCheckUtils]: 47: Hoare triple {6186#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {6185#true} havoc ~__retres1~2; {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {6185#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {6185#true} #res := ~__retres1~2; {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {6185#true} assume true; {6185#true} is VALID [2022-02-20 20:00:07,685 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6185#true} {6186#false} #1198#return; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {6186#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; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {6186#false} assume 0 != eval1_~tmp___1~0#1; {6186#false} is VALID [2022-02-20 20:00:07,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {6186#false} assume !(0 == ~p_dw_st~0); {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {6186#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; {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {6186#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; {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {6186#false} assume !(0 == ~c_dr_pc~0); {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {6186#false} assume 2 == ~c_dr_pc~0; {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {6186#false} do_read_c_~a~0#1 := ~a_t~0; {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {6186#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; {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {6186#false} assume !(~p_last_write~0 == ~c_last_read~0); {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L272 TraceCheckUtils]: 63: Hoare triple {6186#false} call error1(); {6186#false} is VALID [2022-02-20 20:00:07,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {6186#false} assume !false; {6186#false} is VALID [2022-02-20 20:00:07,687 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:07,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:07,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362230799] [2022-02-20 20:00:07,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362230799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:07,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:07,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:07,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310489900] [2022-02-20 20:00:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:07,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:07,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:07,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:07,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:07,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:07,723 INFO L87 Difference]: Start difference. First operand 545 states and 796 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,240 INFO L93 Difference]: Finished difference Result 2091 states and 2994 transitions. [2022-02-20 20:00:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1283 transitions. [2022-02-20 20:00:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1283 transitions. [2022-02-20 20:00:13,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1283 transitions. [2022-02-20 20:00:14,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1283 edges. 1283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:14,354 INFO L225 Difference]: With dead ends: 2091 [2022-02-20 20:00:14,354 INFO L226 Difference]: Without dead ends: 1758 [2022-02-20 20:00:14,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:14,361 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 2685 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:14,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2707 Valid, 2344 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-02-20 20:00:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1598. [2022-02-20 20:00:14,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:14,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1758 states. Second operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:14,434 INFO L74 IsIncluded]: Start isIncluded. First operand 1758 states. Second operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:14,437 INFO L87 Difference]: Start difference. First operand 1758 states. Second operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,542 INFO L93 Difference]: Finished difference Result 1758 states and 2395 transitions. [2022-02-20 20:00:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2395 transitions. [2022-02-20 20:00:14,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:14,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:14,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) Second operand 1758 states. [2022-02-20 20:00:14,560 INFO L87 Difference]: Start difference. First operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) Second operand 1758 states. [2022-02-20 20:00:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,669 INFO L93 Difference]: Finished difference Result 1758 states and 2395 transitions. [2022-02-20 20:00:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2395 transitions. [2022-02-20 20:00:14,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:14,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:14,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:14,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1297 states have (on average 1.3916730917501927) internal successors, (1805), 1321 states have internal predecessors, (1805), 173 states have call successors, (173), 112 states have call predecessors, (173), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2183 transitions. [2022-02-20 20:00:14,796 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2183 transitions. Word has length 65 [2022-02-20 20:00:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:14,796 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 2183 transitions. [2022-02-20 20:00:14,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2183 transitions. [2022-02-20 20:00:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:14,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:14,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, 1] [2022-02-20 20:00:14,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:14,798 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 754147135, now seen corresponding path program 1 times [2022-02-20 20:00:14,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:14,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022503359] [2022-02-20 20:00:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {14845#(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); {14805#true} is VALID [2022-02-20 20:00:14,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14805#true} {14805#true} #1190#return; {14805#true} is VALID [2022-02-20 20:00:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {14846#(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); {14805#true} is VALID [2022-02-20 20:00:14,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume !(0 == ~q_write_ev~0); {14805#true} is VALID [2022-02-20 20:00:14,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14805#true} {14805#true} #1192#return; {14805#true} is VALID [2022-02-20 20:00:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {14805#true} havoc ~__retres1~0; {14805#true} is VALID [2022-02-20 20:00:14,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume !(1 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} assume !(2 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {14805#true} ~__retres1~0 := 0; {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:14,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,920 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14805#true} #1186#return; {14855#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {14805#true} havoc ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume 1 == ~c_dr_pc~0; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {14805#true} #res := ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14805#true} {14806#false} #1188#return; {14806#false} is VALID [2022-02-20 20:00:14,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {14847#(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; {14805#true} is VALID [2022-02-20 20:00:14,927 INFO L272 TraceCheckUtils]: 1: Hoare triple {14805#true} call #t~ret8 := is_do_write_p_triggered(); {14805#true} is VALID [2022-02-20 20:00:14,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} havoc ~__retres1~0; {14805#true} is VALID [2022-02-20 20:00:14,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {14805#true} assume !(1 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {14805#true} assume !(2 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {14805#true} ~__retres1~0 := 0; {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:14,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,929 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14805#true} #1186#return; {14855#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:14,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {14855#(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; {14856#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:14,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {14856#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14806#false} is VALID [2022-02-20 20:00:14,930 INFO L272 TraceCheckUtils]: 11: Hoare triple {14806#false} call #t~ret9 := is_do_read_c_triggered(); {14805#true} is VALID [2022-02-20 20:00:14,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {14805#true} havoc ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {14805#true} assume 1 == ~c_dr_pc~0; {14805#true} is VALID [2022-02-20 20:00:14,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {14805#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14805#true} is VALID [2022-02-20 20:00:14,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {14805#true} #res := ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,939 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14805#true} {14806#false} #1188#return; {14806#false} is VALID [2022-02-20 20:00:14,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {14806#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14806#false} is VALID [2022-02-20 20:00:14,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {14806#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14806#false} is VALID [2022-02-20 20:00:14,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {14806#false} assume true; {14806#false} is VALID [2022-02-20 20:00:14,940 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14806#false} {14805#true} #1194#return; {14806#false} is VALID [2022-02-20 20:00:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {14846#(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); {14805#true} is VALID [2022-02-20 20:00:14,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume !(1 == ~q_write_ev~0); {14805#true} is VALID [2022-02-20 20:00:14,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14805#true} {14806#false} #1196#return; {14806#false} is VALID [2022-02-20 20:00:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {14805#true} havoc ~__retres1~2; {14805#true} is VALID [2022-02-20 20:00:14,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14805#true} is VALID [2022-02-20 20:00:14,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} #res := ~__retres1~2; {14805#true} is VALID [2022-02-20 20:00:14,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,953 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14805#true} {14806#false} #1198#return; {14806#false} is VALID [2022-02-20 20:00:14,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {14805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {14805#true} is VALID [2022-02-20 20:00:14,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {14805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14805#true} is VALID [2022-02-20 20:00:14,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {14805#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {14805#true} is VALID [2022-02-20 20:00:14,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {14805#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; {14805#true} is VALID [2022-02-20 20:00:14,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {14805#true} call update_channels1(); {14845#(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,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {14845#(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); {14805#true} is VALID [2022-02-20 20:00:14,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14805#true} {14805#true} #1190#return; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {14805#true} assume { :begin_inline_init_threads1 } true; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {14805#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {14805#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {14805#true} assume { :end_inline_init_threads1 } true; {14805#true} is VALID [2022-02-20 20:00:14,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {14805#true} call fire_delta_events1(); {14846#(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,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {14846#(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); {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {14805#true} assume !(0 == ~q_write_ev~0); {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14805#true} {14805#true} #1192#return; {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {14805#true} call activate_threads1(); {14847#(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,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {14847#(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; {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {14805#true} call #t~ret8 := is_do_write_p_triggered(); {14805#true} is VALID [2022-02-20 20:00:14,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {14805#true} havoc ~__retres1~0; {14805#true} is VALID [2022-02-20 20:00:14,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {14805#true} assume !(1 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {14805#true} assume !(2 == ~p_dw_pc~0); {14805#true} is VALID [2022-02-20 20:00:14,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {14805#true} ~__retres1~0 := 0; {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:14,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {14863#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:14,959 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14864#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14805#true} #1186#return; {14855#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:14,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {14855#(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; {14856#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:14,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {14856#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14806#false} is VALID [2022-02-20 20:00:14,960 INFO L272 TraceCheckUtils]: 29: Hoare triple {14806#false} call #t~ret9 := is_do_read_c_triggered(); {14805#true} is VALID [2022-02-20 20:00:14,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {14805#true} havoc ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {14805#true} assume 1 == ~c_dr_pc~0; {14805#true} is VALID [2022-02-20 20:00:14,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {14805#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14805#true} is VALID [2022-02-20 20:00:14,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {14805#true} #res := ~__retres1~1; {14805#true} is VALID [2022-02-20 20:00:14,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,961 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14805#true} {14806#false} #1188#return; {14806#false} is VALID [2022-02-20 20:00:14,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {14806#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14806#false} is VALID [2022-02-20 20:00:14,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {14806#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14806#false} is VALID [2022-02-20 20:00:14,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {14806#false} assume true; {14806#false} is VALID [2022-02-20 20:00:14,961 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14806#false} {14805#true} #1194#return; {14806#false} is VALID [2022-02-20 20:00:14,961 INFO L272 TraceCheckUtils]: 40: Hoare triple {14806#false} call reset_delta_events1(); {14846#(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,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {14846#(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); {14805#true} is VALID [2022-02-20 20:00:14,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {14805#true} assume !(1 == ~q_write_ev~0); {14805#true} is VALID [2022-02-20 20:00:14,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,962 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14805#true} {14806#false} #1196#return; {14806#false} is VALID [2022-02-20 20:00:14,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {14806#false} assume !false; {14806#false} is VALID [2022-02-20 20:00:14,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {14806#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; {14806#false} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {14806#false} assume !false; {14806#false} is VALID [2022-02-20 20:00:14,963 INFO L272 TraceCheckUtils]: 48: Hoare triple {14806#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14805#true} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {14805#true} havoc ~__retres1~2; {14805#true} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {14805#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14805#true} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {14805#true} #res := ~__retres1~2; {14805#true} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {14805#true} assume true; {14805#true} is VALID [2022-02-20 20:00:14,963 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14805#true} {14806#false} #1198#return; {14806#false} is VALID [2022-02-20 20:00:14,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {14806#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; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {14806#false} assume 0 != eval1_~tmp___1~0#1; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {14806#false} assume !(0 == ~p_dw_st~0); {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {14806#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; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {14806#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; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {14806#false} assume !(0 == ~c_dr_pc~0); {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {14806#false} assume 2 == ~c_dr_pc~0; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {14806#false} do_read_c_~a~0#1 := ~a_t~0; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {14806#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; {14806#false} is VALID [2022-02-20 20:00:14,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {14806#false} assume !(~p_last_write~0 == ~c_last_read~0); {14806#false} is VALID [2022-02-20 20:00:14,965 INFO L272 TraceCheckUtils]: 64: Hoare triple {14806#false} call error1(); {14806#false} is VALID [2022-02-20 20:00:14,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {14806#false} assume !false; {14806#false} is VALID [2022-02-20 20:00:14,965 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:14,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:14,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022503359] [2022-02-20 20:00:14,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022503359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:14,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:14,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:14,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131967977] [2022-02-20 20:00:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:14,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:14,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:15,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:15,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:15,002 INFO L87 Difference]: Start difference. First operand 1598 states and 2183 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:18,212 INFO L93 Difference]: Finished difference Result 3126 states and 4262 transitions. [2022-02-20 20:00:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 659 transitions. [2022-02-20 20:00:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 659 transitions. [2022-02-20 20:00:18,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 659 transitions. [2022-02-20 20:00:18,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:18,813 INFO L225 Difference]: With dead ends: 3126 [2022-02-20 20:00:18,813 INFO L226 Difference]: Without dead ends: 1746 [2022-02-20 20:00:18,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:00:18,820 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 576 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:18,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 1903 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-02-20 20:00:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1638. [2022-02-20 20:00:18,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:18,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1746 states. Second operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:18,893 INFO L74 IsIncluded]: Start isIncluded. First operand 1746 states. Second operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:18,901 INFO L87 Difference]: Start difference. First operand 1746 states. Second operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,003 INFO L93 Difference]: Finished difference Result 1746 states and 2371 transitions. [2022-02-20 20:00:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2371 transitions. [2022-02-20 20:00:19,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) Second operand 1746 states. [2022-02-20 20:00:19,014 INFO L87 Difference]: Start difference. First operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) Second operand 1746 states. [2022-02-20 20:00:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,117 INFO L93 Difference]: Finished difference Result 1746 states and 2371 transitions. [2022-02-20 20:00:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2371 transitions. [2022-02-20 20:00:19,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:19,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1329 states have (on average 1.3777276147479307) internal successors, (1831), 1353 states have internal predecessors, (1831), 173 states have call successors, (173), 112 states have call predecessors, (173), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2217 transitions. [2022-02-20 20:00:19,249 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2217 transitions. Word has length 66 [2022-02-20 20:00:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:19,249 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2217 transitions. [2022-02-20 20:00:19,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2217 transitions. [2022-02-20 20:00:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:19,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:19,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:19,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:19,251 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -275212163, now seen corresponding path program 1 times [2022-02-20 20:00:19,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:19,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421098288] [2022-02-20 20:00:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {24819#(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); {24820#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:19,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {24820#(not (= |old(~q_req_up~0)| 1))} assume true; {24820#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:19,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24820#(not (= |old(~q_req_up~0)| 1))} {24779#(= ~c_dr_pc~0 ~q_req_up~0)} #1190#return; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {24821#(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); {24776#true} is VALID [2022-02-20 20:00:19,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {24776#true} assume !(0 == ~q_write_ev~0); {24776#true} is VALID [2022-02-20 20:00:19,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24776#true} {24783#(not (= ~c_dr_pc~0 1))} #1192#return; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {24776#true} havoc ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {24776#true} assume !(1 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {24776#true} assume !(2 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {24776#true} ~__retres1~0 := 0; {24776#true} is VALID [2022-02-20 20:00:19,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {24776#true} #res := ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,342 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24776#true} {24776#true} #1186#return; {24776#true} is VALID [2022-02-20 20:00:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {24776#true} havoc ~__retres1~1; {24776#true} is VALID [2022-02-20 20:00:19,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {24776#true} assume 1 == ~c_dr_pc~0; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,351 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} {24776#true} #1188#return; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {24822#(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; {24776#true} is VALID [2022-02-20 20:00:19,351 INFO L272 TraceCheckUtils]: 1: Hoare triple {24776#true} call #t~ret8 := is_do_write_p_triggered(); {24776#true} is VALID [2022-02-20 20:00:19,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {24776#true} havoc ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {24776#true} assume !(1 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {24776#true} assume !(2 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {24776#true} ~__retres1~0 := 0; {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {24776#true} #res := ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {24776#true} {24776#true} #1186#return; {24776#true} is VALID [2022-02-20 20:00:19,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {24776#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24776#true} is VALID [2022-02-20 20:00:19,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {24776#true} assume !(0 != ~tmp~1); {24776#true} is VALID [2022-02-20 20:00:19,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {24776#true} call #t~ret9 := is_do_read_c_triggered(); {24776#true} is VALID [2022-02-20 20:00:19,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {24776#true} havoc ~__retres1~1; {24776#true} is VALID [2022-02-20 20:00:19,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {24776#true} assume 1 == ~c_dr_pc~0; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} {24776#true} #1188#return; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,356 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} {24783#(not (= ~c_dr_pc~0 1))} #1194#return; {24777#false} is VALID [2022-02-20 20:00:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {24821#(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); {24776#true} is VALID [2022-02-20 20:00:19,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {24776#true} assume !(1 == ~q_write_ev~0); {24776#true} is VALID [2022-02-20 20:00:19,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24776#true} {24777#false} #1196#return; {24777#false} is VALID [2022-02-20 20:00:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {24776#true} havoc ~__retres1~2; {24776#true} is VALID [2022-02-20 20:00:19,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {24776#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24776#true} is VALID [2022-02-20 20:00:19,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {24776#true} #res := ~__retres1~2; {24776#true} is VALID [2022-02-20 20:00:19,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,365 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24776#true} {24777#false} #1198#return; {24777#false} is VALID [2022-02-20 20:00:19,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {24776#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {24778#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:19,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {24778#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {24778#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:19,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {24778#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {24779#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:19,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {24779#(= ~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; {24779#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:19,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {24819#(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:19,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {24819#(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); {24820#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:19,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {24820#(not (= |old(~q_req_up~0)| 1))} assume true; {24820#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:19,370 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24820#(not (= |old(~q_req_up~0)| 1))} {24779#(= ~c_dr_pc~0 ~q_req_up~0)} #1190#return; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,371 INFO L272 TraceCheckUtils]: 12: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {24821#(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:19,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {24821#(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); {24776#true} is VALID [2022-02-20 20:00:19,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {24776#true} assume !(0 == ~q_write_ev~0); {24776#true} is VALID [2022-02-20 20:00:19,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,372 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {24776#true} {24783#(not (= ~c_dr_pc~0 1))} #1192#return; {24783#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:19,372 INFO L272 TraceCheckUtils]: 17: Hoare triple {24783#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {24822#(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:19,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {24822#(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; {24776#true} is VALID [2022-02-20 20:00:19,372 INFO L272 TraceCheckUtils]: 19: Hoare triple {24776#true} call #t~ret8 := is_do_write_p_triggered(); {24776#true} is VALID [2022-02-20 20:00:19,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {24776#true} havoc ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {24776#true} assume !(1 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {24776#true} assume !(2 == ~p_dw_pc~0); {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {24776#true} ~__retres1~0 := 0; {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {24776#true} #res := ~__retres1~0; {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24776#true} {24776#true} #1186#return; {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {24776#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {24776#true} assume !(0 != ~tmp~1); {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L272 TraceCheckUtils]: 29: Hoare triple {24776#true} call #t~ret9 := is_do_read_c_triggered(); {24776#true} is VALID [2022-02-20 20:00:19,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {24776#true} havoc ~__retres1~1; {24776#true} is VALID [2022-02-20 20:00:19,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {24776#true} assume 1 == ~c_dr_pc~0; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,375 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} {24776#true} #1188#return; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:19,376 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24836#(= (+ (- 1) ~c_dr_pc~0) 0)} {24783#(not (= ~c_dr_pc~0 1))} #1194#return; {24777#false} is VALID [2022-02-20 20:00:19,376 INFO L272 TraceCheckUtils]: 40: Hoare triple {24777#false} call reset_delta_events1(); {24821#(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:19,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {24821#(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); {24776#true} is VALID [2022-02-20 20:00:19,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {24776#true} assume !(1 == ~q_write_ev~0); {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {24776#true} {24777#false} #1196#return; {24777#false} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {24777#false} assume !false; {24777#false} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {24777#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; {24777#false} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {24777#false} assume !false; {24777#false} is VALID [2022-02-20 20:00:19,377 INFO L272 TraceCheckUtils]: 48: Hoare triple {24777#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {24776#true} havoc ~__retres1~2; {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {24776#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {24776#true} #res := ~__retres1~2; {24776#true} is VALID [2022-02-20 20:00:19,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {24776#true} assume true; {24776#true} is VALID [2022-02-20 20:00:19,378 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24776#true} {24777#false} #1198#return; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {24777#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; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {24777#false} assume 0 != eval1_~tmp___1~0#1; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {24777#false} assume !(0 == ~p_dw_st~0); {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {24777#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; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {24777#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; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {24777#false} assume !(0 == ~c_dr_pc~0); {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {24777#false} assume 2 == ~c_dr_pc~0; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {24777#false} do_read_c_~a~0#1 := ~a_t~0; {24777#false} is VALID [2022-02-20 20:00:19,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {24777#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; {24777#false} is VALID [2022-02-20 20:00:19,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {24777#false} assume !(~p_last_write~0 == ~c_last_read~0); {24777#false} is VALID [2022-02-20 20:00:19,379 INFO L272 TraceCheckUtils]: 64: Hoare triple {24777#false} call error1(); {24777#false} is VALID [2022-02-20 20:00:19,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {24777#false} assume !false; {24777#false} is VALID [2022-02-20 20:00:19,379 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:19,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:19,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421098288] [2022-02-20 20:00:19,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421098288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:19,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:19,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:19,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546359058] [2022-02-20 20:00:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:19,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:19,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:19,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:19,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:19,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:19,425 INFO L87 Difference]: Start difference. First operand 1638 states and 2217 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:25,763 INFO L93 Difference]: Finished difference Result 5210 states and 7091 transitions. [2022-02-20 20:00:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2022-02-20 20:00:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2022-02-20 20:00:25,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1272 transitions. [2022-02-20 20:00:26,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1272 edges. 1272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:26,881 INFO L225 Difference]: With dead ends: 5210 [2022-02-20 20:00:26,881 INFO L226 Difference]: Without dead ends: 2029 [2022-02-20 20:00:26,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:26,887 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 3126 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3148 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:26,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3148 Valid, 2064 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 20:00:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-02-20 20:00:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1849. [2022-02-20 20:00:26,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:26,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2029 states. Second operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:26,972 INFO L74 IsIncluded]: Start isIncluded. First operand 2029 states. Second operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:26,973 INFO L87 Difference]: Start difference. First operand 2029 states. Second operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,096 INFO L93 Difference]: Finished difference Result 2029 states and 2660 transitions. [2022-02-20 20:00:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2660 transitions. [2022-02-20 20:00:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) Second operand 2029 states. [2022-02-20 20:00:27,104 INFO L87 Difference]: Start difference. First operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) Second operand 2029 states. [2022-02-20 20:00:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,233 INFO L93 Difference]: Finished difference Result 2029 states and 2660 transitions. [2022-02-20 20:00:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2660 transitions. [2022-02-20 20:00:27,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:27,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1468 states have (on average 1.3331062670299727) internal successors, (1957), 1494 states have internal predecessors, (1957), 213 states have call successors, (213), 140 states have call predecessors, (213), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2429 transitions. [2022-02-20 20:00:27,399 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2429 transitions. Word has length 66 [2022-02-20 20:00:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:27,399 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2429 transitions. [2022-02-20 20:00:27,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2429 transitions. [2022-02-20 20:00:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:27,401 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:27,402 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:27,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:27,402 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 443189305, now seen corresponding path program 1 times [2022-02-20 20:00:27,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:27,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150405713] [2022-02-20 20:00:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {38518#(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); {38472#true} is VALID [2022-02-20 20:00:27,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38472#true} {38472#true} #1190#return; {38472#true} is VALID [2022-02-20 20:00:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {38519#(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); {38472#true} is VALID [2022-02-20 20:00:27,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume !(0 == ~q_write_ev~0); {38472#true} is VALID [2022-02-20 20:00:27,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38472#true} {38472#true} #1192#return; {38472#true} is VALID [2022-02-20 20:00:27,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {38472#true} havoc ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume !(1 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} assume !(2 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#true} ~__retres1~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {38472#true} #res := ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38472#true} {38472#true} #1186#return; {38472#true} is VALID [2022-02-20 20:00:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {38472#true} havoc ~__retres1~1; {38472#true} is VALID [2022-02-20 20:00:27,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume !(1 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} assume !(2 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#true} ~__retres1~1 := 0; {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:27,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,527 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38472#true} #1188#return; {38535#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:27,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {38520#(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; {38472#true} is VALID [2022-02-20 20:00:27,527 INFO L272 TraceCheckUtils]: 1: Hoare triple {38472#true} call #t~ret8 := is_do_write_p_triggered(); {38472#true} is VALID [2022-02-20 20:00:27,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} havoc ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#true} assume !(1 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {38472#true} assume !(2 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {38472#true} ~__retres1~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {38472#true} #res := ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {38472#true} {38472#true} #1186#return; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {38472#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {38472#true} assume !(0 != ~tmp~1); {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {38472#true} call #t~ret9 := is_do_read_c_triggered(); {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {38472#true} havoc ~__retres1~1; {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {38472#true} assume !(1 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {38472#true} assume !(2 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {38472#true} ~__retres1~1 := 0; {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:27,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,530 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38472#true} #1188#return; {38535#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:27,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {38535#(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; {38536#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:27,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {38536#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38473#false} is VALID [2022-02-20 20:00:27,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {38473#false} assume true; {38473#false} is VALID [2022-02-20 20:00:27,531 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38473#false} {38472#true} #1194#return; {38473#false} is VALID [2022-02-20 20:00:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {38519#(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); {38472#true} is VALID [2022-02-20 20:00:27,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume !(1 == ~q_write_ev~0); {38472#true} is VALID [2022-02-20 20:00:27,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38472#true} {38473#false} #1196#return; {38473#false} is VALID [2022-02-20 20:00:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {38472#true} havoc ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38472#true} is VALID [2022-02-20 20:00:27,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} #res := ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,540 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38472#true} {38473#false} #1198#return; {38473#false} is VALID [2022-02-20 20:00:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {38472#true} havoc ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} #res := ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38472#true} {38473#false} #1198#return; {38473#false} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {38472#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {38472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {38472#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {38472#true} is VALID [2022-02-20 20:00:27,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {38472#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; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {38472#true} call update_channels1(); {38518#(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:27,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {38518#(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); {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38472#true} {38472#true} #1190#return; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {38472#true} assume { :begin_inline_init_threads1 } true; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {38472#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {38472#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {38472#true} assume { :end_inline_init_threads1 } true; {38472#true} is VALID [2022-02-20 20:00:27,546 INFO L272 TraceCheckUtils]: 12: Hoare triple {38472#true} call fire_delta_events1(); {38519#(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:27,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {38519#(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); {38472#true} is VALID [2022-02-20 20:00:27,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {38472#true} assume !(0 == ~q_write_ev~0); {38472#true} is VALID [2022-02-20 20:00:27,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,546 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38472#true} {38472#true} #1192#return; {38472#true} is VALID [2022-02-20 20:00:27,546 INFO L272 TraceCheckUtils]: 17: Hoare triple {38472#true} call activate_threads1(); {38520#(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:27,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {38520#(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; {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L272 TraceCheckUtils]: 19: Hoare triple {38472#true} call #t~ret8 := is_do_write_p_triggered(); {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {38472#true} havoc ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {38472#true} assume !(1 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {38472#true} assume !(2 == ~p_dw_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {38472#true} ~__retres1~0 := 0; {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {38472#true} #res := ~__retres1~0; {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,547 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38472#true} {38472#true} #1186#return; {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {38472#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {38472#true} assume !(0 != ~tmp~1); {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L272 TraceCheckUtils]: 29: Hoare triple {38472#true} call #t~ret9 := is_do_read_c_triggered(); {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {38472#true} havoc ~__retres1~1; {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {38472#true} assume !(1 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {38472#true} assume !(2 == ~c_dr_pc~0); {38472#true} is VALID [2022-02-20 20:00:27,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {38472#true} ~__retres1~1 := 0; {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:27,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {38537#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:27,549 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38538#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38472#true} #1188#return; {38535#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:27,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {38535#(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; {38536#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:27,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {38536#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38473#false} is VALID [2022-02-20 20:00:27,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {38473#false} assume true; {38473#false} is VALID [2022-02-20 20:00:27,550 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38473#false} {38472#true} #1194#return; {38473#false} is VALID [2022-02-20 20:00:27,550 INFO L272 TraceCheckUtils]: 41: Hoare triple {38473#false} call reset_delta_events1(); {38519#(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:27,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {38519#(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); {38472#true} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {38472#true} assume !(1 == ~q_write_ev~0); {38472#true} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,551 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {38472#true} {38473#false} #1196#return; {38473#false} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,551 INFO L272 TraceCheckUtils]: 49: Hoare triple {38473#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38472#true} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {38472#true} havoc ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {38472#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38472#true} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {38472#true} #res := ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,552 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {38472#true} {38473#false} #1198#return; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {38473#false} assume 0 != eval1_~tmp___1~0#1; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {38473#false} assume 0 == ~p_dw_pc~0; {38473#false} is VALID [2022-02-20 20:00:27,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {38473#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {38473#false} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {38473#false} assume { :end_inline_do_write_p } true; {38473#false} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {38473#false} assume !(0 == ~c_dr_st~0); {38473#false} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 64: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,553 INFO L272 TraceCheckUtils]: 65: Hoare triple {38473#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38472#true} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {38472#true} havoc ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {38472#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38472#true} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {38472#true} #res := ~__retres1~2; {38472#true} is VALID [2022-02-20 20:00:27,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {38472#true} assume true; {38472#true} is VALID [2022-02-20 20:00:27,554 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {38472#true} {38473#false} #1198#return; {38473#false} is VALID [2022-02-20 20:00:27,555 INFO L290 TraceCheckUtils]: 71: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {38473#false} assume 0 != eval1_~tmp___1~0#1; {38473#false} is VALID [2022-02-20 20:00:27,555 INFO L290 TraceCheckUtils]: 73: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {38473#false} assume !(0 == ~p_dw_pc~0); {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {38473#false} assume 1 == ~p_dw_pc~0; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 77: Hoare triple {38473#false} assume !(0 == ~q_free~0); {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 78: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 79: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 80: Hoare triple {38473#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 81: Hoare triple {38473#false} assume { :end_inline_do_write_p } true; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 84: Hoare triple {38473#false} assume !(0 == ~c_dr_pc~0); {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 85: Hoare triple {38473#false} assume 2 == ~c_dr_pc~0; {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {38473#false} do_read_c_~a~0#1 := ~a_t~0; {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 87: Hoare triple {38473#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; {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 88: Hoare triple {38473#false} assume !(~p_last_write~0 == ~c_last_read~0); {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L272 TraceCheckUtils]: 89: Hoare triple {38473#false} call error1(); {38473#false} is VALID [2022-02-20 20:00:27,557 INFO L290 TraceCheckUtils]: 90: Hoare triple {38473#false} assume !false; {38473#false} is VALID [2022-02-20 20:00:27,558 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:27,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:27,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150405713] [2022-02-20 20:00:27,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150405713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:27,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:27,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:27,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008517983] [2022-02-20 20:00:27,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:27,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:00:27,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:27,565 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:27,603 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:27,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:27,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:27,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:27,604 INFO L87 Difference]: Start difference. First operand 1849 states and 2429 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:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:30,671 INFO L93 Difference]: Finished difference Result 3674 states and 4831 transitions. [2022-02-20 20:00:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:30,671 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:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:30,671 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:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 644 transitions. [2022-02-20 20:00:30,676 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:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 644 transitions. [2022-02-20 20:00:30,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 644 transitions. [2022-02-20 20:00:31,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:31,267 INFO L225 Difference]: With dead ends: 3674 [2022-02-20 20:00:31,267 INFO L226 Difference]: Without dead ends: 2043 [2022-02-20 20:00:31,269 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:31,270 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 381 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:31,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 2067 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2022-02-20 20:00:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1909. [2022-02-20 20:00:31,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:31,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2043 states. Second operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:31,370 INFO L74 IsIncluded]: Start isIncluded. First operand 2043 states. Second operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:31,372 INFO L87 Difference]: Start difference. First operand 2043 states. Second operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:31,522 INFO L93 Difference]: Finished difference Result 2043 states and 2672 transitions. [2022-02-20 20:00:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2672 transitions. [2022-02-20 20:00:31,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:31,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:31,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2043 states. [2022-02-20 20:00:31,531 INFO L87 Difference]: Start difference. First operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2043 states. [2022-02-20 20:00:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:31,660 INFO L93 Difference]: Finished difference Result 2043 states and 2672 transitions. [2022-02-20 20:00:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2672 transitions. [2022-02-20 20:00:31,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:31,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:31,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:31,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1516 states have (on average 1.3186015831134565) internal successors, (1999), 1542 states have internal predecessors, (1999), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2483 transitions. [2022-02-20 20:00:31,844 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2483 transitions. Word has length 91 [2022-02-20 20:00:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:31,844 INFO L470 AbstractCegarLoop]: Abstraction has 1909 states and 2483 transitions. [2022-02-20 20:00:31,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2483 transitions. [2022-02-20 20:00:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:31,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:31,851 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:31,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:31,851 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 887089979, now seen corresponding path program 1 times [2022-02-20 20:00:31,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:31,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254696793] [2022-02-20 20:00:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {50183#(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); {50136#true} is VALID [2022-02-20 20:00:31,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50136#true} {50136#true} #1190#return; {50136#true} is VALID [2022-02-20 20:00:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {50184#(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); {50136#true} is VALID [2022-02-20 20:00:31,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume !(0 == ~q_write_ev~0); {50136#true} is VALID [2022-02-20 20:00:31,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1192#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {50136#true} havoc ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume !(1 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} assume !(2 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#true} ~__retres1~0 := 0; {50136#true} is VALID [2022-02-20 20:00:31,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {50136#true} #res := ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,929 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1186#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {50136#true} havoc ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume !(1 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} assume !(2 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#true} ~__retres1~1 := 0; {50136#true} is VALID [2022-02-20 20:00:31,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {50136#true} #res := ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,932 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1188#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {50185#(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; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,933 INFO L272 TraceCheckUtils]: 1: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} havoc ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#true} assume !(1 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {50136#true} assume !(2 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {50136#true} ~__retres1~0 := 0; {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {50136#true} #res := ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,934 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1186#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {50136#true} is VALID [2022-02-20 20:00:31,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {50136#true} havoc ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {50136#true} assume !(1 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {50136#true} assume !(2 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {50136#true} ~__retres1~1 := 0; {50136#true} is VALID [2022-02-20 20:00:31,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {50136#true} #res := ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,935 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1188#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,936 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {50141#(= ~c_dr_st~0 0)} #1194#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {50184#(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); {50136#true} is VALID [2022-02-20 20:00:31,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume !(1 == ~q_write_ev~0); {50136#true} is VALID [2022-02-20 20:00:31,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1196#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {50136#true} havoc ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50136#true} is VALID [2022-02-20 20:00:31,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} #res := ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,946 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1198#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {50136#true} havoc ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} #res := ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50136#true} {50137#false} #1198#return; {50137#false} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {50136#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {50136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {50136#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {50136#true} is VALID [2022-02-20 20:00:31,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {50136#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; {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {50136#true} call update_channels1(); {50183#(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:31,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {50183#(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); {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {50136#true} {50136#true} #1190#return; {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {50136#true} assume { :begin_inline_init_threads1 } true; {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {50136#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {50136#true} is VALID [2022-02-20 20:00:31,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {50136#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {50141#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,951 INFO L272 TraceCheckUtils]: 12: Hoare triple {50141#(= ~c_dr_st~0 0)} call fire_delta_events1(); {50184#(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:31,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {50184#(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); {50136#true} is VALID [2022-02-20 20:00:31,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {50136#true} assume !(0 == ~q_write_ev~0); {50136#true} is VALID [2022-02-20 20:00:31,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,957 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1192#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,958 INFO L272 TraceCheckUtils]: 17: Hoare triple {50141#(= ~c_dr_st~0 0)} call activate_threads1(); {50185#(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:31,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {50185#(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; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,958 INFO L272 TraceCheckUtils]: 19: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {50136#true} is VALID [2022-02-20 20:00:31,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {50136#true} havoc ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {50136#true} assume !(1 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {50136#true} assume !(2 == ~p_dw_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {50136#true} ~__retres1~0 := 0; {50136#true} is VALID [2022-02-20 20:00:31,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {50136#true} #res := ~__retres1~0; {50136#true} is VALID [2022-02-20 20:00:31,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,959 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1186#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,960 INFO L272 TraceCheckUtils]: 29: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {50136#true} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {50136#true} havoc ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {50136#true} assume !(1 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {50136#true} assume !(2 == ~c_dr_pc~0); {50136#true} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {50136#true} ~__retres1~1 := 0; {50136#true} is VALID [2022-02-20 20:00:31,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {50136#true} #res := ~__retres1~1; {50136#true} is VALID [2022-02-20 20:00:31,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,961 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50136#true} {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1188#return; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:31,962 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {50186#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {50141#(= ~c_dr_st~0 0)} #1194#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,962 INFO L272 TraceCheckUtils]: 41: Hoare triple {50141#(= ~c_dr_st~0 0)} call reset_delta_events1(); {50184#(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:31,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {50184#(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); {50136#true} is VALID [2022-02-20 20:00:31,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {50136#true} assume !(1 == ~q_write_ev~0); {50136#true} is VALID [2022-02-20 20:00:31,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,963 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1196#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {50141#(= ~c_dr_st~0 0)} assume !false; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {50141#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {50141#(= ~c_dr_st~0 0)} assume !false; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,964 INFO L272 TraceCheckUtils]: 49: Hoare triple {50141#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {50136#true} is VALID [2022-02-20 20:00:31,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {50136#true} havoc ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {50136#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50136#true} is VALID [2022-02-20 20:00:31,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {50136#true} #res := ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,965 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {50136#true} {50141#(= ~c_dr_st~0 0)} #1198#return; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {50141#(= ~c_dr_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {50141#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {50141#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {50141#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {50141#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {50141#(= ~c_dr_st~0 0)} assume !false; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {50141#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {50141#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {50141#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {50141#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {50137#false} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {50137#false} assume !false; {50137#false} is VALID [2022-02-20 20:00:31,967 INFO L272 TraceCheckUtils]: 65: Hoare triple {50137#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {50136#true} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {50136#true} havoc ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {50136#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50136#true} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {50136#true} #res := ~__retres1~2; {50136#true} is VALID [2022-02-20 20:00:31,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {50136#true} assume true; {50136#true} is VALID [2022-02-20 20:00:31,967 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {50136#true} {50137#false} #1198#return; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {50137#false} assume 0 != eval1_~tmp___1~0#1; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {50137#false} assume !(0 == ~p_dw_pc~0); {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {50137#false} assume 1 == ~p_dw_pc~0; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {50137#false} assume !(0 == ~q_free~0); {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {50137#false} assume !false; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {50137#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 81: Hoare triple {50137#false} assume { :end_inline_do_write_p } true; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {50137#false} assume !(0 == ~c_dr_pc~0); {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 85: Hoare triple {50137#false} assume 2 == ~c_dr_pc~0; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 86: Hoare triple {50137#false} do_read_c_~a~0#1 := ~a_t~0; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 87: Hoare triple {50137#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; {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L290 TraceCheckUtils]: 88: Hoare triple {50137#false} assume !(~p_last_write~0 == ~c_last_read~0); {50137#false} is VALID [2022-02-20 20:00:31,969 INFO L272 TraceCheckUtils]: 89: Hoare triple {50137#false} call error1(); {50137#false} is VALID [2022-02-20 20:00:31,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {50137#false} assume !false; {50137#false} is VALID [2022-02-20 20:00:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:00:31,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:31,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254696793] [2022-02-20 20:00:31,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254696793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:31,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:31,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:31,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173518421] [2022-02-20 20:00:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:00:31,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:31,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:32,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:32,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:32,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:32,026 INFO L87 Difference]: Start difference. First operand 1909 states and 2483 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,004 INFO L93 Difference]: Finished difference Result 5506 states and 7191 transitions. [2022-02-20 20:00:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:00:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 787 transitions. [2022-02-20 20:00:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 787 transitions. [2022-02-20 20:00:35,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 787 transitions. [2022-02-20 20:00:35,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 787 edges. 787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:36,155 INFO L225 Difference]: With dead ends: 5506 [2022-02-20 20:00:36,155 INFO L226 Difference]: Without dead ends: 3816 [2022-02-20 20:00:36,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:00:36,159 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 849 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:36,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [875 Valid, 1453 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-02-20 20:00:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3596. [2022-02-20 20:00:36,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:36,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3816 states. Second operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) [2022-02-20 20:00:36,392 INFO L74 IsIncluded]: Start isIncluded. First operand 3816 states. Second operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) [2022-02-20 20:00:36,398 INFO L87 Difference]: Start difference. First operand 3816 states. Second operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) [2022-02-20 20:00:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,874 INFO L93 Difference]: Finished difference Result 3816 states and 4947 transitions. [2022-02-20 20:00:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4947 transitions. [2022-02-20 20:00:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:36,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:36,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) Second operand 3816 states. [2022-02-20 20:00:36,892 INFO L87 Difference]: Start difference. First operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) Second operand 3816 states. [2022-02-20 20:00:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:37,387 INFO L93 Difference]: Finished difference Result 3816 states and 4947 transitions. [2022-02-20 20:00:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4947 transitions. [2022-02-20 20:00:37,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:37,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:37,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:37,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2830 states have (on average 1.2848056537102472) internal successors, (3636), 2890 states have internal predecessors, (3636), 402 states have call successors, (402), 272 states have call predecessors, (402), 362 states have return successors, (603), 438 states have call predecessors, (603), 398 states have call successors, (603) [2022-02-20 20:00:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4641 transitions. [2022-02-20 20:00:37,986 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4641 transitions. Word has length 91 [2022-02-20 20:00:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:37,986 INFO L470 AbstractCegarLoop]: Abstraction has 3596 states and 4641 transitions. [2022-02-20 20:00:37,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4641 transitions. [2022-02-20 20:00:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:37,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:37,989 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:37,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:37,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -170748099, now seen corresponding path program 1 times [2022-02-20 20:00:37,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:37,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637835430] [2022-02-20 20:00:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {70110#(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); {70063#true} is VALID [2022-02-20 20:00:38,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70063#true} {70065#(= 1 ~c_dr_i~0)} #1190#return; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {70111#(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); {70063#true} is VALID [2022-02-20 20:00:38,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume !(0 == ~q_write_ev~0); {70063#true} is VALID [2022-02-20 20:00:38,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70063#true} {70064#false} #1192#return; {70064#false} is VALID [2022-02-20 20:00:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {70063#true} havoc ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume !(1 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} assume !(2 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {70063#true} ~__retres1~0 := 0; {70063#true} is VALID [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {70063#true} #res := ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,053 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {70063#true} {70063#true} #1186#return; {70063#true} is VALID [2022-02-20 20:00:38,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {70063#true} havoc ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume !(1 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} assume !(2 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {70063#true} ~__retres1~1 := 0; {70063#true} is VALID [2022-02-20 20:00:38,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {70063#true} #res := ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {70063#true} {70063#true} #1188#return; {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {70112#(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; {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L272 TraceCheckUtils]: 1: Hoare triple {70063#true} call #t~ret8 := is_do_write_p_triggered(); {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} havoc ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {70063#true} assume !(1 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {70063#true} assume !(2 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {70063#true} ~__retres1~0 := 0; {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {70063#true} #res := ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {70063#true} {70063#true} #1186#return; {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {70063#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {70063#true} assume !(0 != ~tmp~1); {70063#true} is VALID [2022-02-20 20:00:38,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {70063#true} call #t~ret9 := is_do_read_c_triggered(); {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {70063#true} havoc ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {70063#true} assume !(1 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {70063#true} assume !(2 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {70063#true} ~__retres1~1 := 0; {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {70063#true} #res := ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {70063#true} {70063#true} #1188#return; {70063#true} is VALID [2022-02-20 20:00:38,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {70063#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70063#true} is VALID [2022-02-20 20:00:38,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {70063#true} assume !(0 != ~tmp___0~1); {70063#true} is VALID [2022-02-20 20:00:38,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,060 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {70063#true} {70064#false} #1194#return; {70064#false} is VALID [2022-02-20 20:00:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {70111#(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); {70063#true} is VALID [2022-02-20 20:00:38,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume !(1 == ~q_write_ev~0); {70063#true} is VALID [2022-02-20 20:00:38,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70063#true} {70064#false} #1196#return; {70064#false} is VALID [2022-02-20 20:00:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {70063#true} havoc ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70063#true} is VALID [2022-02-20 20:00:38,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} #res := ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,067 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70063#true} {70064#false} #1198#return; {70064#false} is VALID [2022-02-20 20:00:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:38,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {70063#true} havoc ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70063#true} is VALID [2022-02-20 20:00:38,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} #res := ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,072 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70063#true} {70064#false} #1198#return; {70064#false} is VALID [2022-02-20 20:00:38,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {70063#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {70063#true} is VALID [2022-02-20 20:00:38,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {70063#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {70063#true} is VALID [2022-02-20 20:00:38,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {70063#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {70065#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {70065#(= 1 ~c_dr_i~0)} call update_channels1(); {70110#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:38,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {70110#(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); {70063#true} is VALID [2022-02-20 20:00:38,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,074 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70063#true} {70065#(= 1 ~c_dr_i~0)} #1190#return; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {70065#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {70065#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70065#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {70065#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {70064#false} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {70064#false} assume { :end_inline_init_threads1 } true; {70064#false} is VALID [2022-02-20 20:00:38,075 INFO L272 TraceCheckUtils]: 12: Hoare triple {70064#false} call fire_delta_events1(); {70111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {70111#(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); {70063#true} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {70063#true} assume !(0 == ~q_write_ev~0); {70063#true} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,075 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70063#true} {70064#false} #1192#return; {70064#false} is VALID [2022-02-20 20:00:38,075 INFO L272 TraceCheckUtils]: 17: Hoare triple {70064#false} call activate_threads1(); {70112#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:38,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {70112#(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; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L272 TraceCheckUtils]: 19: Hoare triple {70063#true} call #t~ret8 := is_do_write_p_triggered(); {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {70063#true} havoc ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {70063#true} assume !(1 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {70063#true} assume !(2 == ~p_dw_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {70063#true} ~__retres1~0 := 0; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {70063#true} #res := ~__retres1~0; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70063#true} {70063#true} #1186#return; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {70063#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70063#true} is VALID [2022-02-20 20:00:38,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {70063#true} assume !(0 != ~tmp~1); {70063#true} is VALID [2022-02-20 20:00:38,077 INFO L272 TraceCheckUtils]: 29: Hoare triple {70063#true} call #t~ret9 := is_do_read_c_triggered(); {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {70063#true} havoc ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {70063#true} assume !(1 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {70063#true} assume !(2 == ~c_dr_pc~0); {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {70063#true} ~__retres1~1 := 0; {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {70063#true} #res := ~__retres1~1; {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70063#true} {70063#true} #1188#return; {70063#true} is VALID [2022-02-20 20:00:38,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {70063#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {70063#true} assume !(0 != ~tmp___0~1); {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {70063#true} {70064#false} #1194#return; {70064#false} is VALID [2022-02-20 20:00:38,092 INFO L272 TraceCheckUtils]: 41: Hoare triple {70064#false} call reset_delta_events1(); {70111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {70111#(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); {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {70063#true} assume !(1 == ~q_write_ev~0); {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,092 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {70063#true} {70064#false} #1196#return; {70064#false} is VALID [2022-02-20 20:00:38,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,093 INFO L272 TraceCheckUtils]: 49: Hoare triple {70064#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70063#true} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {70063#true} havoc ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {70063#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70063#true} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {70063#true} #res := ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,093 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {70063#true} {70064#false} #1198#return; {70064#false} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {70064#false} assume 0 != eval1_~tmp___1~0#1; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {70064#false} assume 0 == ~p_dw_pc~0; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {70064#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {70064#false} assume { :end_inline_do_write_p } true; {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {70064#false} assume !(0 == ~c_dr_st~0); {70064#false} is VALID [2022-02-20 20:00:38,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,095 INFO L272 TraceCheckUtils]: 65: Hoare triple {70064#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70063#true} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {70063#true} havoc ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {70063#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70063#true} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {70063#true} #res := ~__retres1~2; {70063#true} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {70063#true} assume true; {70063#true} is VALID [2022-02-20 20:00:38,095 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {70063#true} {70064#false} #1198#return; {70064#false} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 71: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {70064#false} assume 0 != eval1_~tmp___1~0#1; {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 73: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 74: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 75: Hoare triple {70064#false} assume !(0 == ~p_dw_pc~0); {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#false} assume 1 == ~p_dw_pc~0; {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#false} assume !(0 == ~q_free~0); {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 78: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 80: Hoare triple {70064#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 81: Hoare triple {70064#false} assume { :end_inline_do_write_p } true; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 82: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {70064#false} assume !(0 == ~c_dr_pc~0); {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {70064#false} assume 2 == ~c_dr_pc~0; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {70064#false} do_read_c_~a~0#1 := ~a_t~0; {70064#false} is VALID [2022-02-20 20:00:38,097 INFO L290 TraceCheckUtils]: 87: Hoare triple {70064#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; {70064#false} is VALID [2022-02-20 20:00:38,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {70064#false} assume !(~p_last_write~0 == ~c_last_read~0); {70064#false} is VALID [2022-02-20 20:00:38,098 INFO L272 TraceCheckUtils]: 89: Hoare triple {70064#false} call error1(); {70064#false} is VALID [2022-02-20 20:00:38,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {70064#false} assume !false; {70064#false} is VALID [2022-02-20 20:00:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:38,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:38,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637835430] [2022-02-20 20:00:38,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637835430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:38,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:38,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:38,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708322427] [2022-02-20 20:00:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:38,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:38,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:38,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:38,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:38,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:38,141 INFO L87 Difference]: Start difference. First operand 3596 states and 4641 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,610 INFO L93 Difference]: Finished difference Result 5404 states and 6909 transitions. [2022-02-20 20:00:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2022-02-20 20:00:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2022-02-20 20:00:40,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 631 transitions. [2022-02-20 20:00:41,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,207 INFO L225 Difference]: With dead ends: 5404 [2022-02-20 20:00:41,207 INFO L226 Difference]: Without dead ends: 2027 [2022-02-20 20:00:41,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:41,211 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 677 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:41,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 1032 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:00:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2022-02-20 20:00:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1909. [2022-02-20 20:00:41,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:41,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2027 states. Second operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:41,304 INFO L74 IsIncluded]: Start isIncluded. First operand 2027 states. Second operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:41,306 INFO L87 Difference]: Start difference. First operand 2027 states. Second operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,432 INFO L93 Difference]: Finished difference Result 2027 states and 2605 transitions. [2022-02-20 20:00:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2605 transitions. [2022-02-20 20:00:41,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2027 states. [2022-02-20 20:00:41,438 INFO L87 Difference]: Start difference. First operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2027 states. [2022-02-20 20:00:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,564 INFO L93 Difference]: Finished difference Result 2027 states and 2605 transitions. [2022-02-20 20:00:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2605 transitions. [2022-02-20 20:00:41,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:41,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1516 states have (on average 1.2902374670184698) internal successors, (1956), 1542 states have internal predecessors, (1956), 213 states have call successors, (213), 140 states have call predecessors, (213), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2440 transitions. [2022-02-20 20:00:41,754 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2440 transitions. Word has length 91 [2022-02-20 20:00:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:41,754 INFO L470 AbstractCegarLoop]: Abstraction has 1909 states and 2440 transitions. [2022-02-20 20:00:41,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2440 transitions. [2022-02-20 20:00:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:00:41,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:41,756 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:41,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:41,756 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -196498665, now seen corresponding path program 1 times [2022-02-20 20:00:41,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:41,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505776358] [2022-02-20 20:00:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {84064#(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); {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {84018#(= ~q_read_ev~0 2)} #1190#return; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {84066#(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); {84016#true} is VALID [2022-02-20 20:00:41,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume !(0 == ~q_write_ev~0); {84016#true} is VALID [2022-02-20 20:00:41,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84016#true} {84018#(= ~q_read_ev~0 2)} #1192#return; {84016#true} is VALID [2022-02-20 20:00:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {84016#true} havoc ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume !(1 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} assume !(2 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {84016#true} ~__retres1~0 := 0; {84016#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {84016#true} #res := ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,862 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {84016#true} {84016#true} #1186#return; {84016#true} is VALID [2022-02-20 20:00:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {84016#true} havoc ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume !(1 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} assume !(2 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {84016#true} ~__retres1~1 := 0; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {84016#true} #res := ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {84016#true} {84016#true} #1188#return; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {84067#(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; {84016#true} is VALID [2022-02-20 20:00:41,881 INFO L272 TraceCheckUtils]: 1: Hoare triple {84016#true} call #t~ret8 := is_do_write_p_triggered(); {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} havoc ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {84016#true} assume !(1 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {84016#true} assume !(2 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {84016#true} ~__retres1~0 := 0; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {84016#true} #res := ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {84016#true} {84016#true} #1186#return; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {84016#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {84016#true} assume !(0 != ~tmp~1); {84016#true} is VALID [2022-02-20 20:00:41,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {84016#true} call #t~ret9 := is_do_read_c_triggered(); {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {84016#true} havoc ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {84016#true} assume !(1 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {84016#true} assume !(2 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {84016#true} ~__retres1~1 := 0; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {84016#true} #res := ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {84016#true} {84016#true} #1188#return; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {84016#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {84016#true} is VALID [2022-02-20 20:00:41,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {84016#true} assume !(0 != ~tmp___0~1); {84016#true} is VALID [2022-02-20 20:00:41,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,884 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {84016#true} {84016#true} #1194#return; {84016#true} is VALID [2022-02-20 20:00:41,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {84066#(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); {84016#true} is VALID [2022-02-20 20:00:41,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume !(1 == ~q_write_ev~0); {84016#true} is VALID [2022-02-20 20:00:41,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84016#true} {84016#true} #1196#return; {84016#true} is VALID [2022-02-20 20:00:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {84016#true} havoc ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84016#true} is VALID [2022-02-20 20:00:41,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} #res := ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,889 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {84016#true} {84016#true} #1198#return; {84016#true} is VALID [2022-02-20 20:00:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:00:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {84016#true} havoc ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {84082#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {84082#(= ~p_dw_st~0 0)} assume true; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,902 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {84082#(= ~p_dw_st~0 0)} {84058#(not (= ~p_dw_st~0 0))} #1198#return; {84017#false} is VALID [2022-02-20 20:00:41,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {84016#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {84016#true} is VALID [2022-02-20 20:00:41,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {84016#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {84016#true} is VALID [2022-02-20 20:00:41,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {84016#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {84018#(= ~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; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {84018#(= ~q_read_ev~0 2)} call update_channels1(); {84064#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:41,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {84064#(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); {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,904 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {84065#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {84018#(= ~q_read_ev~0 2)} #1190#return; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {84018#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {84018#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {84018#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {84018#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {84018#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,905 INFO L272 TraceCheckUtils]: 12: Hoare triple {84018#(= ~q_read_ev~0 2)} call fire_delta_events1(); {84066#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {84066#(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); {84016#true} is VALID [2022-02-20 20:00:41,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {84016#true} assume !(0 == ~q_write_ev~0); {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {84016#true} {84018#(= ~q_read_ev~0 2)} #1192#return; {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L272 TraceCheckUtils]: 17: Hoare triple {84016#true} call activate_threads1(); {84067#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:41,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {84067#(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; {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {84016#true} call #t~ret8 := is_do_write_p_triggered(); {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {84016#true} havoc ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {84016#true} assume !(1 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {84016#true} assume !(2 == ~p_dw_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {84016#true} ~__retres1~0 := 0; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {84016#true} #res := ~__retres1~0; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {84016#true} {84016#true} #1186#return; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {84016#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {84016#true} assume !(0 != ~tmp~1); {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L272 TraceCheckUtils]: 29: Hoare triple {84016#true} call #t~ret9 := is_do_read_c_triggered(); {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {84016#true} havoc ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {84016#true} assume !(1 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {84016#true} assume !(2 == ~c_dr_pc~0); {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {84016#true} ~__retres1~1 := 0; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {84016#true} #res := ~__retres1~1; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {84016#true} {84016#true} #1188#return; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {84016#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {84016#true} assume !(0 != ~tmp___0~1); {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,908 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {84016#true} {84016#true} #1194#return; {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L272 TraceCheckUtils]: 41: Hoare triple {84016#true} call reset_delta_events1(); {84066#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {84066#(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); {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {84016#true} assume !(1 == ~q_write_ev~0); {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {84016#true} {84016#true} #1196#return; {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {84016#true} assume !false; {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {84016#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {84016#true} is VALID [2022-02-20 20:00:41,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {84016#true} assume !false; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L272 TraceCheckUtils]: 49: Hoare triple {84016#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {84016#true} havoc ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {84016#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {84016#true} #res := ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {84016#true} assume true; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {84016#true} {84016#true} #1198#return; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {84016#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {84016#true} assume 0 != eval1_~tmp___1~0#1; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {84016#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {84016#true} is VALID [2022-02-20 20:00:41,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {84016#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {84016#true} is VALID [2022-02-20 20:00:41,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {84016#true} assume 0 == ~p_dw_pc~0; {84016#true} is VALID [2022-02-20 20:00:41,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {84016#true} assume !false; {84016#true} is VALID [2022-02-20 20:00:41,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {84016#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {84058#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {84058#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {84058#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {84058#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {84058#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {84058#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {84058#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {84058#(not (= ~p_dw_st~0 0))} assume !false; {84058#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:41,912 INFO L272 TraceCheckUtils]: 66: Hoare triple {84058#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {84016#true} is VALID [2022-02-20 20:00:41,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {84016#true} havoc ~__retres1~2; {84016#true} is VALID [2022-02-20 20:00:41,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {84016#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {84082#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {84082#(= ~p_dw_st~0 0)} assume true; {84082#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:41,913 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84082#(= ~p_dw_st~0 0)} {84058#(not (= ~p_dw_st~0 0))} #1198#return; {84017#false} is VALID [2022-02-20 20:00:41,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 73: Hoare triple {84017#false} assume 0 != eval1_~tmp___1~0#1; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 74: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 75: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {84017#false} assume !(0 == ~p_dw_pc~0); {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {84017#false} assume 1 == ~p_dw_pc~0; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {84017#false} assume !(0 == ~q_free~0); {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 79: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 80: Hoare triple {84017#false} assume !false; {84017#false} is VALID [2022-02-20 20:00:41,914 INFO L290 TraceCheckUtils]: 81: Hoare triple {84017#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 82: Hoare triple {84017#false} assume { :end_inline_do_write_p } true; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 83: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {84017#false} assume !(0 == ~c_dr_pc~0); {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 86: Hoare triple {84017#false} assume 2 == ~c_dr_pc~0; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 87: Hoare triple {84017#false} do_read_c_~a~0#1 := ~a_t~0; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 88: Hoare triple {84017#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; {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 89: Hoare triple {84017#false} assume !(~p_last_write~0 == ~c_last_read~0); {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L272 TraceCheckUtils]: 90: Hoare triple {84017#false} call error1(); {84017#false} is VALID [2022-02-20 20:00:41,915 INFO L290 TraceCheckUtils]: 91: Hoare triple {84017#false} assume !false; {84017#false} is VALID [2022-02-20 20:00:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:00:41,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:41,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505776358] [2022-02-20 20:00:41,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505776358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:41,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:41,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:41,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865494264] [2022-02-20 20:00:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:41,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:00:41,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:41,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:41,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:41,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:41,963 INFO L87 Difference]: Start difference. First operand 1909 states and 2440 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,187 INFO L93 Difference]: Finished difference Result 4718 states and 6019 transitions. [2022-02-20 20:00:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:00:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:00:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1072 transitions. [2022-02-20 20:00:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1072 transitions. [2022-02-20 20:00:46,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1072 transitions. [2022-02-20 20:00:46,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:47,236 INFO L225 Difference]: With dead ends: 4718 [2022-02-20 20:00:47,236 INFO L226 Difference]: Without dead ends: 2723 [2022-02-20 20:00:47,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:00:47,239 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 1842 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:47,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1880 Valid, 1531 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2022-02-20 20:00:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2546. [2022-02-20 20:00:47,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:47,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2723 states. Second operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:47,376 INFO L74 IsIncluded]: Start isIncluded. First operand 2723 states. Second operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:47,378 INFO L87 Difference]: Start difference. First operand 2723 states. Second operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,587 INFO L93 Difference]: Finished difference Result 2723 states and 3404 transitions. [2022-02-20 20:00:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3404 transitions. [2022-02-20 20:00:47,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) Second operand 2723 states. [2022-02-20 20:00:47,595 INFO L87 Difference]: Start difference. First operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) Second operand 2723 states. [2022-02-20 20:00:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,838 INFO L93 Difference]: Finished difference Result 2723 states and 3404 transitions. [2022-02-20 20:00:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3404 transitions. [2022-02-20 20:00:47,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:47,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1994 states have (on average 1.2537612838515546) internal successors, (2500), 2029 states have internal predecessors, (2500), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3199 transitions. [2022-02-20 20:00:48,151 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3199 transitions. Word has length 92 [2022-02-20 20:00:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:48,151 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 3199 transitions. [2022-02-20 20:00:48,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3199 transitions. [2022-02-20 20:00:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 20:00:48,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:48,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:48,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:48,153 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -140072605, now seen corresponding path program 1 times [2022-02-20 20:00:48,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:48,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357209554] [2022-02-20 20:00:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,190 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {99313#true} {99315#(= ~t1_i~0 1)} #1218#return; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 20:00:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {99313#true} assume !(0 == ~T1_E~0); {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {99313#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {99313#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {99313#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {99313#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {99313#true} assume 0 == ~E_M~0;~E_M~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {99313#true} assume 0 == ~E_1~0;~E_1~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {99313#true} assume 0 == ~E_2~0;~E_2~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {99313#true} assume !(0 == ~E_3~0); {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {99313#true} assume 0 == ~E_4~0;~E_4~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {99313#true} assume 0 == ~E_5~0;~E_5~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,214 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {99313#true} {99314#false} #1220#return; {99314#false} is VALID [2022-02-20 20:00:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 20:00:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {99390#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;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; {99313#true} is VALID [2022-02-20 20:00:48,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {99313#true} assume !(1 == ~m_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {99313#true} is_master_triggered_~__retres1~4#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {99313#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {99313#true} is VALID [2022-02-20 20:00:48,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {99313#true} #t~ret29#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp~6#1 := #t~ret29#1;havoc #t~ret29#1; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {99313#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {99313#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; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {99313#true} assume 1 == ~t1_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {99313#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {99313#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {99313#true} #t~ret30#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___0~4#1 := #t~ret30#1;havoc #t~ret30#1; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {99313#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {99313#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; {99313#true} is VALID [2022-02-20 20:00:48,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {99313#true} assume !(1 == ~t2_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {99313#true} is_transmit2_triggered_~__retres1~6#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {99313#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {99313#true} #t~ret31#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___1~1#1 := #t~ret31#1;havoc #t~ret31#1; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {99313#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {99313#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {99313#true} assume 1 == ~t3_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {99313#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {99313#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {99313#true} is VALID [2022-02-20 20:00:48,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {99313#true} #t~ret32#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___2~0#1 := #t~ret32#1;havoc #t~ret32#1; {99313#true} is VALID [2022-02-20 20:00:48,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {99313#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {99313#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {99313#true} is VALID [2022-02-20 20:00:48,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {99313#true} assume 1 == ~t4_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {99313#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {99313#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {99313#true} is VALID [2022-02-20 20:00:48,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {99313#true} #t~ret33#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___3~0#1 := #t~ret33#1;havoc #t~ret33#1; {99313#true} is VALID [2022-02-20 20:00:48,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {99313#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {99313#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {99313#true} assume !(1 == ~t5_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {99313#true} is_transmit5_triggered_~__retres1~9#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {99313#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {99313#true} #t~ret34#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___4~0#1 := #t~ret34#1;havoc #t~ret34#1; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {99313#true} assume !(0 != ~tmp___4~0#1); {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,248 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {99313#true} {99314#false} #1222#return; {99314#false} is VALID [2022-02-20 20:00:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 20:00:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {99313#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {99313#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {99313#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {99313#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {99313#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {99313#true} assume 1 == ~E_M~0;~E_M~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {99313#true} assume !(1 == ~E_1~0); {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {99313#true} assume 1 == ~E_2~0;~E_2~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {99313#true} assume 1 == ~E_3~0;~E_3~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {99313#true} assume 1 == ~E_4~0;~E_4~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {99313#true} assume 1 == ~E_5~0;~E_5~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,254 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {99313#true} {99314#false} #1224#return; {99314#false} is VALID [2022-02-20 20:00:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 20:00:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {99313#true} havoc ~__retres1~10; {99313#true} is VALID [2022-02-20 20:00:48,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {99313#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {99313#true} is VALID [2022-02-20 20:00:48,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {99313#true} #res := ~__retres1~10; {99313#true} is VALID [2022-02-20 20:00:48,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,256 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {99313#true} {99314#false} #1226#return; {99314#false} is VALID [2022-02-20 20:00:48,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {99313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {99313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {99313#true} is VALID [2022-02-20 20:00:48,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {99313#true} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~11#1;havoc main2_~__retres1~11#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1;~t5_i~0 := 1; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {99315#(= ~t1_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret36#1, start_simulation2_#t~ret37#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; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {99315#(= ~t1_i~0 1)} call update_channels2(); {99313#true} is VALID [2022-02-20 20:00:48,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,258 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {99313#true} {99315#(= ~t1_i~0 1)} #1218#return; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {99315#(= ~t1_i~0 1)} assume { :begin_inline_init_threads2 } true; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {99315#(= ~t1_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {99315#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:48,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {99315#(= ~t1_i~0 1)} assume !(1 == ~t1_i~0);~t1_st~0 := 2; {99314#false} is VALID [2022-02-20 20:00:48,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {99314#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {99314#false} is VALID [2022-02-20 20:00:48,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {99314#false} assume 1 == ~t3_i~0;~t3_st~0 := 0; {99314#false} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {99314#false} assume 1 == ~t4_i~0;~t4_st~0 := 0; {99314#false} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {99314#false} assume 1 == ~t5_i~0;~t5_st~0 := 0; {99314#false} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {99314#false} assume { :end_inline_init_threads2 } true; {99314#false} is VALID [2022-02-20 20:00:48,260 INFO L272 TraceCheckUtils]: 15: Hoare triple {99314#false} call fire_delta_events2(); {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {99313#true} assume !(0 == ~T1_E~0); {99313#true} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {99313#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {99313#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {99313#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {99313#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {99313#true} assume 0 == ~E_M~0;~E_M~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {99313#true} assume 0 == ~E_1~0;~E_1~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {99313#true} assume 0 == ~E_2~0;~E_2~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {99313#true} assume !(0 == ~E_3~0); {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {99313#true} assume 0 == ~E_4~0;~E_4~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {99313#true} assume 0 == ~E_5~0;~E_5~0 := 1; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,261 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {99313#true} {99314#false} #1220#return; {99314#false} is VALID [2022-02-20 20:00:48,262 INFO L272 TraceCheckUtils]: 30: Hoare triple {99314#false} call activate_threads2(); {99390#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {99390#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;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; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {99313#true} assume !(1 == ~m_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {99313#true} is_master_triggered_~__retres1~4#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {99313#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {99313#true} #t~ret29#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp~6#1 := #t~ret29#1;havoc #t~ret29#1; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {99313#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {99313#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; {99313#true} is VALID [2022-02-20 20:00:48,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {99313#true} assume 1 == ~t1_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {99313#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {99313#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {99313#true} #t~ret30#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___0~4#1 := #t~ret30#1;havoc #t~ret30#1; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {99313#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {99313#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; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {99313#true} assume !(1 == ~t2_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {99313#true} is_transmit2_triggered_~__retres1~6#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {99313#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {99313#true} is VALID [2022-02-20 20:00:48,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {99313#true} #t~ret31#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___1~1#1 := #t~ret31#1;havoc #t~ret31#1; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {99313#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {99313#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {99313#true} assume 1 == ~t3_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {99313#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {99313#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {99313#true} #t~ret32#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___2~0#1 := #t~ret32#1;havoc #t~ret32#1; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {99313#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {99313#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {99313#true} assume 1 == ~t4_pc~0; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {99313#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {99313#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {99313#true} #t~ret33#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___3~0#1 := #t~ret33#1;havoc #t~ret33#1; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {99313#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {99313#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {99313#true} assume !(1 == ~t5_pc~0); {99313#true} is VALID [2022-02-20 20:00:48,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {99313#true} is_transmit5_triggered_~__retres1~9#1 := 0; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {99313#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {99313#true} #t~ret34#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___4~0#1 := #t~ret34#1;havoc #t~ret34#1; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {99313#true} assume !(0 != ~tmp___4~0#1); {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {99313#true} {99314#false} #1222#return; {99314#false} is VALID [2022-02-20 20:00:48,266 INFO L272 TraceCheckUtils]: 69: Hoare triple {99314#false} call reset_delta_events2(); {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {99389#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {99313#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {99313#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 73: Hoare triple {99313#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 74: Hoare triple {99313#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 75: Hoare triple {99313#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 76: Hoare triple {99313#true} assume 1 == ~E_M~0;~E_M~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {99313#true} assume !(1 == ~E_1~0); {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 78: Hoare triple {99313#true} assume 1 == ~E_2~0;~E_2~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {99313#true} assume 1 == ~E_3~0;~E_3~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {99313#true} assume 1 == ~E_4~0;~E_4~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {99313#true} assume 1 == ~E_5~0;~E_5~0 := 2; {99313#true} is VALID [2022-02-20 20:00:48,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,268 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {99313#true} {99314#false} #1224#return; {99314#false} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {99314#false} assume !false; {99314#false} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {99314#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet28#1, eval2_~tmp_ndt_6~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {99314#false} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {99314#false} assume !false; {99314#false} is VALID [2022-02-20 20:00:48,268 INFO L272 TraceCheckUtils]: 87: Hoare triple {99314#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {99313#true} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {99313#true} havoc ~__retres1~10; {99313#true} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {99313#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {99313#true} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 90: Hoare triple {99313#true} #res := ~__retres1~10; {99313#true} is VALID [2022-02-20 20:00:48,268 INFO L290 TraceCheckUtils]: 91: Hoare triple {99313#true} assume true; {99313#true} is VALID [2022-02-20 20:00:48,269 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {99313#true} {99314#false} #1226#return; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {99314#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {99314#false} assume 0 != eval2_~tmp~5#1; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 95: Hoare triple {99314#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 96: Hoare triple {99314#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 97: Hoare triple {99314#false} assume !(0 == ~m_pc~0); {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 98: Hoare triple {99314#false} assume 1 == ~m_pc~0; {99314#false} is VALID [2022-02-20 20:00:48,269 INFO L290 TraceCheckUtils]: 99: Hoare triple {99314#false} assume ~token~0 != 5 + ~local~0; {99314#false} is VALID [2022-02-20 20:00:48,270 INFO L272 TraceCheckUtils]: 100: Hoare triple {99314#false} call error2(); {99314#false} is VALID [2022-02-20 20:00:48,270 INFO L290 TraceCheckUtils]: 101: Hoare triple {99314#false} assume !false; {99314#false} is VALID [2022-02-20 20:00:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:48,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:48,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357209554] [2022-02-20 20:00:48,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357209554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:48,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:48,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:48,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088493426] [2022-02-20 20:00:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2022-02-20 20:00:48,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:48,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:48,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:48,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:48,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:48,336 INFO L87 Difference]: Start difference. First operand 2546 states and 3199 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:50,463 INFO L93 Difference]: Finished difference Result 2813 states and 3621 transitions. [2022-02-20 20:00:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2022-02-20 20:00:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2022-02-20 20:00:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2022-02-20 20:00:50,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 887 transitions. [2022-02-20 20:00:51,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 887 edges. 887 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,469 INFO L225 Difference]: With dead ends: 2813 [2022-02-20 20:00:51,469 INFO L226 Difference]: Without dead ends: 2611 [2022-02-20 20:00:51,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:51,472 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 628 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:51,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 908 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-02-20 20:00:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2546. [2022-02-20 20:00:51,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:51,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2611 states. Second operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:51,648 INFO L74 IsIncluded]: Start isIncluded. First operand 2611 states. Second operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:51,650 INFO L87 Difference]: Start difference. First operand 2611 states. Second operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:51,865 INFO L93 Difference]: Finished difference Result 2611 states and 3310 transitions. [2022-02-20 20:00:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3310 transitions. [2022-02-20 20:00:51,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:51,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:51,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) Second operand 2611 states. [2022-02-20 20:00:51,873 INFO L87 Difference]: Start difference. First operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) Second operand 2611 states. [2022-02-20 20:00:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,071 INFO L93 Difference]: Finished difference Result 2611 states and 3310 transitions. [2022-02-20 20:00:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3310 transitions. [2022-02-20 20:00:52,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:52,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1994 states have (on average 1.253259779338014) internal successors, (2499), 2029 states have internal predecessors, (2499), 292 states have call successors, (292), 189 states have call predecessors, (292), 258 states have return successors, (407), 330 states have call predecessors, (407), 288 states have call successors, (407) [2022-02-20 20:00:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3198 transitions. [2022-02-20 20:00:52,360 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3198 transitions. Word has length 102 [2022-02-20 20:00:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 3198 transitions. [2022-02-20 20:00:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3198 transitions. [2022-02-20 20:00:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 20:00:52,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:52,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:52,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:52,371 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 743436385, now seen corresponding path program 1 times [2022-02-20 20:00:52,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:52,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456160950] [2022-02-20 20:00:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,396 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {111796#true} {111798#(= ~M_E~0 2)} #1218#return; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 20:00:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume !(0 == ~T1_E~0); {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T5_E~0;~T5_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume !(0 == ~E_3~0); {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_5~0;~E_5~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume true; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,421 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {111873#(= |old(~M_E~0)| 0)} {111798#(= ~M_E~0 2)} #1220#return; {111797#false} is VALID [2022-02-20 20:00:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 20:00:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {111874#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;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; {111796#true} is VALID [2022-02-20 20:00:52,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {111796#true} assume !(1 == ~m_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {111796#true} is_master_triggered_~__retres1~4#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {111796#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {111796#true} #t~ret29#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp~6#1 := #t~ret29#1;havoc #t~ret29#1; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {111796#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {111796#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; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {111796#true} assume 1 == ~t1_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {111796#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {111796#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {111796#true} #t~ret30#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___0~4#1 := #t~ret30#1;havoc #t~ret30#1; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {111796#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {111796#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; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {111796#true} assume !(1 == ~t2_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {111796#true} is_transmit2_triggered_~__retres1~6#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {111796#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {111796#true} #t~ret31#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___1~1#1 := #t~ret31#1;havoc #t~ret31#1; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {111796#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {111796#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {111796#true} assume 1 == ~t3_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {111796#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {111796#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {111796#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {111796#true} #t~ret32#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___2~0#1 := #t~ret32#1;havoc #t~ret32#1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {111796#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {111796#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {111796#true} assume 1 == ~t4_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {111796#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {111796#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {111796#true} #t~ret33#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___3~0#1 := #t~ret33#1;havoc #t~ret33#1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {111796#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {111796#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {111796#true} is VALID [2022-02-20 20:00:52,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {111796#true} assume !(1 == ~t5_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {111796#true} is_transmit5_triggered_~__retres1~9#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {111796#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {111796#true} #t~ret34#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___4~0#1 := #t~ret34#1;havoc #t~ret34#1; {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {111796#true} assume !(0 != ~tmp___4~0#1); {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,442 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {111796#true} {111797#false} #1222#return; {111797#false} is VALID [2022-02-20 20:00:52,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 20:00:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {111796#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {111796#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {111796#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {111796#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {111796#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {111796#true} assume 1 == ~E_M~0;~E_M~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {111796#true} assume !(1 == ~E_1~0); {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {111796#true} assume 1 == ~E_2~0;~E_2~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {111796#true} assume 1 == ~E_3~0;~E_3~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {111796#true} assume 1 == ~E_4~0;~E_4~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {111796#true} assume 1 == ~E_5~0;~E_5~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,448 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {111796#true} {111797#false} #1224#return; {111797#false} is VALID [2022-02-20 20:00:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 20:00:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {111796#true} havoc ~__retres1~10; {111796#true} is VALID [2022-02-20 20:00:52,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {111796#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {111796#true} is VALID [2022-02-20 20:00:52,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {111796#true} #res := ~__retres1~10; {111796#true} is VALID [2022-02-20 20:00:52,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,451 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111796#true} {111797#false} #1226#return; {111797#false} is VALID [2022-02-20 20:00:52,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {111796#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {111798#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {111798#(= ~M_E~0 2)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~11#1;havoc main2_~__retres1~11#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1;~t5_i~0 := 1; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {111798#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret36#1, start_simulation2_#t~ret37#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; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {111798#(= ~M_E~0 2)} call update_channels2(); {111796#true} is VALID [2022-02-20 20:00:52,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,465 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {111796#true} {111798#(= ~M_E~0 2)} #1218#return; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {111798#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {111798#(= ~M_E~0 2)} assume 1 == ~t5_i~0;~t5_st~0 := 0; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {111798#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {111798#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:52,468 INFO L272 TraceCheckUtils]: 15: Hoare triple {111798#(= ~M_E~0 2)} call fire_delta_events2(); {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume !(0 == ~T1_E~0); {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~T5_E~0;~T5_E~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume !(0 == ~E_3~0); {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume 0 == ~E_5~0;~E_5~0 := 1; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {111873#(= |old(~M_E~0)| 0)} assume true; {111873#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:52,472 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {111873#(= |old(~M_E~0)| 0)} {111798#(= ~M_E~0 2)} #1220#return; {111797#false} is VALID [2022-02-20 20:00:52,472 INFO L272 TraceCheckUtils]: 30: Hoare triple {111797#false} call activate_threads2(); {111874#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {111874#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;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; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {111796#true} assume !(1 == ~m_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {111796#true} is_master_triggered_~__retres1~4#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {111796#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {111796#true} #t~ret29#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp~6#1 := #t~ret29#1;havoc #t~ret29#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {111796#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {111796#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; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {111796#true} assume 1 == ~t1_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {111796#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {111796#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {111796#true} #t~ret30#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___0~4#1 := #t~ret30#1;havoc #t~ret30#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {111796#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {111796#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; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {111796#true} assume !(1 == ~t2_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {111796#true} is_transmit2_triggered_~__retres1~6#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {111796#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {111796#true} #t~ret31#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___1~1#1 := #t~ret31#1;havoc #t~ret31#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {111796#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {111796#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {111796#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {111796#true} assume 1 == ~t3_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {111796#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {111796#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {111796#true} #t~ret32#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___2~0#1 := #t~ret32#1;havoc #t~ret32#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {111796#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 55: Hoare triple {111796#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {111796#true} assume 1 == ~t4_pc~0; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {111796#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {111796#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {111796#true} #t~ret33#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___3~0#1 := #t~ret33#1;havoc #t~ret33#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {111796#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {111796#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {111796#true} assume !(1 == ~t5_pc~0); {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {111796#true} is_transmit5_triggered_~__retres1~9#1 := 0; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {111796#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {111796#true} #t~ret34#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___4~0#1 := #t~ret34#1;havoc #t~ret34#1; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {111796#true} assume !(0 != ~tmp___4~0#1); {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {111796#true} {111797#false} #1222#return; {111797#false} is VALID [2022-02-20 20:00:52,473 INFO L272 TraceCheckUtils]: 69: Hoare triple {111797#false} call reset_delta_events2(); {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {111872#(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) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {111796#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {111796#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {111796#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {111796#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {111796#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {111796#true} assume 1 == ~E_M~0;~E_M~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {111796#true} assume !(1 == ~E_1~0); {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {111796#true} assume 1 == ~E_2~0;~E_2~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 79: Hoare triple {111796#true} assume 1 == ~E_3~0;~E_3~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 80: Hoare triple {111796#true} assume 1 == ~E_4~0;~E_4~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 81: Hoare triple {111796#true} assume 1 == ~E_5~0;~E_5~0 := 2; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 82: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {111796#true} {111797#false} #1224#return; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 84: Hoare triple {111797#false} assume !false; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 85: Hoare triple {111797#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet28#1, eval2_~tmp_ndt_6~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {111797#false} assume !false; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L272 TraceCheckUtils]: 87: Hoare triple {111797#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {111796#true} havoc ~__retres1~10; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {111796#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {111796#true} #res := ~__retres1~10; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {111796#true} assume true; {111796#true} is VALID [2022-02-20 20:00:52,474 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {111796#true} {111797#false} #1226#return; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {111797#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {111797#false} is VALID [2022-02-20 20:00:52,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {111797#false} assume 0 != eval2_~tmp~5#1; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 95: Hoare triple {111797#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {111797#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 97: Hoare triple {111797#false} assume !(0 == ~m_pc~0); {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 98: Hoare triple {111797#false} assume 1 == ~m_pc~0; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {111797#false} assume ~token~0 != 5 + ~local~0; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L272 TraceCheckUtils]: 100: Hoare triple {111797#false} call error2(); {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L290 TraceCheckUtils]: 101: Hoare triple {111797#false} assume !false; {111797#false} is VALID [2022-02-20 20:00:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:52,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:52,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456160950] [2022-02-20 20:00:52,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456160950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:52,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:52,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:52,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734753614] [2022-02-20 20:00:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2022-02-20 20:00:52,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:52,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:52,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:52,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:52,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:52,549 INFO L87 Difference]: Start difference. First operand 2546 states and 3198 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:56,253 INFO L93 Difference]: Finished difference Result 3072 states and 4029 transitions. [2022-02-20 20:00:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2022-02-20 20:00:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1295 transitions. [2022-02-20 20:00:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1295 transitions. [2022-02-20 20:00:56,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1295 transitions.