./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:38,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:38,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:38,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:38,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:38,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:38,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:38,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:38,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:38,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:38,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:38,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:38,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:38,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:38,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:38,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:38,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:38,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:38,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:38,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:38,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:38,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:38,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:38,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:38,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:38,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:38,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:38,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:38,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:38,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:38,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:38,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:38,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:38,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:38,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:38,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:38,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:38,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:38,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:38,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:38,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:38,923 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:56:38,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:38,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:38,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:38,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:38,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:38,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:38,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:38,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:38,945 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:38,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:38,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:38,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:38,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:38,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:38,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:38,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:38,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:38,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:38,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:38,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:38,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:38,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:38,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:38,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:38,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:38,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:38,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:38,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:38,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:38,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:38,950 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:38,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:38,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:38,950 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2022-02-20 19:56:39,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:39,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:39,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:39,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:39,159 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:39,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-02-20 19:56:39,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91aaebdf4/a6654bb9f3ee48be9c83a5511c241d7e/FLAG16788bda1 [2022-02-20 19:56:39,647 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:39,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-02-20 19:56:39,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91aaebdf4/a6654bb9f3ee48be9c83a5511c241d7e/FLAG16788bda1 [2022-02-20 19:56:39,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91aaebdf4/a6654bb9f3ee48be9c83a5511c241d7e [2022-02-20 19:56:39,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:39,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:39,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:40,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:40,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:40,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:39" (1/1) ... [2022-02-20 19:56:40,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1510ee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40, skipping insertion in model container [2022-02-20 19:56:40,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:39" (1/1) ... [2022-02-20 19:56:40,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:40,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:40,173 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_2.cil-1+token_ring.02.cil-1.c[914,927] [2022-02-20 19:56:40,219 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_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2022-02-20 19:56:40,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:40,280 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:40,296 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_2.cil-1+token_ring.02.cil-1.c[914,927] [2022-02-20 19:56:40,313 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_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2022-02-20 19:56:40,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:40,350 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:40,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40 WrapperNode [2022-02-20 19:56:40,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:40,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:40,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:40,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:40,357 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:56:40" (1/1) ... [2022-02-20 19:56:40,366 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:56:40" (1/1) ... [2022-02-20 19:56:40,407 INFO L137 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 460 [2022-02-20 19:56:40,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:40,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:40,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:40,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:40,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:40,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:40,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:40,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:40,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:40,506 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:56:40,508 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:56:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:40,535 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:40,535 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:40,535 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:40,535 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:40,639 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:40,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:41,121 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:41,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:41,130 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:56:41,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:41 BoogieIcfgContainer [2022-02-20 19:56:41,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:41,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:41,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:41,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:41,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:39" (1/3) ... [2022-02-20 19:56:41,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31856aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:41, skipping insertion in model container [2022-02-20 19:56:41,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (2/3) ... [2022-02-20 19:56:41,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31856aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:41, skipping insertion in model container [2022-02-20 19:56:41,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:41" (3/3) ... [2022-02-20 19:56:41,139 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-02-20 19:56:41,143 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:41,143 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:41,181 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:41,186 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:56:41,186 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 186 states have (on average 1.553763440860215) internal successors, (289), 192 states have internal predecessors, (289), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 19:56:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:41,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:41,218 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:56:41,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1449552793, now seen corresponding path program 1 times [2022-02-20 19:56:41,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:41,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702750393] [2022-02-20 19:56:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {276#(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); {236#true} is VALID [2022-02-20 19:56:41,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {238#(= ~p_dw_i~0 1)} #764#return; {238#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(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; {236#true} is VALID [2022-02-20 19:56:41,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume !(0 == ~q_write_ev~0); {236#true} is VALID [2022-02-20 19:56:41,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {237#false} #766#return; {237#false} is VALID [2022-02-20 19:56:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} havoc ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume 1 == ~p_dw_pc~0; {236#true} is VALID [2022-02-20 19:56:41,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {236#true} is VALID [2022-02-20 19:56:41,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#true} #res := ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,449 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {236#true} {236#true} #760#return; {236#true} is VALID [2022-02-20 19:56:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} havoc ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume 1 == ~c_dr_pc~0; {236#true} is VALID [2022-02-20 19:56:41,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {236#true} is VALID [2022-02-20 19:56:41,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#true} #res := ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,455 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {236#true} {236#true} #762#return; {236#true} is VALID [2022-02-20 19:56:41,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#(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; {236#true} is VALID [2022-02-20 19:56:41,456 INFO L272 TraceCheckUtils]: 1: Hoare triple {236#true} call #t~ret8 := is_do_write_p_triggered(); {236#true} is VALID [2022-02-20 19:56:41,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} havoc ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#true} assume 1 == ~p_dw_pc~0; {236#true} is VALID [2022-02-20 19:56:41,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {236#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {236#true} is VALID [2022-02-20 19:56:41,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} #res := ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,457 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {236#true} {236#true} #760#return; {236#true} is VALID [2022-02-20 19:56:41,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {236#true} is VALID [2022-02-20 19:56:41,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {236#true} is VALID [2022-02-20 19:56:41,458 INFO L272 TraceCheckUtils]: 10: Hoare triple {236#true} call #t~ret9 := is_do_read_c_triggered(); {236#true} is VALID [2022-02-20 19:56:41,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#true} havoc ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#true} assume 1 == ~c_dr_pc~0; {236#true} is VALID [2022-02-20 19:56:41,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {236#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {236#true} is VALID [2022-02-20 19:56:41,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#true} #res := ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,460 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {236#true} {236#true} #762#return; {236#true} is VALID [2022-02-20 19:56:41,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {236#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {236#true} is VALID [2022-02-20 19:56:41,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {236#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {236#true} is VALID [2022-02-20 19:56:41,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,461 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {236#true} {237#false} #768#return; {237#false} is VALID [2022-02-20 19:56:41,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(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; {236#true} is VALID [2022-02-20 19:56:41,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {236#true} is VALID [2022-02-20 19:56:41,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {237#false} #770#return; {237#false} is VALID [2022-02-20 19:56:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} havoc ~__retres1~2; {236#true} is VALID [2022-02-20 19:56:41,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {236#true} is VALID [2022-02-20 19:56:41,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} #res := ~__retres1~2; {236#true} is VALID [2022-02-20 19:56:41,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,475 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {236#true} {237#false} #772#return; {237#false} is VALID [2022-02-20 19:56:41,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {236#true} is VALID [2022-02-20 19:56:41,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {236#true} is VALID [2022-02-20 19:56:41,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {238#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {238#(= ~p_dw_i~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {238#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#(= ~p_dw_i~0 1)} call update_channels1(); {276#(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:56:41,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#(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); {236#true} is VALID [2022-02-20 19:56:41,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,480 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {236#true} {238#(= ~p_dw_i~0 1)} #764#return; {238#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {238#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {237#false} is VALID [2022-02-20 19:56:41,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {237#false} is VALID [2022-02-20 19:56:41,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume { :end_inline_init_threads1 } true; {237#false} is VALID [2022-02-20 19:56:41,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#false} call fire_delta_events1(); {277#(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:56:41,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#(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; {236#true} is VALID [2022-02-20 19:56:41,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#true} assume !(0 == ~q_write_ev~0); {236#true} is VALID [2022-02-20 19:56:41,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,482 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {236#true} {237#false} #766#return; {237#false} is VALID [2022-02-20 19:56:41,483 INFO L272 TraceCheckUtils]: 17: Hoare triple {237#false} call activate_threads1(); {278#(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:56:41,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {278#(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; {236#true} is VALID [2022-02-20 19:56:41,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {236#true} call #t~ret8 := is_do_write_p_triggered(); {236#true} is VALID [2022-02-20 19:56:41,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {236#true} havoc ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {236#true} assume 1 == ~p_dw_pc~0; {236#true} is VALID [2022-02-20 19:56:41,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {236#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {236#true} is VALID [2022-02-20 19:56:41,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {236#true} #res := ~__retres1~0; {236#true} is VALID [2022-02-20 19:56:41,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,485 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {236#true} {236#true} #760#return; {236#true} is VALID [2022-02-20 19:56:41,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {236#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {236#true} is VALID [2022-02-20 19:56:41,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {236#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {236#true} is VALID [2022-02-20 19:56:41,485 INFO L272 TraceCheckUtils]: 28: Hoare triple {236#true} call #t~ret9 := is_do_read_c_triggered(); {236#true} is VALID [2022-02-20 19:56:41,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {236#true} havoc ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {236#true} assume 1 == ~c_dr_pc~0; {236#true} is VALID [2022-02-20 19:56:41,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {236#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {236#true} is VALID [2022-02-20 19:56:41,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {236#true} #res := ~__retres1~1; {236#true} is VALID [2022-02-20 19:56:41,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,487 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {236#true} {236#true} #762#return; {236#true} is VALID [2022-02-20 19:56:41,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {236#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {236#true} is VALID [2022-02-20 19:56:41,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {236#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {236#true} is VALID [2022-02-20 19:56:41,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,488 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {236#true} {237#false} #768#return; {237#false} is VALID [2022-02-20 19:56:41,488 INFO L272 TraceCheckUtils]: 39: Hoare triple {237#false} call reset_delta_events1(); {277#(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:56:41,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {277#(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; {236#true} is VALID [2022-02-20 19:56:41,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {236#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {236#true} is VALID [2022-02-20 19:56:41,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,489 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {236#true} {237#false} #770#return; {237#false} is VALID [2022-02-20 19:56:41,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-02-20 19:56:41,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {237#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; {237#false} is VALID [2022-02-20 19:56:41,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-02-20 19:56:41,490 INFO L272 TraceCheckUtils]: 47: Hoare triple {237#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {236#true} is VALID [2022-02-20 19:56:41,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {236#true} havoc ~__retres1~2; {236#true} is VALID [2022-02-20 19:56:41,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {236#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {236#true} is VALID [2022-02-20 19:56:41,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {236#true} #res := ~__retres1~2; {236#true} is VALID [2022-02-20 19:56:41,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {236#true} assume true; {236#true} is VALID [2022-02-20 19:56:41,491 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {236#true} {237#false} #772#return; {237#false} is VALID [2022-02-20 19:56:41,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {237#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; {237#false} is VALID [2022-02-20 19:56:41,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {237#false} assume 0 != eval1_~tmp___1~0#1; {237#false} is VALID [2022-02-20 19:56:41,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {237#false} assume !(0 == ~p_dw_st~0); {237#false} is VALID [2022-02-20 19:56:41,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {237#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; {237#false} is VALID [2022-02-20 19:56:41,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {237#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; {237#false} is VALID [2022-02-20 19:56:41,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {237#false} assume 0 == ~c_dr_pc~0; {237#false} is VALID [2022-02-20 19:56:41,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-02-20 19:56:41,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {237#false} assume !(1 == ~q_free~0); {237#false} is VALID [2022-02-20 19:56:41,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {237#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; {237#false} is VALID [2022-02-20 19:56:41,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {237#false} assume !(~p_last_write~0 == ~c_last_read~0); {237#false} is VALID [2022-02-20 19:56:41,494 INFO L272 TraceCheckUtils]: 63: Hoare triple {237#false} call error1(); {237#false} is VALID [2022-02-20 19:56:41,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-02-20 19:56:41,494 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:56:41,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:41,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702750393] [2022-02-20 19:56:41,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702750393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:41,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:41,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:56:41,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38158954] [2022-02-20 19:56:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:41,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:41,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:41,561 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:56:41,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:56:41,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:41,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:56:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:56:41,583 INFO L87 Difference]: Start difference. First operand has 233 states, 186 states have (on average 1.553763440860215) internal successors, (289), 192 states have internal predecessors, (289), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,931 INFO L93 Difference]: Finished difference Result 467 states and 699 transitions. [2022-02-20 19:56:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:56:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 699 transitions. [2022-02-20 19:56:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 699 transitions. [2022-02-20 19:56:42,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 699 transitions. [2022-02-20 19:56:43,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:43,549 INFO L225 Difference]: With dead ends: 467 [2022-02-20 19:56:43,550 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 19:56:43,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:56:43,556 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 458 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:43,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 707 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:56:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 19:56:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 223. [2022-02-20 19:56:43,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:43,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:43,600 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:43,601 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:43,615 INFO L93 Difference]: Finished difference Result 241 states and 344 transitions. [2022-02-20 19:56:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 344 transitions. [2022-02-20 19:56:43,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:43,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:43,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 241 states. [2022-02-20 19:56:43,620 INFO L87 Difference]: Start difference. First operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 241 states. [2022-02-20 19:56:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:43,632 INFO L93 Difference]: Finished difference Result 241 states and 344 transitions. [2022-02-20 19:56:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 344 transitions. [2022-02-20 19:56:43,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:43,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:43,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:43,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.449438202247191) internal successors, (258), 182 states have internal predecessors, (258), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2022-02-20 19:56:43,647 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 65 [2022-02-20 19:56:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:43,648 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2022-02-20 19:56:43,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2022-02-20 19:56:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:43,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:43,651 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:56:43,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:43,651 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1408878043, now seen corresponding path program 1 times [2022-02-20 19:56:43,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:43,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005851496] [2022-02-20 19:56:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {1777#(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); {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:43,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:43,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1739#(= ~q_read_ev~0 2)} #764#return; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {1779#(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; {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#(= |old(~q_read_ev~0)| 0)} assume true; {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#(= |old(~q_read_ev~0)| 0)} {1739#(= ~q_read_ev~0 2)} #766#return; {1738#false} is VALID [2022-02-20 19:56:43,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1737#true} havoc ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} assume 1 == ~p_dw_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1737#true} is VALID [2022-02-20 19:56:43,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#true} #res := ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,809 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1737#true} {1737#true} #760#return; {1737#true} is VALID [2022-02-20 19:56:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {1737#true} havoc ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} assume 1 == ~c_dr_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1737#true} is VALID [2022-02-20 19:56:43,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#true} #res := ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,816 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1737#true} {1737#true} #762#return; {1737#true} is VALID [2022-02-20 19:56:43,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {1781#(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; {1737#true} is VALID [2022-02-20 19:56:43,816 INFO L272 TraceCheckUtils]: 1: Hoare triple {1737#true} call #t~ret8 := is_do_write_p_triggered(); {1737#true} is VALID [2022-02-20 19:56:43,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} havoc ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#true} assume 1 == ~p_dw_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {1737#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1737#true} is VALID [2022-02-20 19:56:43,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1737#true} #res := ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,818 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1737#true} {1737#true} #760#return; {1737#true} is VALID [2022-02-20 19:56:43,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1737#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1737#true} is VALID [2022-02-20 19:56:43,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1737#true} is VALID [2022-02-20 19:56:43,818 INFO L272 TraceCheckUtils]: 10: Hoare triple {1737#true} call #t~ret9 := is_do_read_c_triggered(); {1737#true} is VALID [2022-02-20 19:56:43,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#true} havoc ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1737#true} assume 1 == ~c_dr_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {1737#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1737#true} is VALID [2022-02-20 19:56:43,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#true} #res := ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,820 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1737#true} {1737#true} #762#return; {1737#true} is VALID [2022-02-20 19:56:43,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1737#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1737#true} is VALID [2022-02-20 19:56:43,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1737#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1737#true} is VALID [2022-02-20 19:56:43,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,823 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1737#true} {1738#false} #768#return; {1738#false} is VALID [2022-02-20 19:56:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {1779#(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; {1737#true} is VALID [2022-02-20 19:56:43,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1737#true} is VALID [2022-02-20 19:56:43,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1737#true} {1738#false} #770#return; {1738#false} is VALID [2022-02-20 19:56:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {1737#true} havoc ~__retres1~2; {1737#true} is VALID [2022-02-20 19:56:43,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1737#true} is VALID [2022-02-20 19:56:43,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} #res := ~__retres1~2; {1737#true} is VALID [2022-02-20 19:56:43,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,840 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1737#true} {1738#false} #772#return; {1738#false} is VALID [2022-02-20 19:56:43,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {1737#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {1737#true} is VALID [2022-02-20 19:56:43,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {1737#true} is VALID [2022-02-20 19:56:43,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {1739#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1739#(= ~q_read_ev~0 2)} call update_channels1(); {1777#(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:56:43,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#(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); {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:43,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:43,843 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1778#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1739#(= ~q_read_ev~0 2)} #764#return; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {1739#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {1739#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1739#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1739#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {1739#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:43,846 INFO L272 TraceCheckUtils]: 12: Hoare triple {1739#(= ~q_read_ev~0 2)} call fire_delta_events1(); {1779#(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:56:43,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1779#(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; {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {1780#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#(= |old(~q_read_ev~0)| 0)} assume true; {1780#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:43,850 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1780#(= |old(~q_read_ev~0)| 0)} {1739#(= ~q_read_ev~0 2)} #766#return; {1738#false} is VALID [2022-02-20 19:56:43,850 INFO L272 TraceCheckUtils]: 17: Hoare triple {1738#false} call activate_threads1(); {1781#(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:56:43,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {1781#(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; {1737#true} is VALID [2022-02-20 19:56:43,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {1737#true} call #t~ret8 := is_do_write_p_triggered(); {1737#true} is VALID [2022-02-20 19:56:43,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {1737#true} havoc ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {1737#true} assume 1 == ~p_dw_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {1737#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1737#true} is VALID [2022-02-20 19:56:43,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {1737#true} #res := ~__retres1~0; {1737#true} is VALID [2022-02-20 19:56:43,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,852 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1737#true} {1737#true} #760#return; {1737#true} is VALID [2022-02-20 19:56:43,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1737#true} is VALID [2022-02-20 19:56:43,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {1737#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1737#true} is VALID [2022-02-20 19:56:43,853 INFO L272 TraceCheckUtils]: 28: Hoare triple {1737#true} call #t~ret9 := is_do_read_c_triggered(); {1737#true} is VALID [2022-02-20 19:56:43,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {1737#true} havoc ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#true} assume 1 == ~c_dr_pc~0; {1737#true} is VALID [2022-02-20 19:56:43,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1737#true} is VALID [2022-02-20 19:56:43,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {1737#true} #res := ~__retres1~1; {1737#true} is VALID [2022-02-20 19:56:43,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,857 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1737#true} {1737#true} #762#return; {1737#true} is VALID [2022-02-20 19:56:43,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {1737#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1737#true} is VALID [2022-02-20 19:56:43,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {1737#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1737#true} is VALID [2022-02-20 19:56:43,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,857 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1737#true} {1738#false} #768#return; {1738#false} is VALID [2022-02-20 19:56:43,858 INFO L272 TraceCheckUtils]: 39: Hoare triple {1738#false} call reset_delta_events1(); {1779#(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:56:43,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {1779#(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; {1737#true} is VALID [2022-02-20 19:56:43,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {1737#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1737#true} is VALID [2022-02-20 19:56:43,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,860 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1737#true} {1738#false} #770#return; {1738#false} is VALID [2022-02-20 19:56:43,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {1738#false} assume !false; {1738#false} is VALID [2022-02-20 19:56:43,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {1738#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; {1738#false} is VALID [2022-02-20 19:56:43,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {1738#false} assume !false; {1738#false} is VALID [2022-02-20 19:56:43,862 INFO L272 TraceCheckUtils]: 47: Hoare triple {1738#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {1737#true} is VALID [2022-02-20 19:56:43,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {1737#true} havoc ~__retres1~2; {1737#true} is VALID [2022-02-20 19:56:43,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {1737#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1737#true} is VALID [2022-02-20 19:56:43,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {1737#true} #res := ~__retres1~2; {1737#true} is VALID [2022-02-20 19:56:43,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {1737#true} assume true; {1737#true} is VALID [2022-02-20 19:56:43,864 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1737#true} {1738#false} #772#return; {1738#false} is VALID [2022-02-20 19:56:43,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {1738#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; {1738#false} is VALID [2022-02-20 19:56:43,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {1738#false} assume 0 != eval1_~tmp___1~0#1; {1738#false} is VALID [2022-02-20 19:56:43,864 INFO L290 TraceCheckUtils]: 55: Hoare triple {1738#false} assume !(0 == ~p_dw_st~0); {1738#false} is VALID [2022-02-20 19:56:43,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {1738#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; {1738#false} is VALID [2022-02-20 19:56:43,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {1738#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; {1738#false} is VALID [2022-02-20 19:56:43,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {1738#false} assume 0 == ~c_dr_pc~0; {1738#false} is VALID [2022-02-20 19:56:43,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {1738#false} assume !false; {1738#false} is VALID [2022-02-20 19:56:43,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {1738#false} assume !(1 == ~q_free~0); {1738#false} is VALID [2022-02-20 19:56:43,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {1738#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; {1738#false} is VALID [2022-02-20 19:56:43,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {1738#false} assume !(~p_last_write~0 == ~c_last_read~0); {1738#false} is VALID [2022-02-20 19:56:43,866 INFO L272 TraceCheckUtils]: 63: Hoare triple {1738#false} call error1(); {1738#false} is VALID [2022-02-20 19:56:43,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {1738#false} assume !false; {1738#false} is VALID [2022-02-20 19:56:43,867 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:56:43,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:43,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005851496] [2022-02-20 19:56:43,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005851496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:43,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:43,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:43,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987041927] [2022-02-20 19:56:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:43,870 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:56:43,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:43,871 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:56:43,912 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:56:43,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:43,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:43,916 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,131 INFO L93 Difference]: Finished difference Result 446 states and 630 transitions. [2022-02-20 19:56:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:46,131 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:56:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 630 transitions. [2022-02-20 19:56:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 630 transitions. [2022-02-20 19:56:46,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 630 transitions. [2022-02-20 19:56:46,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:46,632 INFO L225 Difference]: With dead ends: 446 [2022-02-20 19:56:46,632 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 19:56:46,633 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 19:56:46,634 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 444 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:46,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 1163 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 19:56:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 319. [2022-02-20 19:56:46,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:46,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:46,660 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:46,661 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,676 INFO L93 Difference]: Finished difference Result 358 states and 501 transitions. [2022-02-20 19:56:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 501 transitions. [2022-02-20 19:56:46,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 358 states. [2022-02-20 19:56:46,680 INFO L87 Difference]: Start difference. First operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 358 states. [2022-02-20 19:56:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,694 INFO L93 Difference]: Finished difference Result 358 states and 501 transitions. [2022-02-20 19:56:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 501 transitions. [2022-02-20 19:56:46,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:46,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 260 states have internal predecessors, (362), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2022-02-20 19:56:46,710 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 65 [2022-02-20 19:56:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:46,710 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2022-02-20 19:56:46,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2022-02-20 19:56:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:46,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:46,713 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:56:46,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:46,713 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1812663994, now seen corresponding path program 1 times [2022-02-20 19:56:46,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:46,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967742729] [2022-02-20 19:56:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3622#(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); {3583#true} is VALID [2022-02-20 19:56:46,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3583#true} {3583#true} #764#return; {3583#true} is VALID [2022-02-20 19:56:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3623#(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); {3583#true} is VALID [2022-02-20 19:56:46,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume !(0 == ~q_write_ev~0); {3583#true} is VALID [2022-02-20 19:56:46,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3583#true} {3583#true} #766#return; {3583#true} is VALID [2022-02-20 19:56:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {3583#true} havoc ~__retres1~0; {3583#true} is VALID [2022-02-20 19:56:46,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume !(1 == ~p_dw_pc~0); {3583#true} is VALID [2022-02-20 19:56:46,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} ~__retres1~0 := 0; {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:46,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,852 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3583#true} #760#return; {3631#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:46,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {3583#true} havoc ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume 1 == ~c_dr_pc~0; {3583#true} is VALID [2022-02-20 19:56:46,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3583#true} is VALID [2022-02-20 19:56:46,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {3583#true} #res := ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,858 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3583#true} {3584#false} #762#return; {3584#false} is VALID [2022-02-20 19:56:46,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {3624#(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; {3583#true} is VALID [2022-02-20 19:56:46,858 INFO L272 TraceCheckUtils]: 1: Hoare triple {3583#true} call #t~ret8 := is_do_write_p_triggered(); {3583#true} is VALID [2022-02-20 19:56:46,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} havoc ~__retres1~0; {3583#true} is VALID [2022-02-20 19:56:46,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {3583#true} assume !(1 == ~p_dw_pc~0); {3583#true} is VALID [2022-02-20 19:56:46,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {3583#true} ~__retres1~0 := 0; {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:46,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,861 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3583#true} #760#return; {3631#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:46,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {3631#(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; {3632#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:46,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3584#false} is VALID [2022-02-20 19:56:46,862 INFO L272 TraceCheckUtils]: 10: Hoare triple {3584#false} call #t~ret9 := is_do_read_c_triggered(); {3583#true} is VALID [2022-02-20 19:56:46,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {3583#true} havoc ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {3583#true} assume 1 == ~c_dr_pc~0; {3583#true} is VALID [2022-02-20 19:56:46,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {3583#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3583#true} is VALID [2022-02-20 19:56:46,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {3583#true} #res := ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,863 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3583#true} {3584#false} #762#return; {3584#false} is VALID [2022-02-20 19:56:46,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3584#false} is VALID [2022-02-20 19:56:46,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {3584#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3584#false} is VALID [2022-02-20 19:56:46,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {3584#false} assume true; {3584#false} is VALID [2022-02-20 19:56:46,864 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3584#false} {3583#true} #768#return; {3584#false} is VALID [2022-02-20 19:56:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {3623#(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); {3583#true} is VALID [2022-02-20 19:56:46,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3583#true} is VALID [2022-02-20 19:56:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3583#true} {3584#false} #770#return; {3584#false} is VALID [2022-02-20 19:56:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {3583#true} havoc ~__retres1~2; {3583#true} is VALID [2022-02-20 19:56:46,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3583#true} is VALID [2022-02-20 19:56:46,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} #res := ~__retres1~2; {3583#true} is VALID [2022-02-20 19:56:46,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,874 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3583#true} {3584#false} #772#return; {3584#false} is VALID [2022-02-20 19:56:46,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {3583#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {3583#true} is VALID [2022-02-20 19:56:46,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3583#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3583#true} is VALID [2022-02-20 19:56:46,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3583#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {3583#true} is VALID [2022-02-20 19:56:46,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {3583#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {3583#true} is VALID [2022-02-20 19:56:46,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {3583#true} call update_channels1(); {3622#(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:56:46,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3622#(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); {3583#true} is VALID [2022-02-20 19:56:46,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,876 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3583#true} {3583#true} #764#return; {3583#true} is VALID [2022-02-20 19:56:46,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {3583#true} assume { :begin_inline_init_threads1 } true; {3583#true} is VALID [2022-02-20 19:56:46,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3583#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3583#true} is VALID [2022-02-20 19:56:46,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {3583#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3583#true} is VALID [2022-02-20 19:56:46,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {3583#true} assume { :end_inline_init_threads1 } true; {3583#true} is VALID [2022-02-20 19:56:46,877 INFO L272 TraceCheckUtils]: 12: Hoare triple {3583#true} call fire_delta_events1(); {3623#(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:56:46,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#(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); {3583#true} is VALID [2022-02-20 19:56:46,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3583#true} assume !(0 == ~q_write_ev~0); {3583#true} is VALID [2022-02-20 19:56:46,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,878 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3583#true} {3583#true} #766#return; {3583#true} is VALID [2022-02-20 19:56:46,879 INFO L272 TraceCheckUtils]: 17: Hoare triple {3583#true} call activate_threads1(); {3624#(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:56:46,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {3624#(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; {3583#true} is VALID [2022-02-20 19:56:46,879 INFO L272 TraceCheckUtils]: 19: Hoare triple {3583#true} call #t~ret8 := is_do_write_p_triggered(); {3583#true} is VALID [2022-02-20 19:56:46,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {3583#true} havoc ~__retres1~0; {3583#true} is VALID [2022-02-20 19:56:46,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {3583#true} assume !(1 == ~p_dw_pc~0); {3583#true} is VALID [2022-02-20 19:56:46,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {3583#true} ~__retres1~0 := 0; {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:46,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {3639#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:46,881 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3640#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3583#true} #760#return; {3631#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:46,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {3631#(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; {3632#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:46,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {3632#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3584#false} is VALID [2022-02-20 19:56:46,882 INFO L272 TraceCheckUtils]: 28: Hoare triple {3584#false} call #t~ret9 := is_do_read_c_triggered(); {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {3583#true} havoc ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {3583#true} assume 1 == ~c_dr_pc~0; {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {3583#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {3583#true} #res := ~__retres1~1; {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,883 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3583#true} {3584#false} #762#return; {3584#false} is VALID [2022-02-20 19:56:46,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {3584#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3584#false} is VALID [2022-02-20 19:56:46,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {3584#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3584#false} is VALID [2022-02-20 19:56:46,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {3584#false} assume true; {3584#false} is VALID [2022-02-20 19:56:46,884 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3584#false} {3583#true} #768#return; {3584#false} is VALID [2022-02-20 19:56:46,884 INFO L272 TraceCheckUtils]: 39: Hoare triple {3584#false} call reset_delta_events1(); {3623#(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:56:46,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3623#(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); {3583#true} is VALID [2022-02-20 19:56:46,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {3583#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3583#true} is VALID [2022-02-20 19:56:46,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,885 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3583#true} {3584#false} #770#return; {3584#false} is VALID [2022-02-20 19:56:46,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {3584#false} assume !false; {3584#false} is VALID [2022-02-20 19:56:46,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {3584#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; {3584#false} is VALID [2022-02-20 19:56:46,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {3584#false} assume !false; {3584#false} is VALID [2022-02-20 19:56:46,886 INFO L272 TraceCheckUtils]: 47: Hoare triple {3584#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3583#true} is VALID [2022-02-20 19:56:46,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {3583#true} havoc ~__retres1~2; {3583#true} is VALID [2022-02-20 19:56:46,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {3583#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3583#true} is VALID [2022-02-20 19:56:46,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {3583#true} #res := ~__retres1~2; {3583#true} is VALID [2022-02-20 19:56:46,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {3583#true} assume true; {3583#true} is VALID [2022-02-20 19:56:46,891 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3583#true} {3584#false} #772#return; {3584#false} is VALID [2022-02-20 19:56:46,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {3584#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; {3584#false} is VALID [2022-02-20 19:56:46,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {3584#false} assume 0 != eval1_~tmp___1~0#1; {3584#false} is VALID [2022-02-20 19:56:46,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {3584#false} assume !(0 == ~p_dw_st~0); {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {3584#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; {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {3584#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; {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {3584#false} assume 0 == ~c_dr_pc~0; {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {3584#false} assume !false; {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {3584#false} assume !(1 == ~q_free~0); {3584#false} is VALID [2022-02-20 19:56:46,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {3584#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; {3584#false} is VALID [2022-02-20 19:56:46,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {3584#false} assume !(~p_last_write~0 == ~c_last_read~0); {3584#false} is VALID [2022-02-20 19:56:46,893 INFO L272 TraceCheckUtils]: 63: Hoare triple {3584#false} call error1(); {3584#false} is VALID [2022-02-20 19:56:46,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {3584#false} assume !false; {3584#false} is VALID [2022-02-20 19:56:46,893 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:56:46,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:46,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967742729] [2022-02-20 19:56:46,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967742729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:46,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:46,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:46,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077374682] [2022-02-20 19:56:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:46,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:46,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:46,942 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:56:46,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:46,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:46,944 INFO L87 Difference]: Start difference. First operand 319 states and 447 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:48,954 INFO L93 Difference]: Finished difference Result 533 states and 741 transitions. [2022-02-20 19:56:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 472 transitions. [2022-02-20 19:56:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 472 transitions. [2022-02-20 19:56:48,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 472 transitions. [2022-02-20 19:56:49,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:49,313 INFO L225 Difference]: With dead ends: 533 [2022-02-20 19:56:49,313 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 19:56:49,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:56:49,316 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 250 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:49,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1367 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 19:56:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 324. [2022-02-20 19:56:49,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:49,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:49,353 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:49,354 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:49,368 INFO L93 Difference]: Finished difference Result 356 states and 497 transitions. [2022-02-20 19:56:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2022-02-20 19:56:49,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:49,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:49,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 356 states. [2022-02-20 19:56:49,371 INFO L87 Difference]: Start difference. First operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 356 states. [2022-02-20 19:56:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:49,403 INFO L93 Difference]: Finished difference Result 356 states and 497 transitions. [2022-02-20 19:56:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2022-02-20 19:56:49,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:49,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:49,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:49,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 264 states have internal predecessors, (365), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2022-02-20 19:56:49,416 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 65 [2022-02-20 19:56:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:49,416 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2022-02-20 19:56:49,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2022-02-20 19:56:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:49,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:49,420 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:56:49,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:49,420 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 783304696, now seen corresponding path program 1 times [2022-02-20 19:56:49,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:49,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442919067] [2022-02-20 19:56:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {5581#(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); {5582#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:49,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#(not (= |old(~q_req_up~0)| 1))} assume true; {5582#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:49,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5582#(not (= |old(~q_req_up~0)| 1))} {5542#(= ~c_dr_pc~0 ~q_req_up~0)} #764#return; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#(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); {5539#true} is VALID [2022-02-20 19:56:49,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {5539#true} assume !(0 == ~q_write_ev~0); {5539#true} is VALID [2022-02-20 19:56:49,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5539#true} {5546#(not (= ~c_dr_pc~0 1))} #766#return; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {5539#true} havoc ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {5539#true} assume !(1 == ~p_dw_pc~0); {5539#true} is VALID [2022-02-20 19:56:49,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5539#true} ~__retres1~0 := 0; {5539#true} is VALID [2022-02-20 19:56:49,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {5539#true} #res := ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,559 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5539#true} {5539#true} #760#return; {5539#true} is VALID [2022-02-20 19:56:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {5539#true} havoc ~__retres1~1; {5539#true} is VALID [2022-02-20 19:56:49,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {5539#true} assume 1 == ~c_dr_pc~0; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,571 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} {5539#true} #762#return; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {5584#(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; {5539#true} is VALID [2022-02-20 19:56:49,571 INFO L272 TraceCheckUtils]: 1: Hoare triple {5539#true} call #t~ret8 := is_do_write_p_triggered(); {5539#true} is VALID [2022-02-20 19:56:49,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {5539#true} havoc ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {5539#true} assume !(1 == ~p_dw_pc~0); {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {5539#true} ~__retres1~0 := 0; {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5539#true} #res := ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5539#true} {5539#true} #760#return; {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {5539#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5539#true} is VALID [2022-02-20 19:56:49,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {5539#true} assume !(0 != ~tmp~1); {5539#true} is VALID [2022-02-20 19:56:49,573 INFO L272 TraceCheckUtils]: 10: Hoare triple {5539#true} call #t~ret9 := is_do_read_c_triggered(); {5539#true} is VALID [2022-02-20 19:56:49,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {5539#true} havoc ~__retres1~1; {5539#true} is VALID [2022-02-20 19:56:49,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#true} assume 1 == ~c_dr_pc~0; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,575 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} {5539#true} #762#return; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,576 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} {5546#(not (= ~c_dr_pc~0 1))} #768#return; {5540#false} is VALID [2022-02-20 19:56:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#(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); {5539#true} is VALID [2022-02-20 19:56:49,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5539#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5539#true} is VALID [2022-02-20 19:56:49,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5539#true} {5540#false} #770#return; {5540#false} is VALID [2022-02-20 19:56:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {5539#true} havoc ~__retres1~2; {5539#true} is VALID [2022-02-20 19:56:49,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5539#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5539#true} is VALID [2022-02-20 19:56:49,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {5539#true} #res := ~__retres1~2; {5539#true} is VALID [2022-02-20 19:56:49,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,599 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5539#true} {5540#false} #772#return; {5540#false} is VALID [2022-02-20 19:56:49,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {5539#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {5541#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:49,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {5541#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:49,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {5542#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:56:49,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {5542#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {5542#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:56:49,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {5542#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {5581#(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:56:49,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {5581#(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); {5582#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:49,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#(not (= |old(~q_req_up~0)| 1))} assume true; {5582#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:49,605 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5582#(not (= |old(~q_req_up~0)| 1))} {5542#(= ~c_dr_pc~0 ~q_req_up~0)} #764#return; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {5583#(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:56:49,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {5583#(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); {5539#true} is VALID [2022-02-20 19:56:49,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#true} assume !(0 == ~q_write_ev~0); {5539#true} is VALID [2022-02-20 19:56:49,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,611 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5539#true} {5546#(not (= ~c_dr_pc~0 1))} #766#return; {5546#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:49,611 INFO L272 TraceCheckUtils]: 17: Hoare triple {5546#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {5584#(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:56:49,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#(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; {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L272 TraceCheckUtils]: 19: Hoare triple {5539#true} call #t~ret8 := is_do_write_p_triggered(); {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {5539#true} havoc ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {5539#true} assume !(1 == ~p_dw_pc~0); {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {5539#true} ~__retres1~0 := 0; {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {5539#true} #res := ~__retres1~0; {5539#true} is VALID [2022-02-20 19:56:49,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,613 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5539#true} {5539#true} #760#return; {5539#true} is VALID [2022-02-20 19:56:49,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {5539#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5539#true} is VALID [2022-02-20 19:56:49,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {5539#true} assume !(0 != ~tmp~1); {5539#true} is VALID [2022-02-20 19:56:49,613 INFO L272 TraceCheckUtils]: 28: Hoare triple {5539#true} call #t~ret9 := is_do_read_c_triggered(); {5539#true} is VALID [2022-02-20 19:56:49,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {5539#true} havoc ~__retres1~1; {5539#true} is VALID [2022-02-20 19:56:49,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {5539#true} assume 1 == ~c_dr_pc~0; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,615 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} {5539#true} #762#return; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:49,617 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5597#(= (+ (- 1) ~c_dr_pc~0) 0)} {5546#(not (= ~c_dr_pc~0 1))} #768#return; {5540#false} is VALID [2022-02-20 19:56:49,617 INFO L272 TraceCheckUtils]: 39: Hoare triple {5540#false} call reset_delta_events1(); {5583#(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:56:49,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {5583#(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); {5539#true} is VALID [2022-02-20 19:56:49,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {5539#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5539#true} is VALID [2022-02-20 19:56:49,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,617 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5539#true} {5540#false} #770#return; {5540#false} is VALID [2022-02-20 19:56:49,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {5540#false} assume !false; {5540#false} is VALID [2022-02-20 19:56:49,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {5540#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; {5540#false} is VALID [2022-02-20 19:56:49,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {5540#false} assume !false; {5540#false} is VALID [2022-02-20 19:56:49,618 INFO L272 TraceCheckUtils]: 47: Hoare triple {5540#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5539#true} is VALID [2022-02-20 19:56:49,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {5539#true} havoc ~__retres1~2; {5539#true} is VALID [2022-02-20 19:56:49,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {5539#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5539#true} is VALID [2022-02-20 19:56:49,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {5539#true} #res := ~__retres1~2; {5539#true} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {5539#true} assume true; {5539#true} is VALID [2022-02-20 19:56:49,619 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5539#true} {5540#false} #772#return; {5540#false} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {5540#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; {5540#false} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {5540#false} assume 0 != eval1_~tmp___1~0#1; {5540#false} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {5540#false} assume !(0 == ~p_dw_st~0); {5540#false} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {5540#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; {5540#false} is VALID [2022-02-20 19:56:49,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {5540#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; {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {5540#false} assume 0 == ~c_dr_pc~0; {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {5540#false} assume !false; {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {5540#false} assume !(1 == ~q_free~0); {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {5540#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; {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {5540#false} assume !(~p_last_write~0 == ~c_last_read~0); {5540#false} is VALID [2022-02-20 19:56:49,620 INFO L272 TraceCheckUtils]: 63: Hoare triple {5540#false} call error1(); {5540#false} is VALID [2022-02-20 19:56:49,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {5540#false} assume !false; {5540#false} is VALID [2022-02-20 19:56:49,621 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:56:49,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:49,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442919067] [2022-02-20 19:56:49,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442919067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:49,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:49,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:56:49,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816127735] [2022-02-20 19:56:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:49,624 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), 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 65 [2022-02-20 19:56:49,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:49,625 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:49,666 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:56:49,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:56:49,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:56:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:56:49,669 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:54,498 INFO L93 Difference]: Finished difference Result 1224 states and 1669 transitions. [2022-02-20 19:56:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:56:54,499 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), 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 65 [2022-02-20 19:56:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:54,499 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 990 transitions. [2022-02-20 19:56:54,509 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 990 transitions. [2022-02-20 19:56:54,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 990 transitions. [2022-02-20 19:56:55,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 990 edges. 990 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,372 INFO L225 Difference]: With dead ends: 1224 [2022-02-20 19:56:55,372 INFO L226 Difference]: Without dead ends: 1030 [2022-02-20 19:56:55,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:56:55,375 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 1838 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:55,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1854 Valid, 1640 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:56:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-02-20 19:56:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 905. [2022-02-20 19:56:55,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:55,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1030 states. Second operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:55,438 INFO L74 IsIncluded]: Start isIncluded. First operand 1030 states. Second operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:55,440 INFO L87 Difference]: Start difference. First operand 1030 states. Second operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,495 INFO L93 Difference]: Finished difference Result 1030 states and 1339 transitions. [2022-02-20 19:56:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1339 transitions. [2022-02-20 19:56:55,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1030 states. [2022-02-20 19:56:55,501 INFO L87 Difference]: Start difference. First operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1030 states. [2022-02-20 19:56:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,558 INFO L93 Difference]: Finished difference Result 1030 states and 1339 transitions. [2022-02-20 19:56:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1339 transitions. [2022-02-20 19:56:55,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:55,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 734 states have internal predecessors, (980), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1192 transitions. [2022-02-20 19:56:55,619 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1192 transitions. Word has length 65 [2022-02-20 19:56:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:55,619 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1192 transitions. [2022-02-20 19:56:55,619 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1192 transitions. [2022-02-20 19:56:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:55,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:55,621 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:56:55,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:56:55,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1834753785, now seen corresponding path program 1 times [2022-02-20 19:56:55,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:55,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79822681] [2022-02-20 19:56:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {10642#(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); {10603#true} is VALID [2022-02-20 19:56:55,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10603#true} {10603#true} #764#return; {10603#true} is VALID [2022-02-20 19:56:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {10643#(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); {10603#true} is VALID [2022-02-20 19:56:55,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume !(0 == ~q_write_ev~0); {10603#true} is VALID [2022-02-20 19:56:55,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10603#true} {10603#true} #766#return; {10603#true} is VALID [2022-02-20 19:56:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {10603#true} havoc ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume !(1 == ~p_dw_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} ~__retres1~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {10603#true} #res := ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,745 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10603#true} {10603#true} #760#return; {10603#true} is VALID [2022-02-20 19:56:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {10603#true} havoc ~__retres1~1; {10603#true} is VALID [2022-02-20 19:56:55,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume !(1 == ~c_dr_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} ~__retres1~1 := 0; {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,792 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10603#true} #762#return; {10657#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {10644#(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; {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {10603#true} call #t~ret8 := is_do_write_p_triggered(); {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} havoc ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {10603#true} assume !(1 == ~p_dw_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {10603#true} ~__retres1~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {10603#true} #res := ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10603#true} {10603#true} #760#return; {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {10603#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {10603#true} assume !(0 != ~tmp~1); {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {10603#true} call #t~ret9 := is_do_read_c_triggered(); {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {10603#true} havoc ~__retres1~1; {10603#true} is VALID [2022-02-20 19:56:55,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {10603#true} assume !(1 == ~c_dr_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {10603#true} ~__retres1~1 := 0; {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,796 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10603#true} #762#return; {10657#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {10657#(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; {10658#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:55,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {10658#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10604#false} is VALID [2022-02-20 19:56:55,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {10604#false} assume true; {10604#false} is VALID [2022-02-20 19:56:55,798 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10604#false} {10603#true} #768#return; {10604#false} is VALID [2022-02-20 19:56:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {10643#(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); {10603#true} is VALID [2022-02-20 19:56:55,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10603#true} is VALID [2022-02-20 19:56:55,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10603#true} {10604#false} #770#return; {10604#false} is VALID [2022-02-20 19:56:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {10603#true} havoc ~__retres1~2; {10603#true} is VALID [2022-02-20 19:56:55,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10603#true} is VALID [2022-02-20 19:56:55,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} #res := ~__retres1~2; {10603#true} is VALID [2022-02-20 19:56:55,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,818 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10603#true} {10604#false} #772#return; {10604#false} is VALID [2022-02-20 19:56:55,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {10603#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {10603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {10603#true} is VALID [2022-02-20 19:56:55,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {10603#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {10603#true} is VALID [2022-02-20 19:56:55,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {10603#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {10603#true} is VALID [2022-02-20 19:56:55,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {10603#true} call update_channels1(); {10642#(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:56:55,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {10642#(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); {10603#true} is VALID [2022-02-20 19:56:55,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,820 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10603#true} {10603#true} #764#return; {10603#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {10603#true} assume { :begin_inline_init_threads1 } true; {10603#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {10603#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {10603#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {10603#true} assume { :end_inline_init_threads1 } true; {10603#true} is VALID [2022-02-20 19:56:55,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {10603#true} call fire_delta_events1(); {10643#(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:56:55,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {10643#(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); {10603#true} is VALID [2022-02-20 19:56:55,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {10603#true} assume !(0 == ~q_write_ev~0); {10603#true} is VALID [2022-02-20 19:56:55,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10603#true} {10603#true} #766#return; {10603#true} is VALID [2022-02-20 19:56:55,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {10603#true} call activate_threads1(); {10644#(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:56:55,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {10644#(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; {10603#true} is VALID [2022-02-20 19:56:55,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {10603#true} call #t~ret8 := is_do_write_p_triggered(); {10603#true} is VALID [2022-02-20 19:56:55,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {10603#true} havoc ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {10603#true} assume !(1 == ~p_dw_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {10603#true} ~__retres1~0 := 0; {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {10603#true} #res := ~__retres1~0; {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10603#true} {10603#true} #760#return; {10603#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {10603#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10603#true} is VALID [2022-02-20 19:56:55,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {10603#true} assume !(0 != ~tmp~1); {10603#true} is VALID [2022-02-20 19:56:55,824 INFO L272 TraceCheckUtils]: 28: Hoare triple {10603#true} call #t~ret9 := is_do_read_c_triggered(); {10603#true} is VALID [2022-02-20 19:56:55,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {10603#true} havoc ~__retres1~1; {10603#true} is VALID [2022-02-20 19:56:55,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {10603#true} assume !(1 == ~c_dr_pc~0); {10603#true} is VALID [2022-02-20 19:56:55,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {10603#true} ~__retres1~1 := 0; {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {10659#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,826 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10660#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10603#true} #762#return; {10657#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {10657#(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; {10658#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:55,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {10658#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10604#false} is VALID [2022-02-20 19:56:55,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {10604#false} assume true; {10604#false} is VALID [2022-02-20 19:56:55,827 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10604#false} {10603#true} #768#return; {10604#false} is VALID [2022-02-20 19:56:55,827 INFO L272 TraceCheckUtils]: 39: Hoare triple {10604#false} call reset_delta_events1(); {10643#(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:56:55,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {10643#(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); {10603#true} is VALID [2022-02-20 19:56:55,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {10603#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10603#true} is VALID [2022-02-20 19:56:55,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,828 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10603#true} {10604#false} #770#return; {10604#false} is VALID [2022-02-20 19:56:55,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {10604#false} assume !false; {10604#false} is VALID [2022-02-20 19:56:55,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {10604#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; {10604#false} is VALID [2022-02-20 19:56:55,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {10604#false} assume !false; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L272 TraceCheckUtils]: 47: Hoare triple {10604#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10603#true} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {10603#true} havoc ~__retres1~2; {10603#true} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {10603#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10603#true} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {10603#true} #res := ~__retres1~2; {10603#true} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {10603#true} assume true; {10603#true} is VALID [2022-02-20 19:56:55,829 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10603#true} {10604#false} #772#return; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {10604#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; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {10604#false} assume 0 != eval1_~tmp___1~0#1; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {10604#false} assume !(0 == ~p_dw_st~0); {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {10604#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; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {10604#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; {10604#false} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {10604#false} assume 0 == ~c_dr_pc~0; {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {10604#false} assume !false; {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {10604#false} assume !(1 == ~q_free~0); {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {10604#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; {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {10604#false} assume !(~p_last_write~0 == ~c_last_read~0); {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L272 TraceCheckUtils]: 63: Hoare triple {10604#false} call error1(); {10604#false} is VALID [2022-02-20 19:56:55,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {10604#false} assume !false; {10604#false} is VALID [2022-02-20 19:56:55,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:56:55,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:55,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79822681] [2022-02-20 19:56:55,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79822681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:55,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:55,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:55,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109421390] [2022-02-20 19:56:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:55,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:55,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:55,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:55,888 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:56:55,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:55,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:55,889 INFO L87 Difference]: Start difference. First operand 905 states and 1192 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,144 INFO L93 Difference]: Finished difference Result 1786 states and 2335 transitions. [2022-02-20 19:56:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:56:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 472 transitions. [2022-02-20 19:56:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 472 transitions. [2022-02-20 19:56:58,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 472 transitions. [2022-02-20 19:56:58,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:58,576 INFO L225 Difference]: With dead ends: 1786 [2022-02-20 19:56:58,576 INFO L226 Difference]: Without dead ends: 1017 [2022-02-20 19:56:58,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 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 19:56:58,586 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 250 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:58,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 1363 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-02-20 19:56:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 925. [2022-02-20 19:56:58,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:58,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1017 states. Second operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:58,677 INFO L74 IsIncluded]: Start isIncluded. First operand 1017 states. Second operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:58,679 INFO L87 Difference]: Start difference. First operand 1017 states. Second operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,732 INFO L93 Difference]: Finished difference Result 1017 states and 1319 transitions. [2022-02-20 19:56:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1319 transitions. [2022-02-20 19:56:58,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1017 states. [2022-02-20 19:56:58,740 INFO L87 Difference]: Start difference. First operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1017 states. [2022-02-20 19:56:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,793 INFO L93 Difference]: Finished difference Result 1017 states and 1319 transitions. [2022-02-20 19:56:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1319 transitions. [2022-02-20 19:56:58,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:58,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 736 states have (on average 1.346467391304348) internal successors, (991), 750 states have internal predecessors, (991), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1207 transitions. [2022-02-20 19:56:58,855 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1207 transitions. Word has length 65 [2022-02-20 19:56:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:58,856 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1207 transitions. [2022-02-20 19:56:58,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:56:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1207 transitions. [2022-02-20 19:56:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:58,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:58,857 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:56:58,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:56:58,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1074010117, now seen corresponding path program 1 times [2022-02-20 19:56:58,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:58,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881640711] [2022-02-20 19:56:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {16409#(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); {16410#(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:56:58,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16410#(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:56:58,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #764#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {16410#(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); {16410#(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:56:58,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {16410#(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:56:58,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16410#(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:56:58,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #766#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {16369#true} havoc ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:58,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {16369#true} assume !(1 == ~p_dw_pc~0); {16369#true} is VALID [2022-02-20 19:56:58,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {16369#true} ~__retres1~0 := 0; {16369#true} is VALID [2022-02-20 19:56:58,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {16369#true} #res := ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:58,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:58,953 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16369#true} {16369#true} #760#return; {16369#true} is VALID [2022-02-20 19:56:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {16369#true} havoc ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {16369#true} assume !(1 == ~c_dr_pc~0); {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {16369#true} ~__retres1~1 := 0; {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {16369#true} #res := ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16369#true} {16369#true} #762#return; {16369#true} is VALID [2022-02-20 19:56:58,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {16411#(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; {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L272 TraceCheckUtils]: 1: Hoare triple {16369#true} call #t~ret8 := is_do_write_p_triggered(); {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {16369#true} havoc ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {16369#true} assume !(1 == ~p_dw_pc~0); {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {16369#true} ~__retres1~0 := 0; {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {16369#true} #res := ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:58,969 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16369#true} {16369#true} #760#return; {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {16369#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {16369#true} assume !(0 != ~tmp~1); {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L272 TraceCheckUtils]: 10: Hoare triple {16369#true} call #t~ret9 := is_do_read_c_triggered(); {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {16369#true} havoc ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {16369#true} assume !(1 == ~c_dr_pc~0); {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {16369#true} ~__retres1~1 := 0; {16369#true} is VALID [2022-02-20 19:56:58,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {16369#true} #res := ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:58,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:58,971 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16369#true} {16369#true} #762#return; {16369#true} is VALID [2022-02-20 19:56:58,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {16369#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16369#true} is VALID [2022-02-20 19:56:58,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {16369#true} assume !(0 != ~tmp___0~1); {16369#true} is VALID [2022-02-20 19:56:58,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:58,976 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16369#true} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #768#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {16410#(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); {16424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:56:58,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {16424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:58,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:58,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #770#return; {16370#false} is VALID [2022-02-20 19:56:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {16369#true} havoc ~__retres1~2; {16369#true} is VALID [2022-02-20 19:56:59,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {16369#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16369#true} is VALID [2022-02-20 19:56:59,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {16369#true} #res := ~__retres1~2; {16369#true} is VALID [2022-02-20 19:56:59,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:59,003 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16369#true} {16370#false} #772#return; {16370#false} is VALID [2022-02-20 19:56:59,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {16369#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {16369#true} is VALID [2022-02-20 19:56:59,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {16369#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {16369#true} is VALID [2022-02-20 19:56:59,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {16369#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {16371#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {16409#(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:56:59,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {16409#(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); {16410#(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:56:59,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16410#(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:56:59,006 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #764#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {16410#(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:56:59,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {16410#(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); {16410#(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:56:59,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {16410#(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:56:59,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16410#(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:56:59,012 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16410#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #766#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,013 INFO L272 TraceCheckUtils]: 17: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {16411#(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:56:59,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {16411#(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; {16369#true} is VALID [2022-02-20 19:56:59,013 INFO L272 TraceCheckUtils]: 19: Hoare triple {16369#true} call #t~ret8 := is_do_write_p_triggered(); {16369#true} is VALID [2022-02-20 19:56:59,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {16369#true} havoc ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:59,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {16369#true} assume !(1 == ~p_dw_pc~0); {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {16369#true} ~__retres1~0 := 0; {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {16369#true} #res := ~__retres1~0; {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16369#true} {16369#true} #760#return; {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {16369#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {16369#true} assume !(0 != ~tmp~1); {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L272 TraceCheckUtils]: 28: Hoare triple {16369#true} call #t~ret9 := is_do_read_c_triggered(); {16369#true} is VALID [2022-02-20 19:56:59,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {16369#true} havoc ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {16369#true} assume !(1 == ~c_dr_pc~0); {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {16369#true} ~__retres1~1 := 0; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {16369#true} #res := ~__retres1~1; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16369#true} {16369#true} #762#return; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {16369#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16369#true} is VALID [2022-02-20 19:56:59,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {16369#true} assume !(0 != ~tmp___0~1); {16369#true} is VALID [2022-02-20 19:56:59,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:59,018 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16369#true} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #768#return; {16371#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:59,019 INFO L272 TraceCheckUtils]: 39: Hoare triple {16371#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {16410#(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:56:59,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {16410#(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); {16424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:56:59,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {16424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:59,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:59,020 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16425#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16371#(= ~q_write_ev~0 ~q_read_ev~0)} #770#return; {16370#false} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {16370#false} assume !false; {16370#false} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {16370#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; {16370#false} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {16370#false} assume !false; {16370#false} is VALID [2022-02-20 19:56:59,021 INFO L272 TraceCheckUtils]: 47: Hoare triple {16370#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16369#true} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {16369#true} havoc ~__retres1~2; {16369#true} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {16369#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16369#true} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {16369#true} #res := ~__retres1~2; {16369#true} is VALID [2022-02-20 19:56:59,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {16369#true} assume true; {16369#true} is VALID [2022-02-20 19:56:59,022 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16369#true} {16370#false} #772#return; {16370#false} is VALID [2022-02-20 19:56:59,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {16370#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; {16370#false} is VALID [2022-02-20 19:56:59,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {16370#false} assume 0 != eval1_~tmp___1~0#1; {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {16370#false} assume !(0 == ~p_dw_st~0); {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {16370#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; {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {16370#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; {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {16370#false} assume 0 == ~c_dr_pc~0; {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {16370#false} assume !false; {16370#false} is VALID [2022-02-20 19:56:59,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {16370#false} assume !(1 == ~q_free~0); {16370#false} is VALID [2022-02-20 19:56:59,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {16370#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; {16370#false} is VALID [2022-02-20 19:56:59,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {16370#false} assume !(~p_last_write~0 == ~c_last_read~0); {16370#false} is VALID [2022-02-20 19:56:59,024 INFO L272 TraceCheckUtils]: 63: Hoare triple {16370#false} call error1(); {16370#false} is VALID [2022-02-20 19:56:59,024 INFO L290 TraceCheckUtils]: 64: Hoare triple {16370#false} assume !false; {16370#false} is VALID [2022-02-20 19:56:59,024 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:56:59,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:59,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881640711] [2022-02-20 19:56:59,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881640711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:59,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:59,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:59,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813652367] [2022-02-20 19:56:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:59,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:59,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:59,065 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:56:59,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:59,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:59,067 INFO L87 Difference]: Start difference. First operand 925 states and 1207 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,678 INFO L93 Difference]: Finished difference Result 2493 states and 3154 transitions. [2022-02-20 19:57:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 638 transitions. [2022-02-20 19:57:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 638 transitions. [2022-02-20 19:57:01,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 638 transitions. [2022-02-20 19:57:02,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:02,339 INFO L225 Difference]: With dead ends: 2493 [2022-02-20 19:57:02,340 INFO L226 Difference]: Without dead ends: 1705 [2022-02-20 19:57:02,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:57:02,344 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 636 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:02,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 1088 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-02-20 19:57:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1373. [2022-02-20 19:57:02,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:02,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1705 states. Second operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:57:02,463 INFO L74 IsIncluded]: Start isIncluded. First operand 1705 states. Second operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:57:02,475 INFO L87 Difference]: Start difference. First operand 1705 states. Second operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:57:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,609 INFO L93 Difference]: Finished difference Result 1705 states and 2131 transitions. [2022-02-20 19:57:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2131 transitions. [2022-02-20 19:57:02,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1705 states. [2022-02-20 19:57:02,619 INFO L87 Difference]: Start difference. First operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1705 states. [2022-02-20 19:57:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,762 INFO L93 Difference]: Finished difference Result 1705 states and 2131 transitions. [2022-02-20 19:57:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2131 transitions. [2022-02-20 19:57:02,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:02,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1112 states have internal predecessors, (1440), 144 states have call successors, (144), 113 states have call predecessors, (144), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:57:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1774 transitions. [2022-02-20 19:57:02,909 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1774 transitions. Word has length 65 [2022-02-20 19:57:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:02,909 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 1774 transitions. [2022-02-20 19:57:02,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1774 transitions. [2022-02-20 19:57:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:02,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:02,911 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:57:02,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:02,911 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1208023623, now seen corresponding path program 1 times [2022-02-20 19:57:02,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:02,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590026425] [2022-02-20 19:57:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {25086#(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); {25046#true} is VALID [2022-02-20 19:57:02,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:02,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25046#true} {25046#true} #764#return; {25046#true} is VALID [2022-02-20 19:57:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {25087#(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); {25046#true} is VALID [2022-02-20 19:57:02,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume !(0 == ~q_write_ev~0); {25046#true} is VALID [2022-02-20 19:57:02,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:02,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25046#true} {25051#(= ~p_dw_st~0 0)} #766#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {25046#true} havoc ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:02,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume !(1 == ~p_dw_pc~0); {25046#true} is VALID [2022-02-20 19:57:02,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} ~__retres1~0 := 0; {25046#true} is VALID [2022-02-20 19:57:02,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {25046#true} #res := ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:02,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:02,986 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #760#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {25046#true} havoc ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:02,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume !(1 == ~c_dr_pc~0); {25046#true} is VALID [2022-02-20 19:57:02,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} ~__retres1~1 := 0; {25046#true} is VALID [2022-02-20 19:57:02,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {25046#true} #res := ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:02,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:02,991 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #762#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:02,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {25088#(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; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,004 INFO L272 TraceCheckUtils]: 1: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {25046#true} is VALID [2022-02-20 19:57:03,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} havoc ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:03,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {25046#true} assume !(1 == ~p_dw_pc~0); {25046#true} is VALID [2022-02-20 19:57:03,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {25046#true} ~__retres1~0 := 0; {25046#true} is VALID [2022-02-20 19:57:03,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {25046#true} #res := ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:03,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,017 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #760#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,018 INFO L272 TraceCheckUtils]: 10: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {25046#true} is VALID [2022-02-20 19:57:03,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {25046#true} havoc ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:03,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {25046#true} assume !(1 == ~c_dr_pc~0); {25046#true} is VALID [2022-02-20 19:57:03,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {25046#true} ~__retres1~1 := 0; {25046#true} is VALID [2022-02-20 19:57:03,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {25046#true} #res := ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:03,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,019 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #762#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,021 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {25051#(= ~p_dw_st~0 0)} #768#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {25087#(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); {25046#true} is VALID [2022-02-20 19:57:03,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume !(1 == ~q_write_ev~0); {25046#true} is VALID [2022-02-20 19:57:03,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25046#true} {25051#(= ~p_dw_st~0 0)} #770#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {25046#true} havoc ~__retres1~2; {25046#true} is VALID [2022-02-20 19:57:03,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {25051#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {25051#(= ~p_dw_st~0 0)} assume true; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,037 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25051#(= ~p_dw_st~0 0)} {25051#(= ~p_dw_st~0 0)} #772#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {25046#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {25046#true} is VALID [2022-02-20 19:57:03,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {25046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {25046#true} is VALID [2022-02-20 19:57:03,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {25046#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {25046#true} is VALID [2022-02-20 19:57:03,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {25046#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {25046#true} is VALID [2022-02-20 19:57:03,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {25046#true} call update_channels1(); {25086#(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:57:03,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {25086#(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); {25046#true} is VALID [2022-02-20 19:57:03,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,039 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25046#true} {25046#true} #764#return; {25046#true} is VALID [2022-02-20 19:57:03,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {25046#true} assume { :begin_inline_init_threads1 } true; {25046#true} is VALID [2022-02-20 19:57:03,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {25046#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {25051#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {25051#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {25051#(= ~p_dw_st~0 0)} call fire_delta_events1(); {25087#(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:57:03,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {25087#(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); {25046#true} is VALID [2022-02-20 19:57:03,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {25046#true} assume !(0 == ~q_write_ev~0); {25046#true} is VALID [2022-02-20 19:57:03,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,041 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25046#true} {25051#(= ~p_dw_st~0 0)} #766#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,041 INFO L272 TraceCheckUtils]: 17: Hoare triple {25051#(= ~p_dw_st~0 0)} call activate_threads1(); {25088#(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:57:03,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {25088#(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; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {25046#true} is VALID [2022-02-20 19:57:03,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {25046#true} havoc ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:03,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {25046#true} assume !(1 == ~p_dw_pc~0); {25046#true} is VALID [2022-02-20 19:57:03,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {25046#true} ~__retres1~0 := 0; {25046#true} is VALID [2022-02-20 19:57:03,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {25046#true} #res := ~__retres1~0; {25046#true} is VALID [2022-02-20 19:57:03,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,043 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #760#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,044 INFO L272 TraceCheckUtils]: 28: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {25046#true} is VALID [2022-02-20 19:57:03,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {25046#true} havoc ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:03,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {25046#true} assume !(1 == ~c_dr_pc~0); {25046#true} is VALID [2022-02-20 19:57:03,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {25046#true} ~__retres1~1 := 0; {25046#true} is VALID [2022-02-20 19:57:03,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {25046#true} #res := ~__retres1~1; {25046#true} is VALID [2022-02-20 19:57:03,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,045 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25046#true} {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #762#return; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:03,047 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25089#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {25051#(= ~p_dw_st~0 0)} #768#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,047 INFO L272 TraceCheckUtils]: 39: Hoare triple {25051#(= ~p_dw_st~0 0)} call reset_delta_events1(); {25087#(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:57:03,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {25087#(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); {25046#true} is VALID [2022-02-20 19:57:03,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {25046#true} assume !(1 == ~q_write_ev~0); {25046#true} is VALID [2022-02-20 19:57:03,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {25046#true} assume true; {25046#true} is VALID [2022-02-20 19:57:03,048 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {25046#true} {25051#(= ~p_dw_st~0 0)} #770#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {25051#(= ~p_dw_st~0 0)} assume !false; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {25051#(= ~p_dw_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; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {25051#(= ~p_dw_st~0 0)} assume !false; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,049 INFO L272 TraceCheckUtils]: 47: Hoare triple {25051#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {25046#true} is VALID [2022-02-20 19:57:03,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {25046#true} havoc ~__retres1~2; {25046#true} is VALID [2022-02-20 19:57:03,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {25046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {25051#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {25051#(= ~p_dw_st~0 0)} assume true; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,051 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25051#(= ~p_dw_st~0 0)} {25051#(= ~p_dw_st~0 0)} #772#return; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {25051#(= ~p_dw_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; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {25051#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {25051#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:03,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {25051#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {25047#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; {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {25047#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; {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {25047#false} assume 0 == ~c_dr_pc~0; {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {25047#false} assume !false; {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {25047#false} assume !(1 == ~q_free~0); {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {25047#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; {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {25047#false} assume !(~p_last_write~0 == ~c_last_read~0); {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L272 TraceCheckUtils]: 63: Hoare triple {25047#false} call error1(); {25047#false} is VALID [2022-02-20 19:57:03,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {25047#false} assume !false; {25047#false} is VALID [2022-02-20 19:57:03,053 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:57:03,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:03,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590026425] [2022-02-20 19:57:03,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590026425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:03,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:03,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:03,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851112157] [2022-02-20 19:57:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:03,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 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:57:03,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:03,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:03,093 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:57:03,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:03,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:03,093 INFO L87 Difference]: Start difference. First operand 1373 states and 1774 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:05,351 INFO L93 Difference]: Finished difference Result 3844 states and 4913 transitions. [2022-02-20 19:57:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 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:57:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2022-02-20 19:57:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2022-02-20 19:57:05,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 582 transitions. [2022-02-20 19:57:05,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:06,171 INFO L225 Difference]: With dead ends: 3844 [2022-02-20 19:57:06,171 INFO L226 Difference]: Without dead ends: 2610 [2022-02-20 19:57:06,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:06,174 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 600 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:06,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 878 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-02-20 19:57:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2502. [2022-02-20 19:57:06,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:06,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2610 states. Second operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:06,372 INFO L74 IsIncluded]: Start isIncluded. First operand 2610 states. Second operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:06,376 INFO L87 Difference]: Start difference. First operand 2610 states. Second operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,673 INFO L93 Difference]: Finished difference Result 2610 states and 3280 transitions. [2022-02-20 19:57:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3280 transitions. [2022-02-20 19:57:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) Second operand 2610 states. [2022-02-20 19:57:06,690 INFO L87 Difference]: Start difference. First operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) Second operand 2610 states. [2022-02-20 19:57:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,983 INFO L93 Difference]: Finished difference Result 2610 states and 3280 transitions. [2022-02-20 19:57:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3280 transitions. [2022-02-20 19:57:06,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:06,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 1958 states have (on average 1.2727272727272727) internal successors, (2492), 2002 states have internal predecessors, (2492), 268 states have call successors, (268), 219 states have call predecessors, (268), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3158 transitions. [2022-02-20 19:57:07,343 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3158 transitions. Word has length 65 [2022-02-20 19:57:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:07,344 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 3158 transitions. [2022-02-20 19:57:07,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3158 transitions. [2022-02-20 19:57:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:07,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:07,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:07,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:07,346 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1889239193, now seen corresponding path program 1 times [2022-02-20 19:57:07,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:07,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444926329] [2022-02-20 19:57:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {38933#(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); {38893#true} is VALID [2022-02-20 19:57:07,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #764#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {38934#(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); {38893#true} is VALID [2022-02-20 19:57:07,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume !(0 == ~q_write_ev~0); {38893#true} is VALID [2022-02-20 19:57:07,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #766#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {38893#true} havoc ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume !(1 == ~p_dw_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} ~__retres1~0 := 0; {38893#true} is VALID [2022-02-20 19:57:07,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {38893#true} #res := ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,429 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38893#true} {38893#true} #760#return; {38893#true} is VALID [2022-02-20 19:57:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {38893#true} havoc ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume !(1 == ~c_dr_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} ~__retres1~1 := 0; {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {38893#true} #res := ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38893#true} {38893#true} #762#return; {38893#true} is VALID [2022-02-20 19:57:07,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {38935#(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; {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L272 TraceCheckUtils]: 1: Hoare triple {38893#true} call #t~ret8 := is_do_write_p_triggered(); {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} havoc ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {38893#true} assume !(1 == ~p_dw_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {38893#true} ~__retres1~0 := 0; {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {38893#true} #res := ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,433 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38893#true} {38893#true} #760#return; {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {38893#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {38893#true} assume !(0 != ~tmp~1); {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L272 TraceCheckUtils]: 10: Hoare triple {38893#true} call #t~ret9 := is_do_read_c_triggered(); {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {38893#true} havoc ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {38893#true} assume !(1 == ~c_dr_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {38893#true} ~__retres1~1 := 0; {38893#true} is VALID [2022-02-20 19:57:07,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {38893#true} #res := ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,435 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38893#true} {38893#true} #762#return; {38893#true} is VALID [2022-02-20 19:57:07,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {38893#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38893#true} is VALID [2022-02-20 19:57:07,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {38893#true} assume !(0 != ~tmp___0~1); {38893#true} is VALID [2022-02-20 19:57:07,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,436 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #768#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {38934#(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); {38893#true} is VALID [2022-02-20 19:57:07,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume !(1 == ~q_write_ev~0); {38893#true} is VALID [2022-02-20 19:57:07,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #770#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {38893#true} havoc ~__retres1~2; {38893#true} is VALID [2022-02-20 19:57:07,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38893#true} is VALID [2022-02-20 19:57:07,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} #res := ~__retres1~2; {38893#true} is VALID [2022-02-20 19:57:07,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,449 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #772#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {38893#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {38893#true} is VALID [2022-02-20 19:57:07,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {38893#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {38893#true} is VALID [2022-02-20 19:57:07,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {38893#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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;~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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {38895#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {38895#(= ~q_free~0 1)} call update_channels1(); {38933#(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:57:07,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {38933#(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); {38893#true} is VALID [2022-02-20 19:57:07,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,451 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #764#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {38895#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {38895#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {38895#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {38895#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,453 INFO L272 TraceCheckUtils]: 12: Hoare triple {38895#(= ~q_free~0 1)} call fire_delta_events1(); {38934#(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:57:07,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {38934#(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); {38893#true} is VALID [2022-02-20 19:57:07,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {38893#true} assume !(0 == ~q_write_ev~0); {38893#true} is VALID [2022-02-20 19:57:07,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,454 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #766#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,454 INFO L272 TraceCheckUtils]: 17: Hoare triple {38895#(= ~q_free~0 1)} call activate_threads1(); {38935#(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:57:07,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {38935#(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; {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {38893#true} call #t~ret8 := is_do_write_p_triggered(); {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {38893#true} havoc ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {38893#true} assume !(1 == ~p_dw_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {38893#true} ~__retres1~0 := 0; {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {38893#true} #res := ~__retres1~0; {38893#true} is VALID [2022-02-20 19:57:07,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38893#true} {38893#true} #760#return; {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {38893#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {38893#true} assume !(0 != ~tmp~1); {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L272 TraceCheckUtils]: 28: Hoare triple {38893#true} call #t~ret9 := is_do_read_c_triggered(); {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {38893#true} havoc ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {38893#true} assume !(1 == ~c_dr_pc~0); {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {38893#true} ~__retres1~1 := 0; {38893#true} is VALID [2022-02-20 19:57:07,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {38893#true} #res := ~__retres1~1; {38893#true} is VALID [2022-02-20 19:57:07,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,457 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38893#true} {38893#true} #762#return; {38893#true} is VALID [2022-02-20 19:57:07,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {38893#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38893#true} is VALID [2022-02-20 19:57:07,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {38893#true} assume !(0 != ~tmp___0~1); {38893#true} is VALID [2022-02-20 19:57:07,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,458 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #768#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,458 INFO L272 TraceCheckUtils]: 39: Hoare triple {38895#(= ~q_free~0 1)} call reset_delta_events1(); {38934#(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:57:07,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {38934#(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); {38893#true} is VALID [2022-02-20 19:57:07,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {38893#true} assume !(1 == ~q_write_ev~0); {38893#true} is VALID [2022-02-20 19:57:07,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,459 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #770#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {38895#(= ~q_free~0 1)} assume !false; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {38895#(= ~q_free~0 1)} 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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {38895#(= ~q_free~0 1)} assume !false; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,460 INFO L272 TraceCheckUtils]: 47: Hoare triple {38895#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38893#true} is VALID [2022-02-20 19:57:07,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {38893#true} havoc ~__retres1~2; {38893#true} is VALID [2022-02-20 19:57:07,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {38893#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38893#true} is VALID [2022-02-20 19:57:07,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {38893#true} #res := ~__retres1~2; {38893#true} is VALID [2022-02-20 19:57:07,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {38893#true} assume true; {38893#true} is VALID [2022-02-20 19:57:07,461 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38893#true} {38895#(= ~q_free~0 1)} #772#return; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {38895#(= ~q_free~0 1)} 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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {38895#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {38895#(= ~q_free~0 1)} 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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {38895#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {38895#(= ~q_free~0 1)} 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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {38895#(= ~q_free~0 1)} 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; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {38895#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {38895#(= ~q_free~0 1)} assume !false; {38895#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {38895#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {38894#false} is VALID [2022-02-20 19:57:07,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {38894#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; {38894#false} is VALID [2022-02-20 19:57:07,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {38894#false} assume !(~p_last_write~0 == ~c_last_read~0); {38894#false} is VALID [2022-02-20 19:57:07,464 INFO L272 TraceCheckUtils]: 64: Hoare triple {38894#false} call error1(); {38894#false} is VALID [2022-02-20 19:57:07,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {38894#false} assume !false; {38894#false} is VALID [2022-02-20 19:57:07,465 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:57:07,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:07,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444926329] [2022-02-20 19:57:07,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444926329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:07,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:07,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:07,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283141543] [2022-02-20 19:57:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:07,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:07,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:07,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:07,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:07,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:07,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:07,508 INFO L87 Difference]: Start difference. First operand 2502 states and 3158 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,228 INFO L93 Difference]: Finished difference Result 5824 states and 7332 transitions. [2022-02-20 19:57:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 581 transitions. [2022-02-20 19:57:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 581 transitions. [2022-02-20 19:57:10,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 581 transitions. [2022-02-20 19:57:10,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:11,196 INFO L225 Difference]: With dead ends: 5824 [2022-02-20 19:57:11,196 INFO L226 Difference]: Without dead ends: 3461 [2022-02-20 19:57:11,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:11,200 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 574 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:11,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 718 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2022-02-20 19:57:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3207. [2022-02-20 19:57:11,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:11,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3461 states. Second operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:11,449 INFO L74 IsIncluded]: Start isIncluded. First operand 3461 states. Second operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:11,454 INFO L87 Difference]: Start difference. First operand 3461 states. Second operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,915 INFO L93 Difference]: Finished difference Result 3461 states and 4306 transitions. [2022-02-20 19:57:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4306 transitions. [2022-02-20 19:57:11,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:11,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:11,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3461 states. [2022-02-20 19:57:11,933 INFO L87 Difference]: Start difference. First operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3461 states. [2022-02-20 19:57:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,337 INFO L93 Difference]: Finished difference Result 3461 states and 4306 transitions. [2022-02-20 19:57:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4306 transitions. [2022-02-20 19:57:12,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:12,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:12,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:12,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 2506 states have (on average 1.2637669592976855) internal successors, (3167), 2556 states have internal predecessors, (3167), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 4005 transitions. [2022-02-20 19:57:12,990 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 4005 transitions. Word has length 66 [2022-02-20 19:57:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:12,990 INFO L470 AbstractCegarLoop]: Abstraction has 3207 states and 4005 transitions. [2022-02-20 19:57:12,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 4005 transitions. [2022-02-20 19:57:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:57:12,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:12,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:12,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:12,992 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1540602375, now seen corresponding path program 1 times [2022-02-20 19:57:12,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:12,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553155948] [2022-02-20 19:57:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,024 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {58026#true} {58028#(= ~m_i~0 1)} #788#return; {58028#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {58026#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {58026#true} assume !(0 == ~T2_E~0); {58026#true} is VALID [2022-02-20 19:57:13,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {58026#true} assume 0 == ~E_M~0;~E_M~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {58026#true} assume 0 == ~E_1~0;~E_1~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {58026#true} assume 0 == ~E_2~0;~E_2~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,036 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58026#true} {58027#false} #790#return; {58027#false} is VALID [2022-02-20 19:57:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {58073#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {58026#true} is VALID [2022-02-20 19:57:13,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {58026#true} assume !(1 == ~m_pc~0); {58026#true} is VALID [2022-02-20 19:57:13,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {58026#true} is_master_triggered_~__retres1~4#1 := 0; {58026#true} is VALID [2022-02-20 19:57:13,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {58026#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {58026#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {58026#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {58026#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; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {58026#true} assume 1 == ~t1_pc~0; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {58026#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {58026#true} is VALID [2022-02-20 19:57:13,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {58026#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {58026#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {58026#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {58026#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; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {58026#true} assume !(1 == ~t2_pc~0); {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {58026#true} is_transmit2_triggered_~__retres1~6#1 := 0; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {58026#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {58026#true} is VALID [2022-02-20 19:57:13,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {58026#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {58026#true} is VALID [2022-02-20 19:57:13,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {58026#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,050 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {58026#true} {58027#false} #792#return; {58027#false} is VALID [2022-02-20 19:57:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {58026#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {58026#true} assume !(1 == ~T2_E~0); {58026#true} is VALID [2022-02-20 19:57:13,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {58026#true} assume 1 == ~E_M~0;~E_M~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {58026#true} assume 1 == ~E_1~0;~E_1~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {58026#true} assume 1 == ~E_2~0;~E_2~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58026#true} {58027#false} #794#return; {58027#false} is VALID [2022-02-20 19:57:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {58026#true} havoc ~__retres1~7; {58026#true} is VALID [2022-02-20 19:57:13,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {58026#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {58026#true} is VALID [2022-02-20 19:57:13,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {58026#true} #res := ~__retres1~7; {58026#true} is VALID [2022-02-20 19:57:13,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,058 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58026#true} {58027#false} #796#return; {58027#false} is VALID [2022-02-20 19:57:13,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {58026#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {58026#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {58026#true} is VALID [2022-02-20 19:57:13,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {58026#true} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {58028#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:13,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {58028#(= ~m_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {58028#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:13,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {58028#(= ~m_i~0 1)} call update_channels2(); {58026#true} is VALID [2022-02-20 19:57:13,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,060 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58026#true} {58028#(= ~m_i~0 1)} #788#return; {58028#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:13,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {58028#(= ~m_i~0 1)} assume { :begin_inline_init_threads2 } true; {58028#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:13,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {58028#(= ~m_i~0 1)} assume !(1 == ~m_i~0);~m_st~0 := 2; {58027#false} is VALID [2022-02-20 19:57:13,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {58027#false} assume 1 == ~t1_i~0;~t1_st~0 := 0; {58027#false} is VALID [2022-02-20 19:57:13,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {58027#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {58027#false} is VALID [2022-02-20 19:57:13,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {58027#false} assume { :end_inline_init_threads2 } true; {58027#false} is VALID [2022-02-20 19:57:13,062 INFO L272 TraceCheckUtils]: 12: Hoare triple {58027#false} call fire_delta_events2(); {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {58026#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {58026#true} assume !(0 == ~T2_E~0); {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {58026#true} assume 0 == ~E_M~0;~E_M~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {58026#true} assume 0 == ~E_1~0;~E_1~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {58026#true} assume 0 == ~E_2~0;~E_2~0 := 1; {58026#true} is VALID [2022-02-20 19:57:13,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {58026#true} {58027#false} #790#return; {58027#false} is VALID [2022-02-20 19:57:13,063 INFO L272 TraceCheckUtils]: 21: Hoare triple {58027#false} call activate_threads2(); {58073#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {58073#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {58026#true} assume !(1 == ~m_pc~0); {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {58026#true} is_master_triggered_~__retres1~4#1 := 0; {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {58026#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {58026#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {58026#true} is VALID [2022-02-20 19:57:13,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {58026#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {58026#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; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {58026#true} assume 1 == ~t1_pc~0; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {58026#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {58026#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {58026#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {58026#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {58026#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; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {58026#true} assume !(1 == ~t2_pc~0); {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {58026#true} is_transmit2_triggered_~__retres1~6#1 := 0; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {58026#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {58026#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {58026#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,065 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {58026#true} {58027#false} #792#return; {58027#false} is VALID [2022-02-20 19:57:13,065 INFO L272 TraceCheckUtils]: 42: Hoare triple {58027#false} call reset_delta_events2(); {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {58072#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {58026#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {58026#true} assume !(1 == ~T2_E~0); {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {58026#true} assume 1 == ~E_M~0;~E_M~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {58026#true} assume 1 == ~E_1~0;~E_1~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {58026#true} assume 1 == ~E_2~0;~E_2~0 := 2; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,066 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {58026#true} {58027#false} #794#return; {58027#false} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {58027#false} assume !false; {58027#false} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {58027#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {58027#false} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {58027#false} assume !false; {58027#false} is VALID [2022-02-20 19:57:13,067 INFO L272 TraceCheckUtils]: 54: Hoare triple {58027#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {58026#true} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {58026#true} havoc ~__retres1~7; {58026#true} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {58026#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {58026#true} is VALID [2022-02-20 19:57:13,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {58026#true} #res := ~__retres1~7; {58026#true} is VALID [2022-02-20 19:57:13,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {58026#true} assume true; {58026#true} is VALID [2022-02-20 19:57:13,068 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {58026#true} {58027#false} #796#return; {58027#false} is VALID [2022-02-20 19:57:13,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {58027#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {58027#false} is VALID [2022-02-20 19:57:13,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {58027#false} assume 0 != eval2_~tmp~5#1; {58027#false} is VALID [2022-02-20 19:57:13,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {58027#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {58027#false} is VALID [2022-02-20 19:57:13,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {58027#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {58027#false} is VALID [2022-02-20 19:57:13,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {58027#false} assume !(0 == ~m_pc~0); {58027#false} is VALID [2022-02-20 19:57:13,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {58027#false} assume 1 == ~m_pc~0; {58027#false} is VALID [2022-02-20 19:57:13,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {58027#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {58027#false} is VALID [2022-02-20 19:57:13,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {58027#false} assume !false; {58027#false} is VALID [2022-02-20 19:57:13,074 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:57:13,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553155948] [2022-02-20 19:57:13,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553155948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:57:13,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785859447] [2022-02-20 19:57:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:13,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:13,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:13,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:57:13,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:57:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:57:13,123 INFO L87 Difference]: Start difference. First operand 3207 states and 4005 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:14,762 INFO L93 Difference]: Finished difference Result 3360 states and 4237 transitions. [2022-02-20 19:57:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:57:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 548 transitions. [2022-02-20 19:57:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 548 transitions. [2022-02-20 19:57:14,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 548 transitions. [2022-02-20 19:57:15,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:15,601 INFO L225 Difference]: With dead ends: 3360 [2022-02-20 19:57:15,601 INFO L226 Difference]: Without dead ends: 3239 [2022-02-20 19:57:15,602 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 19:57:15,603 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 382 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:15,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 628 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-02-20 19:57:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3207. [2022-02-20 19:57:15,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:15,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3239 states. Second operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:15,897 INFO L74 IsIncluded]: Start isIncluded. First operand 3239 states. Second operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:15,901 INFO L87 Difference]: Start difference. First operand 3239 states. Second operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,244 INFO L93 Difference]: Finished difference Result 3239 states and 4059 transitions. [2022-02-20 19:57:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4059 transitions. [2022-02-20 19:57:16,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3239 states. [2022-02-20 19:57:16,260 INFO L87 Difference]: Start difference. First operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3239 states. [2022-02-20 19:57:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,618 INFO L93 Difference]: Finished difference Result 3239 states and 4059 transitions. [2022-02-20 19:57:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4059 transitions. [2022-02-20 19:57:16,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:16,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 2506 states have (on average 1.2633679169992018) internal successors, (3166), 2556 states have internal predecessors, (3166), 344 states have call successors, (344), 285 states have call predecessors, (344), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 4004 transitions. [2022-02-20 19:57:17,161 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 4004 transitions. Word has length 68 [2022-02-20 19:57:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:17,161 INFO L470 AbstractCegarLoop]: Abstraction has 3207 states and 4004 transitions. [2022-02-20 19:57:17,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 4004 transitions. [2022-02-20 19:57:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:57:17,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:17,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:17,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:17,162 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1338778441, now seen corresponding path program 1 times [2022-02-20 19:57:17,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:17,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559572772] [2022-02-20 19:57:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,185 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {73420#true} {73422#(= ~M_E~0 2)} #788#return; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume true; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,207 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73467#(= |old(~M_E~0)| 0)} {73422#(= ~M_E~0 2)} #790#return; {73421#false} is VALID [2022-02-20 19:57:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {73468#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {73420#true} is VALID [2022-02-20 19:57:17,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {73420#true} assume !(1 == ~m_pc~0); {73420#true} is VALID [2022-02-20 19:57:17,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {73420#true} is_master_triggered_~__retres1~4#1 := 0; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {73420#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {73420#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {73420#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {73420#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; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {73420#true} assume 1 == ~t1_pc~0; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {73420#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {73420#true} is VALID [2022-02-20 19:57:17,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {73420#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {73420#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {73420#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {73420#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; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {73420#true} assume !(1 == ~t2_pc~0); {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {73420#true} is_transmit2_triggered_~__retres1~6#1 := 0; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {73420#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {73420#true} is VALID [2022-02-20 19:57:17,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {73420#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {73420#true} is VALID [2022-02-20 19:57:17,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {73420#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,223 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {73420#true} {73421#false} #792#return; {73421#false} is VALID [2022-02-20 19:57:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {73420#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {73420#true} assume !(1 == ~T2_E~0); {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {73420#true} assume 1 == ~E_M~0;~E_M~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {73420#true} assume 1 == ~E_1~0;~E_1~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {73420#true} assume 1 == ~E_2~0;~E_2~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,228 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73420#true} {73421#false} #794#return; {73421#false} is VALID [2022-02-20 19:57:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:17,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {73420#true} havoc ~__retres1~7; {73420#true} is VALID [2022-02-20 19:57:17,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {73420#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {73420#true} is VALID [2022-02-20 19:57:17,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {73420#true} #res := ~__retres1~7; {73420#true} is VALID [2022-02-20 19:57:17,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,231 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73420#true} {73421#false} #796#return; {73421#false} is VALID [2022-02-20 19:57:17,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {73420#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {73422#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {73422#(= ~M_E~0 2)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {73422#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {73422#(= ~M_E~0 2)} call update_channels2(); {73420#true} is VALID [2022-02-20 19:57:17,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,238 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {73420#true} {73422#(= ~M_E~0 2)} #788#return; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {73422#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {73422#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {73422#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {73422#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {73422#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {73422#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:17,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {73422#(= ~M_E~0 2)} call fire_delta_events2(); {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:17,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {73467#(= |old(~M_E~0)| 0)} assume true; {73467#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:17,243 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {73467#(= |old(~M_E~0)| 0)} {73422#(= ~M_E~0 2)} #790#return; {73421#false} is VALID [2022-02-20 19:57:17,243 INFO L272 TraceCheckUtils]: 21: Hoare triple {73421#false} call activate_threads2(); {73468#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {73468#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {73420#true} assume !(1 == ~m_pc~0); {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {73420#true} is_master_triggered_~__retres1~4#1 := 0; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {73420#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {73420#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {73420#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {73420#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; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {73420#true} assume 1 == ~t1_pc~0; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {73420#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {73420#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {73420#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {73420#true} is VALID [2022-02-20 19:57:17,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {73420#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {73420#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; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {73420#true} assume !(1 == ~t2_pc~0); {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {73420#true} is_transmit2_triggered_~__retres1~6#1 := 0; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {73420#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {73420#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {73420#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {73420#true} is VALID [2022-02-20 19:57:17,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,245 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {73420#true} {73421#false} #792#return; {73421#false} is VALID [2022-02-20 19:57:17,245 INFO L272 TraceCheckUtils]: 42: Hoare triple {73421#false} call reset_delta_events2(); {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:17,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {73466#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {73420#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {73420#true} assume !(1 == ~T2_E~0); {73420#true} is VALID [2022-02-20 19:57:17,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {73420#true} assume 1 == ~E_M~0;~E_M~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {73420#true} assume 1 == ~E_1~0;~E_1~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {73420#true} assume 1 == ~E_2~0;~E_2~0 := 2; {73420#true} is VALID [2022-02-20 19:57:17,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {73420#true} {73421#false} #794#return; {73421#false} is VALID [2022-02-20 19:57:17,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {73421#false} assume !false; {73421#false} is VALID [2022-02-20 19:57:17,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {73421#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {73421#false} is VALID [2022-02-20 19:57:17,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {73421#false} assume !false; {73421#false} is VALID [2022-02-20 19:57:17,246 INFO L272 TraceCheckUtils]: 54: Hoare triple {73421#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {73420#true} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {73420#true} havoc ~__retres1~7; {73420#true} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {73420#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {73420#true} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {73420#true} #res := ~__retres1~7; {73420#true} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {73420#true} assume true; {73420#true} is VALID [2022-02-20 19:57:17,247 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {73420#true} {73421#false} #796#return; {73421#false} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {73421#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {73421#false} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {73421#false} assume 0 != eval2_~tmp~5#1; {73421#false} is VALID [2022-02-20 19:57:17,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {73421#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {73421#false} is VALID [2022-02-20 19:57:17,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {73421#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {73421#false} is VALID [2022-02-20 19:57:17,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {73421#false} assume !(0 == ~m_pc~0); {73421#false} is VALID [2022-02-20 19:57:17,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {73421#false} assume 1 == ~m_pc~0; {73421#false} is VALID [2022-02-20 19:57:17,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {73421#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {73421#false} is VALID [2022-02-20 19:57:17,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {73421#false} assume !false; {73421#false} is VALID [2022-02-20 19:57:17,248 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:57:17,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:17,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559572772] [2022-02-20 19:57:17,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559572772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:17,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:17,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:17,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88045292] [2022-02-20 19:57:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:17,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:17,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:17,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:17,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:17,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:17,290 INFO L87 Difference]: Start difference. First operand 3207 states and 4004 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,725 INFO L93 Difference]: Finished difference Result 3503 states and 4451 transitions. [2022-02-20 19:57:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 762 transitions. [2022-02-20 19:57:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 762 transitions. [2022-02-20 19:57:19,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 762 transitions. [2022-02-20 19:57:20,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 762 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:20,780 INFO L225 Difference]: With dead ends: 3503 [2022-02-20 19:57:20,780 INFO L226 Difference]: Without dead ends: 3386 [2022-02-20 19:57:20,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:20,782 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 621 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:20,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 803 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:57:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-02-20 19:57:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3323. [2022-02-20 19:57:21,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:21,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3386 states. Second operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:21,041 INFO L74 IsIncluded]: Start isIncluded. First operand 3386 states. Second operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:21,044 INFO L87 Difference]: Start difference. First operand 3386 states. Second operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,543 INFO L93 Difference]: Finished difference Result 3386 states and 4275 transitions. [2022-02-20 19:57:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4275 transitions. [2022-02-20 19:57:21,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) Second operand 3386 states. [2022-02-20 19:57:21,557 INFO L87 Difference]: Start difference. First operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) Second operand 3386 states. [2022-02-20 19:57:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,034 INFO L93 Difference]: Finished difference Result 3386 states and 4275 transitions. [2022-02-20 19:57:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4275 transitions. [2022-02-20 19:57:22,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:22,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 2604 states have (on average 1.271889400921659) internal successors, (3312), 2655 states have internal predecessors, (3312), 355 states have call successors, (355), 291 states have call predecessors, (355), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4175 transitions. [2022-02-20 19:57:22,712 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4175 transitions. Word has length 68 [2022-02-20 19:57:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:22,712 INFO L470 AbstractCegarLoop]: Abstraction has 3323 states and 4175 transitions. [2022-02-20 19:57:22,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4175 transitions. [2022-02-20 19:57:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:57:22,714 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:22,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:22,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:22,714 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1428854835, now seen corresponding path program 1 times [2022-02-20 19:57:22,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:22,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119777057] [2022-02-20 19:57:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,744 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {89449#true} {89451#(= ~T1_E~0 ~M_E~0)} #788#return; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {89496#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:22,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {89496#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,777 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {89451#(= ~T1_E~0 ~M_E~0)} #790#return; {89450#false} is VALID [2022-02-20 19:57:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {89498#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {89449#true} is VALID [2022-02-20 19:57:22,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {89449#true} assume !(1 == ~m_pc~0); {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {89449#true} is_master_triggered_~__retres1~4#1 := 0; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {89449#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {89449#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {89449#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {89449#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; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {89449#true} assume 1 == ~t1_pc~0; {89449#true} is VALID [2022-02-20 19:57:22,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {89449#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {89449#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {89449#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {89449#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {89449#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; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {89449#true} assume !(1 == ~t2_pc~0); {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {89449#true} is_transmit2_triggered_~__retres1~6#1 := 0; {89449#true} is VALID [2022-02-20 19:57:22,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {89449#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89449#true} is VALID [2022-02-20 19:57:22,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {89449#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {89449#true} is VALID [2022-02-20 19:57:22,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {89449#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,797 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {89449#true} {89450#false} #792#return; {89450#false} is VALID [2022-02-20 19:57:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {89449#true} is VALID [2022-02-20 19:57:22,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {89449#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {89449#true} assume !(1 == ~T2_E~0); {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {89449#true} assume 1 == ~E_M~0;~E_M~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {89449#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {89449#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,802 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89449#true} {89450#false} #794#return; {89450#false} is VALID [2022-02-20 19:57:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {89449#true} havoc ~__retres1~7; {89449#true} is VALID [2022-02-20 19:57:22,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {89449#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {89449#true} is VALID [2022-02-20 19:57:22,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {89449#true} #res := ~__retres1~7; {89449#true} is VALID [2022-02-20 19:57:22,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,806 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89449#true} {89450#false} #796#return; {89450#false} is VALID [2022-02-20 19:57:22,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {89449#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {89449#true} is VALID [2022-02-20 19:57:22,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {89449#true} {89451#(= ~T1_E~0 ~M_E~0)} #788#return; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {89451#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:22,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {89451#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:22,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {89496#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:22,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {89496#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:22,814 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {89497#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {89451#(= ~T1_E~0 ~M_E~0)} #790#return; {89450#false} is VALID [2022-02-20 19:57:22,814 INFO L272 TraceCheckUtils]: 21: Hoare triple {89450#false} call activate_threads2(); {89498#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:22,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {89498#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {89449#true} is VALID [2022-02-20 19:57:22,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {89449#true} assume !(1 == ~m_pc~0); {89449#true} is VALID [2022-02-20 19:57:22,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {89449#true} is_master_triggered_~__retres1~4#1 := 0; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {89449#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {89449#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {89449#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {89449#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; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {89449#true} assume 1 == ~t1_pc~0; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {89449#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {89449#true} is VALID [2022-02-20 19:57:22,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {89449#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {89449#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {89449#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {89449#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; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {89449#true} assume !(1 == ~t2_pc~0); {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {89449#true} is_transmit2_triggered_~__retres1~6#1 := 0; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {89449#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {89449#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {89449#true} is VALID [2022-02-20 19:57:22,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {89449#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89449#true} is VALID [2022-02-20 19:57:22,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,817 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {89449#true} {89450#false} #792#return; {89450#false} is VALID [2022-02-20 19:57:22,817 INFO L272 TraceCheckUtils]: 42: Hoare triple {89450#false} call reset_delta_events2(); {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:22,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {89495#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {89449#true} is VALID [2022-02-20 19:57:22,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {89449#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {89449#true} assume !(1 == ~T2_E~0); {89449#true} is VALID [2022-02-20 19:57:22,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {89449#true} assume 1 == ~E_M~0;~E_M~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {89449#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {89449#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89449#true} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,818 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {89449#true} {89450#false} #794#return; {89450#false} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {89450#false} assume !false; {89450#false} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {89450#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {89450#false} is VALID [2022-02-20 19:57:22,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {89450#false} assume !false; {89450#false} is VALID [2022-02-20 19:57:22,819 INFO L272 TraceCheckUtils]: 54: Hoare triple {89450#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {89449#true} is VALID [2022-02-20 19:57:22,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {89449#true} havoc ~__retres1~7; {89449#true} is VALID [2022-02-20 19:57:22,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {89449#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {89449#true} is VALID [2022-02-20 19:57:22,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {89449#true} #res := ~__retres1~7; {89449#true} is VALID [2022-02-20 19:57:22,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {89449#true} assume true; {89449#true} is VALID [2022-02-20 19:57:22,819 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {89449#true} {89450#false} #796#return; {89450#false} is VALID [2022-02-20 19:57:22,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {89450#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {89450#false} assume 0 != eval2_~tmp~5#1; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {89450#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {89450#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {89450#false} assume !(0 == ~m_pc~0); {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {89450#false} assume 1 == ~m_pc~0; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {89450#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {89450#false} is VALID [2022-02-20 19:57:22,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {89450#false} assume !false; {89450#false} is VALID [2022-02-20 19:57:22,821 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:57:22,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:22,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119777057] [2022-02-20 19:57:22,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119777057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:22,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:22,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:22,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220212993] [2022-02-20 19:57:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:22,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:22,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:22,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:22,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:22,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:22,866 INFO L87 Difference]: Start difference. First operand 3323 states and 4175 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:25,989 INFO L93 Difference]: Finished difference Result 3766 states and 4835 transitions. [2022-02-20 19:57:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:25,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 762 transitions. [2022-02-20 19:57:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 762 transitions. [2022-02-20 19:57:26,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 762 transitions. [2022-02-20 19:57:26,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 762 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:27,061 INFO L225 Difference]: With dead ends: 3766 [2022-02-20 19:57:27,061 INFO L226 Difference]: Without dead ends: 3533 [2022-02-20 19:57:27,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:27,062 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 616 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:27,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 1212 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2022-02-20 19:57:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 3432. [2022-02-20 19:57:27,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:27,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3533 states. Second operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:27,317 INFO L74 IsIncluded]: Start isIncluded. First operand 3533 states. Second operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:27,321 INFO L87 Difference]: Start difference. First operand 3533 states. Second operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,872 INFO L93 Difference]: Finished difference Result 3533 states and 4491 transitions. [2022-02-20 19:57:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 4491 transitions. [2022-02-20 19:57:27,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3533 states. [2022-02-20 19:57:27,885 INFO L87 Difference]: Start difference. First operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3533 states. [2022-02-20 19:57:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,417 INFO L93 Difference]: Finished difference Result 3533 states and 4491 transitions. [2022-02-20 19:57:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 4491 transitions. [2022-02-20 19:57:28,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:28,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:28,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:28,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 2695 states have (on average 1.277922077922078) internal successors, (3444), 2747 states have internal predecessors, (3444), 366 states have call successors, (366), 297 states have call predecessors, (366), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4331 transitions. [2022-02-20 19:57:28,991 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4331 transitions. Word has length 68 [2022-02-20 19:57:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:28,991 INFO L470 AbstractCegarLoop]: Abstraction has 3432 states and 4331 transitions. [2022-02-20 19:57:28,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4331 transitions. [2022-02-20 19:57:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:57:28,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:28,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:28,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:57:28,992 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -552835829, now seen corresponding path program 1 times [2022-02-20 19:57:28,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:28,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281094460] [2022-02-20 19:57:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,020 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {106270#true} {106272#(not (= ~E_M~0 0))} #788#return; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume true; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,053 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {106318#(= |old(~E_M~0)| 0)} {106272#(not (= ~E_M~0 0))} #790#return; {106271#false} is VALID [2022-02-20 19:57:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {106319#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {106270#true} assume !(1 == ~m_pc~0); {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {106270#true} is_master_triggered_~__retres1~4#1 := 0; {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {106270#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {106270#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {106270#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {106270#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; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {106270#true} assume 1 == ~t1_pc~0; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {106270#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {106270#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {106270#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {106270#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {106270#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; {106270#true} is VALID [2022-02-20 19:57:29,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {106270#true} assume !(1 == ~t2_pc~0); {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {106270#true} is_transmit2_triggered_~__retres1~6#1 := 0; {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {106270#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {106270#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {106270#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,071 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {106270#true} {106271#false} #792#return; {106271#false} is VALID [2022-02-20 19:57:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {106270#true} is VALID [2022-02-20 19:57:29,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {106270#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {106270#true} assume !(1 == ~T2_E~0); {106270#true} is VALID [2022-02-20 19:57:29,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {106270#true} assume 1 == ~E_M~0;~E_M~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {106270#true} assume 1 == ~E_1~0;~E_1~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {106270#true} assume 1 == ~E_2~0;~E_2~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,076 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {106270#true} {106271#false} #794#return; {106271#false} is VALID [2022-02-20 19:57:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {106270#true} havoc ~__retres1~7; {106270#true} is VALID [2022-02-20 19:57:29,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {106270#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {106270#true} is VALID [2022-02-20 19:57:29,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {106270#true} #res := ~__retres1~7; {106270#true} is VALID [2022-02-20 19:57:29,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,080 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {106270#true} {106271#false} #796#return; {106271#false} is VALID [2022-02-20 19:57:29,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {106270#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {106272#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {106272#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {106272#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {106272#(not (= ~E_M~0 0))} call update_channels2(); {106270#true} is VALID [2022-02-20 19:57:29,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,082 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {106270#true} {106272#(not (= ~E_M~0 0))} #788#return; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {106272#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {106272#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {106272#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {106272#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {106272#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {106272#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:29,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {106272#(not (= ~E_M~0 0))} call fire_delta_events2(); {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:29,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {106317#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:29,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {106317#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {106318#(= |old(~E_M~0)| 0)} assume true; {106318#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:29,088 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {106318#(= |old(~E_M~0)| 0)} {106272#(not (= ~E_M~0 0))} #790#return; {106271#false} is VALID [2022-02-20 19:57:29,088 INFO L272 TraceCheckUtils]: 21: Hoare triple {106271#false} call activate_threads2(); {106319#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:29,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {106319#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {106270#true} is VALID [2022-02-20 19:57:29,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {106270#true} assume !(1 == ~m_pc~0); {106270#true} is VALID [2022-02-20 19:57:29,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {106270#true} is_master_triggered_~__retres1~4#1 := 0; {106270#true} is VALID [2022-02-20 19:57:29,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {106270#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {106270#true} is VALID [2022-02-20 19:57:29,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {106270#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {106270#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {106270#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; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {106270#true} assume 1 == ~t1_pc~0; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {106270#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {106270#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {106270#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {106270#true} is VALID [2022-02-20 19:57:29,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {106270#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {106270#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; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {106270#true} assume !(1 == ~t2_pc~0); {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {106270#true} is_transmit2_triggered_~__retres1~6#1 := 0; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {106270#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {106270#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {106270#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,090 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106270#true} {106271#false} #792#return; {106271#false} is VALID [2022-02-20 19:57:29,091 INFO L272 TraceCheckUtils]: 42: Hoare triple {106271#false} call reset_delta_events2(); {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {106316#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {106270#true} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {106270#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {106270#true} assume !(1 == ~T2_E~0); {106270#true} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {106270#true} assume 1 == ~E_M~0;~E_M~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {106270#true} assume 1 == ~E_1~0;~E_1~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {106270#true} assume 1 == ~E_2~0;~E_2~0 := 2; {106270#true} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,092 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {106270#true} {106271#false} #794#return; {106271#false} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {106271#false} assume !false; {106271#false} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {106271#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {106271#false} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {106271#false} assume !false; {106271#false} is VALID [2022-02-20 19:57:29,092 INFO L272 TraceCheckUtils]: 54: Hoare triple {106271#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {106270#true} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {106270#true} havoc ~__retres1~7; {106270#true} is VALID [2022-02-20 19:57:29,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {106270#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {106270#true} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {106270#true} #res := ~__retres1~7; {106270#true} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {106270#true} assume true; {106270#true} is VALID [2022-02-20 19:57:29,093 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {106270#true} {106271#false} #796#return; {106271#false} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {106271#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {106271#false} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {106271#false} assume 0 != eval2_~tmp~5#1; {106271#false} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {106271#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {106271#false} is VALID [2022-02-20 19:57:29,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {106271#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {106271#false} is VALID [2022-02-20 19:57:29,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {106271#false} assume !(0 == ~m_pc~0); {106271#false} is VALID [2022-02-20 19:57:29,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {106271#false} assume 1 == ~m_pc~0; {106271#false} is VALID [2022-02-20 19:57:29,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {106271#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {106271#false} is VALID [2022-02-20 19:57:29,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {106271#false} assume !false; {106271#false} is VALID [2022-02-20 19:57:29,094 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:57:29,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:29,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281094460] [2022-02-20 19:57:29,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281094460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:29,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:29,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:29,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567752559] [2022-02-20 19:57:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:29,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:29,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:29,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:29,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:29,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:29,147 INFO L87 Difference]: Start difference. First operand 3432 states and 4331 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:31,390 INFO L93 Difference]: Finished difference Result 3873 states and 4993 transitions. [2022-02-20 19:57:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:57:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:57:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 549 transitions. [2022-02-20 19:57:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 549 transitions. [2022-02-20 19:57:31,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 549 transitions. [2022-02-20 19:57:31,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 549 edges. 549 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.