./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.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.15.cil.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 dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:27,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:27,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:27,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:27,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:27,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:27,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:27,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:27,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:27,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:27,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:27,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:27,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:27,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:27,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:27,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:27,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:27,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:27,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:27,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:27,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:27,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:27,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:27,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:27,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:27,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:27,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:27,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:27,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:27,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:27,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:27,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:27,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:27,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:27,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:27,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:27,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:27,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:27,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:27,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:27,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:27,913 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:58:27,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:27,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:27,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:27,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:27,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:27,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:27,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:27,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:27,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:27,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:27,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:27,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:27,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:27,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:27,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:27,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:27,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:27,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:27,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:27,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:27,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:27,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:27,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:27,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:27,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:27,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:27,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:27,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:27,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:27,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:27,959 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:27,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:27,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:27,960 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 -> dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a [2022-02-20 19:58:28,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:28,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:28,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:28,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:28,222 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:28,223 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.15.cil.c [2022-02-20 19:58:28,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1b34f2a/c2dfd7542b184a8bbd1a237ff35aa347/FLAGc4b849831 [2022-02-20 19:58:28,781 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:28,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c [2022-02-20 19:58:28,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1b34f2a/c2dfd7542b184a8bbd1a237ff35aa347/FLAGc4b849831 [2022-02-20 19:58:29,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1b34f2a/c2dfd7542b184a8bbd1a237ff35aa347 [2022-02-20 19:58:29,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:29,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:29,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:29,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:29,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:29,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d15265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29, skipping insertion in model container [2022-02-20 19:58:29,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:29,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:29,321 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.15.cil.c[914,927] [2022-02-20 19:58:29,409 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.15.cil.c[7115,7128] [2022-02-20 19:58:29,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:29,565 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:29,575 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.15.cil.c[914,927] [2022-02-20 19:58:29,605 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.15.cil.c[7115,7128] [2022-02-20 19:58:29,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:29,695 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:29,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29 WrapperNode [2022-02-20 19:58:29,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:29,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:29,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:29,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:29,702 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:58:29" (1/1) ... [2022-02-20 19:58:29,723 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:58:29" (1/1) ... [2022-02-20 19:58:29,801 INFO L137 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1101 [2022-02-20 19:58:29,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:29,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:29,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:29,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:29,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:29,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:29,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:29,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:29,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (1/1) ... [2022-02-20 19:58:29,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:29,908 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:58:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:29,940 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:29,940 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:29,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:29,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:29,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:29,945 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:29,945 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:58:29,945 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:58:29,928 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:58:30,119 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:30,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:31,023 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:31,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:31,044 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-02-20 19:58:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:31 BoogieIcfgContainer [2022-02-20 19:58:31,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:31,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:31,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:31,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:31,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:29" (1/3) ... [2022-02-20 19:58:31,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acddab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:31, skipping insertion in model container [2022-02-20 19:58:31,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:29" (2/3) ... [2022-02-20 19:58:31,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acddab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:31, skipping insertion in model container [2022-02-20 19:58:31,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:31" (3/3) ... [2022-02-20 19:58:31,054 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.15.cil.c [2022-02-20 19:58:31,058 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:31,059 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:31,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:31,117 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:58:31,117 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 514 states, 453 states have (on average 1.6467991169977925) internal successors, (746), 461 states have internal predecessors, (746), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-02-20 19:58:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:31,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:31,165 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:58:31,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -338141029, now seen corresponding path program 1 times [2022-02-20 19:58:31,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:31,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279909524] [2022-02-20 19:58:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {557#(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); {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {519#(= ~q_read_ev~0 2)} #2013#return; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#(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; {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {560#(= |old(~q_read_ev~0)| 0)} assume true; {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {560#(= |old(~q_read_ev~0)| 0)} {519#(= ~q_read_ev~0 2)} #2015#return; {518#false} is VALID [2022-02-20 19:58:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} havoc ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume 1 == ~p_dw_pc~0; {517#true} is VALID [2022-02-20 19:58:31,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {517#true} is VALID [2022-02-20 19:58:31,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} #res := ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,566 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {517#true} {517#true} #2009#return; {517#true} is VALID [2022-02-20 19:58:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} havoc ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume 1 == ~c_dr_pc~0; {517#true} is VALID [2022-02-20 19:58:31,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {517#true} is VALID [2022-02-20 19:58:31,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} #res := ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,572 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {517#true} {517#true} #2011#return; {517#true} is VALID [2022-02-20 19:58:31,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(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; {517#true} is VALID [2022-02-20 19:58:31,573 INFO L272 TraceCheckUtils]: 1: Hoare triple {517#true} call #t~ret8 := is_do_write_p_triggered(); {517#true} is VALID [2022-02-20 19:58:31,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} havoc ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} assume 1 == ~p_dw_pc~0; {517#true} is VALID [2022-02-20 19:58:31,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {517#true} is VALID [2022-02-20 19:58:31,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} #res := ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,574 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {517#true} {517#true} #2009#return; {517#true} is VALID [2022-02-20 19:58:31,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {517#true} is VALID [2022-02-20 19:58:31,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {517#true} is VALID [2022-02-20 19:58:31,575 INFO L272 TraceCheckUtils]: 10: Hoare triple {517#true} call #t~ret9 := is_do_read_c_triggered(); {517#true} is VALID [2022-02-20 19:58:31,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#true} havoc ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#true} assume 1 == ~c_dr_pc~0; {517#true} is VALID [2022-02-20 19:58:31,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {517#true} is VALID [2022-02-20 19:58:31,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {517#true} #res := ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,576 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {517#true} {517#true} #2011#return; {517#true} is VALID [2022-02-20 19:58:31,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {517#true} is VALID [2022-02-20 19:58:31,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {517#true} is VALID [2022-02-20 19:58:31,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,577 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {517#true} {518#false} #2017#return; {518#false} is VALID [2022-02-20 19:58:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#(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); {517#true} is VALID [2022-02-20 19:58:31,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {517#true} is VALID [2022-02-20 19:58:31,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {518#false} #2019#return; {518#false} is VALID [2022-02-20 19:58:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} havoc ~__retres1~2; {517#true} is VALID [2022-02-20 19:58:31,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {517#true} is VALID [2022-02-20 19:58:31,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} #res := ~__retres1~2; {517#true} is VALID [2022-02-20 19:58:31,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,589 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {517#true} {518#false} #2021#return; {518#false} is VALID [2022-02-20 19:58:31,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {517#true} is VALID [2022-02-20 19:58:31,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {517#true} is VALID [2022-02-20 19:58:31,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#(= ~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; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#(= ~q_read_ev~0 2)} call update_channels1(); {557#(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:58:31,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#(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); {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,594 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {519#(= ~q_read_ev~0 2)} #2013#return; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {519#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {519#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {519#(= ~q_read_ev~0 2)} call fire_delta_events1(); {559#(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:58:31,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(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; {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {560#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {560#(= |old(~q_read_ev~0)| 0)} assume true; {560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,599 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {560#(= |old(~q_read_ev~0)| 0)} {519#(= ~q_read_ev~0 2)} #2015#return; {518#false} is VALID [2022-02-20 19:58:31,599 INFO L272 TraceCheckUtils]: 17: Hoare triple {518#false} call activate_threads1(); {561#(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:58:31,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(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; {517#true} is VALID [2022-02-20 19:58:31,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {517#true} call #t~ret8 := is_do_write_p_triggered(); {517#true} is VALID [2022-02-20 19:58:31,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {517#true} havoc ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {517#true} assume 1 == ~p_dw_pc~0; {517#true} is VALID [2022-02-20 19:58:31,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {517#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {517#true} is VALID [2022-02-20 19:58:31,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {517#true} #res := ~__retres1~0; {517#true} is VALID [2022-02-20 19:58:31,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,601 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {517#true} {517#true} #2009#return; {517#true} is VALID [2022-02-20 19:58:31,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {517#true} is VALID [2022-02-20 19:58:31,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {517#true} is VALID [2022-02-20 19:58:31,602 INFO L272 TraceCheckUtils]: 28: Hoare triple {517#true} call #t~ret9 := is_do_read_c_triggered(); {517#true} is VALID [2022-02-20 19:58:31,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {517#true} havoc ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {517#true} assume 1 == ~c_dr_pc~0; {517#true} is VALID [2022-02-20 19:58:31,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {517#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {517#true} is VALID [2022-02-20 19:58:31,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {517#true} #res := ~__retres1~1; {517#true} is VALID [2022-02-20 19:58:31,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,603 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {517#true} {517#true} #2011#return; {517#true} is VALID [2022-02-20 19:58:31,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {517#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {517#true} is VALID [2022-02-20 19:58:31,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {517#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {517#true} is VALID [2022-02-20 19:58:31,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,604 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {517#true} {518#false} #2017#return; {518#false} is VALID [2022-02-20 19:58:31,604 INFO L272 TraceCheckUtils]: 39: Hoare triple {518#false} call reset_delta_events1(); {559#(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:58:31,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {559#(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); {517#true} is VALID [2022-02-20 19:58:31,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {517#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {517#true} is VALID [2022-02-20 19:58:31,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,605 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {517#true} {518#false} #2019#return; {518#false} is VALID [2022-02-20 19:58:31,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 19:58:31,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {518#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; {518#false} is VALID [2022-02-20 19:58:31,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 19:58:31,606 INFO L272 TraceCheckUtils]: 47: Hoare triple {518#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {517#true} is VALID [2022-02-20 19:58:31,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {517#true} havoc ~__retres1~2; {517#true} is VALID [2022-02-20 19:58:31,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {517#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {517#true} is VALID [2022-02-20 19:58:31,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {517#true} #res := ~__retres1~2; {517#true} is VALID [2022-02-20 19:58:31,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 19:58:31,608 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {517#true} {518#false} #2021#return; {518#false} is VALID [2022-02-20 19:58:31,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {518#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; {518#false} is VALID [2022-02-20 19:58:31,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {518#false} assume 0 != eval1_~tmp___1~0#1; {518#false} is VALID [2022-02-20 19:58:31,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {518#false} assume !(0 == ~p_dw_st~0); {518#false} is VALID [2022-02-20 19:58:31,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {518#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; {518#false} is VALID [2022-02-20 19:58:31,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {518#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; {518#false} is VALID [2022-02-20 19:58:31,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {518#false} assume 0 == ~c_dr_pc~0; {518#false} is VALID [2022-02-20 19:58:31,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 19:58:31,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {518#false} assume !(1 == ~q_free~0); {518#false} is VALID [2022-02-20 19:58:31,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {518#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; {518#false} is VALID [2022-02-20 19:58:31,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {518#false} assume !(~p_last_write~0 == ~c_last_read~0); {518#false} is VALID [2022-02-20 19:58:31,610 INFO L272 TraceCheckUtils]: 63: Hoare triple {518#false} call error1(); {518#false} is VALID [2022-02-20 19:58:31,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 19:58:31,611 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:58:31,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:31,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279909524] [2022-02-20 19:58:31,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279909524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:31,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:31,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:31,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956766627] [2022-02-20 19:58:31,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:31,619 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:58:31,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:31,624 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:58:31,676 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:58:31,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:31,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:31,698 INFO L87 Difference]: Start difference. First operand has 514 states, 453 states have (on average 1.6467991169977925) internal successors, (746), 461 states have internal predecessors, (746), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) 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:58:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,567 INFO L93 Difference]: Finished difference Result 1133 states and 1820 transitions. [2022-02-20 19:58:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:35,567 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:58:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:35,569 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:58:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1820 transitions. [2022-02-20 19:58:35,610 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:58:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1820 transitions. [2022-02-20 19:58:35,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1820 transitions. [2022-02-20 19:58:36,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1820 edges. 1820 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,982 INFO L225 Difference]: With dead ends: 1133 [2022-02-20 19:58:36,983 INFO L226 Difference]: Without dead ends: 638 [2022-02-20 19:58:36,992 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:58:36,997 INFO L933 BasicCegarLoop]: 799 mSDtfsCounter, 1267 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:36,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 2307 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-02-20 19:58:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 599. [2022-02-20 19:58:37,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:37,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:37,119 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:37,124 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,163 INFO L93 Difference]: Finished difference Result 638 states and 962 transitions. [2022-02-20 19:58:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 962 transitions. [2022-02-20 19:58:37,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:37,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:37,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 638 states. [2022-02-20 19:58:37,180 INFO L87 Difference]: Start difference. First operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 638 states. [2022-02-20 19:58:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,228 INFO L93 Difference]: Finished difference Result 638 states and 962 transitions. [2022-02-20 19:58:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 962 transitions. [2022-02-20 19:58:37,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:37,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:37,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:37,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 521 states have (on average 1.5335892514395393) internal successors, (799), 528 states have internal predecessors, (799), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 908 transitions. [2022-02-20 19:58:37,272 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 908 transitions. Word has length 65 [2022-02-20 19:58:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:37,276 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 908 transitions. [2022-02-20 19:58:37,277 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:58:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 908 transitions. [2022-02-20 19:58:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:37,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:37,281 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:58:37,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:37,282 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:37,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -74903688, now seen corresponding path program 1 times [2022-02-20 19:58:37,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:37,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54818116] [2022-02-20 19:58:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {4186#(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); {4147#true} is VALID [2022-02-20 19:58:37,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4147#true} {4147#true} #2013#return; {4147#true} is VALID [2022-02-20 19:58:37,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {4187#(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); {4147#true} is VALID [2022-02-20 19:58:37,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume !(0 == ~q_write_ev~0); {4147#true} is VALID [2022-02-20 19:58:37,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4147#true} {4147#true} #2015#return; {4147#true} is VALID [2022-02-20 19:58:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#true} havoc ~__retres1~0; {4147#true} is VALID [2022-02-20 19:58:37,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume !(1 == ~p_dw_pc~0); {4147#true} is VALID [2022-02-20 19:58:37,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} ~__retres1~0 := 0; {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:37,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,545 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4147#true} #2009#return; {4195#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#true} havoc ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume 1 == ~c_dr_pc~0; {4147#true} is VALID [2022-02-20 19:58:37,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4147#true} is VALID [2022-02-20 19:58:37,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#true} #res := ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,550 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4147#true} {4148#false} #2011#return; {4148#false} is VALID [2022-02-20 19:58:37,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {4188#(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; {4147#true} is VALID [2022-02-20 19:58:37,551 INFO L272 TraceCheckUtils]: 1: Hoare triple {4147#true} call #t~ret8 := is_do_write_p_triggered(); {4147#true} is VALID [2022-02-20 19:58:37,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} havoc ~__retres1~0; {4147#true} is VALID [2022-02-20 19:58:37,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#true} assume !(1 == ~p_dw_pc~0); {4147#true} is VALID [2022-02-20 19:58:37,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {4147#true} ~__retres1~0 := 0; {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:37,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,557 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4147#true} #2009#return; {4195#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:37,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {4195#(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; {4196#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:37,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {4196#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4148#false} is VALID [2022-02-20 19:58:37,558 INFO L272 TraceCheckUtils]: 10: Hoare triple {4148#false} call #t~ret9 := is_do_read_c_triggered(); {4147#true} is VALID [2022-02-20 19:58:37,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4147#true} havoc ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {4147#true} assume 1 == ~c_dr_pc~0; {4147#true} is VALID [2022-02-20 19:58:37,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {4147#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4147#true} is VALID [2022-02-20 19:58:37,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {4147#true} #res := ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,559 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4147#true} {4148#false} #2011#return; {4148#false} is VALID [2022-02-20 19:58:37,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4148#false} is VALID [2022-02-20 19:58:37,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {4148#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4148#false} is VALID [2022-02-20 19:58:37,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {4148#false} assume true; {4148#false} is VALID [2022-02-20 19:58:37,560 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4148#false} {4147#true} #2017#return; {4148#false} is VALID [2022-02-20 19:58:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {4187#(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); {4147#true} is VALID [2022-02-20 19:58:37,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4147#true} is VALID [2022-02-20 19:58:37,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4147#true} {4148#false} #2019#return; {4148#false} is VALID [2022-02-20 19:58:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#true} havoc ~__retres1~2; {4147#true} is VALID [2022-02-20 19:58:37,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4147#true} is VALID [2022-02-20 19:58:37,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} #res := ~__retres1~2; {4147#true} is VALID [2022-02-20 19:58:37,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,571 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4147#true} {4148#false} #2021#return; {4148#false} is VALID [2022-02-20 19:58:37,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {4147#true} is VALID [2022-02-20 19:58:37,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {4147#true} is VALID [2022-02-20 19:58:37,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {4147#true} is VALID [2022-02-20 19:58:37,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#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; {4147#true} is VALID [2022-02-20 19:58:37,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {4147#true} call update_channels1(); {4186#(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:58:37,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {4186#(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); {4147#true} is VALID [2022-02-20 19:58:37,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,573 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4147#true} {4147#true} #2013#return; {4147#true} is VALID [2022-02-20 19:58:37,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {4147#true} assume { :begin_inline_init_threads1 } true; {4147#true} is VALID [2022-02-20 19:58:37,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {4147#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4147#true} is VALID [2022-02-20 19:58:37,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {4147#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4147#true} is VALID [2022-02-20 19:58:37,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {4147#true} assume { :end_inline_init_threads1 } true; {4147#true} is VALID [2022-02-20 19:58:37,574 INFO L272 TraceCheckUtils]: 12: Hoare triple {4147#true} call fire_delta_events1(); {4187#(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:58:37,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {4187#(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); {4147#true} is VALID [2022-02-20 19:58:37,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {4147#true} assume !(0 == ~q_write_ev~0); {4147#true} is VALID [2022-02-20 19:58:37,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,575 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4147#true} {4147#true} #2015#return; {4147#true} is VALID [2022-02-20 19:58:37,576 INFO L272 TraceCheckUtils]: 17: Hoare triple {4147#true} call activate_threads1(); {4188#(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:58:37,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {4188#(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; {4147#true} is VALID [2022-02-20 19:58:37,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {4147#true} call #t~ret8 := is_do_write_p_triggered(); {4147#true} is VALID [2022-02-20 19:58:37,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {4147#true} havoc ~__retres1~0; {4147#true} is VALID [2022-02-20 19:58:37,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {4147#true} assume !(1 == ~p_dw_pc~0); {4147#true} is VALID [2022-02-20 19:58:37,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {4147#true} ~__retres1~0 := 0; {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:37,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {4203#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:37,578 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4204#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4147#true} #2009#return; {4195#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:37,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {4195#(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; {4196#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:37,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {4196#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4148#false} is VALID [2022-02-20 19:58:37,580 INFO L272 TraceCheckUtils]: 28: Hoare triple {4148#false} call #t~ret9 := is_do_read_c_triggered(); {4147#true} is VALID [2022-02-20 19:58:37,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {4147#true} havoc ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {4147#true} assume 1 == ~c_dr_pc~0; {4147#true} is VALID [2022-02-20 19:58:37,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {4147#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4147#true} is VALID [2022-02-20 19:58:37,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {4147#true} #res := ~__retres1~1; {4147#true} is VALID [2022-02-20 19:58:37,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,581 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4147#true} {4148#false} #2011#return; {4148#false} is VALID [2022-02-20 19:58:37,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {4148#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4148#false} is VALID [2022-02-20 19:58:37,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {4148#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4148#false} is VALID [2022-02-20 19:58:37,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {4148#false} assume true; {4148#false} is VALID [2022-02-20 19:58:37,582 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4148#false} {4147#true} #2017#return; {4148#false} is VALID [2022-02-20 19:58:37,582 INFO L272 TraceCheckUtils]: 39: Hoare triple {4148#false} call reset_delta_events1(); {4187#(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:58:37,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {4187#(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); {4147#true} is VALID [2022-02-20 19:58:37,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {4147#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4147#true} is VALID [2022-02-20 19:58:37,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,583 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4147#true} {4148#false} #2019#return; {4148#false} is VALID [2022-02-20 19:58:37,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 19:58:37,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {4148#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; {4148#false} is VALID [2022-02-20 19:58:37,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 19:58:37,584 INFO L272 TraceCheckUtils]: 47: Hoare triple {4148#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4147#true} is VALID [2022-02-20 19:58:37,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {4147#true} havoc ~__retres1~2; {4147#true} is VALID [2022-02-20 19:58:37,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {4147#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4147#true} is VALID [2022-02-20 19:58:37,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {4147#true} #res := ~__retres1~2; {4147#true} is VALID [2022-02-20 19:58:37,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {4147#true} assume true; {4147#true} is VALID [2022-02-20 19:58:37,585 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4147#true} {4148#false} #2021#return; {4148#false} is VALID [2022-02-20 19:58:37,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {4148#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; {4148#false} is VALID [2022-02-20 19:58:37,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {4148#false} assume 0 != eval1_~tmp___1~0#1; {4148#false} is VALID [2022-02-20 19:58:37,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {4148#false} assume !(0 == ~p_dw_st~0); {4148#false} is VALID [2022-02-20 19:58:37,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {4148#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; {4148#false} is VALID [2022-02-20 19:58:37,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {4148#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; {4148#false} is VALID [2022-02-20 19:58:37,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {4148#false} assume 0 == ~c_dr_pc~0; {4148#false} is VALID [2022-02-20 19:58:37,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 19:58:37,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {4148#false} assume !(1 == ~q_free~0); {4148#false} is VALID [2022-02-20 19:58:37,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {4148#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; {4148#false} is VALID [2022-02-20 19:58:37,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {4148#false} assume !(~p_last_write~0 == ~c_last_read~0); {4148#false} is VALID [2022-02-20 19:58:37,587 INFO L272 TraceCheckUtils]: 63: Hoare triple {4148#false} call error1(); {4148#false} is VALID [2022-02-20 19:58:37,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 19:58:37,588 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:58:37,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:37,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54818116] [2022-02-20 19:58:37,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54818116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:37,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:37,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:37,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117027198] [2022-02-20 19:58:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:37,590 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:58:37,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:37,591 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:58:37,639 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:58:37,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:37,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:37,640 INFO L87 Difference]: Start difference. First operand 599 states and 908 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:58:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,135 INFO L93 Difference]: Finished difference Result 813 states and 1202 transitions. [2022-02-20 19:58:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:42,136 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:58:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:42,137 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:58:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 932 transitions. [2022-02-20 19:58:42,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:58:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 932 transitions. [2022-02-20 19:58:42,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 932 transitions. [2022-02-20 19:58:42,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 932 edges. 932 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:42,960 INFO L225 Difference]: With dead ends: 813 [2022-02-20 19:58:42,961 INFO L226 Difference]: Without dead ends: 636 [2022-02-20 19:58:42,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:42,963 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1031 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:42,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 3033 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:58:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-02-20 19:58:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 604. [2022-02-20 19:58:42,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:42,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 636 states. Second operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:43,000 INFO L74 IsIncluded]: Start isIncluded. First operand 636 states. Second operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:43,001 INFO L87 Difference]: Start difference. First operand 636 states. Second operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,029 INFO L93 Difference]: Finished difference Result 636 states and 958 transitions. [2022-02-20 19:58:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 958 transitions. [2022-02-20 19:58:43,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 636 states. [2022-02-20 19:58:43,035 INFO L87 Difference]: Start difference. First operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 636 states. [2022-02-20 19:58:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,062 INFO L93 Difference]: Finished difference Result 636 states and 958 transitions. [2022-02-20 19:58:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 958 transitions. [2022-02-20 19:58:43,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:43,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 912 transitions. [2022-02-20 19:58:43,095 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 912 transitions. Word has length 65 [2022-02-20 19:58:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:43,097 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 912 transitions. [2022-02-20 19:58:43,097 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:58:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 912 transitions. [2022-02-20 19:58:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:43,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:43,098 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:58:43,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:43,099 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1104262986, now seen corresponding path program 1 times [2022-02-20 19:58:43,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:43,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844903551] [2022-02-20 19:58:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {7403#(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); {7404#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:43,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#(not (= |old(~q_req_up~0)| 1))} assume true; {7404#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:43,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7404#(not (= |old(~q_req_up~0)| 1))} {7364#(= ~c_dr_pc~0 ~q_req_up~0)} #2013#return; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {7405#(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); {7361#true} is VALID [2022-02-20 19:58:43,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume !(0 == ~q_write_ev~0); {7361#true} is VALID [2022-02-20 19:58:43,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7368#(not (= ~c_dr_pc~0 1))} #2015#return; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {7361#true} havoc ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume !(1 == ~p_dw_pc~0); {7361#true} is VALID [2022-02-20 19:58:43,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} ~__retres1~0 := 0; {7361#true} is VALID [2022-02-20 19:58:43,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {7361#true} #res := ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,222 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7361#true} {7361#true} #2009#return; {7361#true} is VALID [2022-02-20 19:58:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {7361#true} havoc ~__retres1~1; {7361#true} is VALID [2022-02-20 19:58:43,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume 1 == ~c_dr_pc~0; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,240 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} {7361#true} #2011#return; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {7406#(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; {7361#true} is VALID [2022-02-20 19:58:43,241 INFO L272 TraceCheckUtils]: 1: Hoare triple {7361#true} call #t~ret8 := is_do_write_p_triggered(); {7361#true} is VALID [2022-02-20 19:58:43,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} havoc ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {7361#true} assume !(1 == ~p_dw_pc~0); {7361#true} is VALID [2022-02-20 19:58:43,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {7361#true} ~__retres1~0 := 0; {7361#true} is VALID [2022-02-20 19:58:43,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#true} #res := ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,242 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7361#true} {7361#true} #2009#return; {7361#true} is VALID [2022-02-20 19:58:43,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7361#true} is VALID [2022-02-20 19:58:43,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~tmp~1); {7361#true} is VALID [2022-02-20 19:58:43,242 INFO L272 TraceCheckUtils]: 10: Hoare triple {7361#true} call #t~ret9 := is_do_read_c_triggered(); {7361#true} is VALID [2022-02-20 19:58:43,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {7361#true} havoc ~__retres1~1; {7361#true} is VALID [2022-02-20 19:58:43,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {7361#true} assume 1 == ~c_dr_pc~0; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} {7361#true} #2011#return; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,247 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} {7368#(not (= ~c_dr_pc~0 1))} #2017#return; {7362#false} is VALID [2022-02-20 19:58:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {7405#(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); {7361#true} is VALID [2022-02-20 19:58:43,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7361#true} is VALID [2022-02-20 19:58:43,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7362#false} #2019#return; {7362#false} is VALID [2022-02-20 19:58:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {7361#true} havoc ~__retres1~2; {7361#true} is VALID [2022-02-20 19:58:43,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7361#true} is VALID [2022-02-20 19:58:43,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} #res := ~__retres1~2; {7361#true} is VALID [2022-02-20 19:58:43,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,259 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7361#true} {7362#false} #2021#return; {7362#false} is VALID [2022-02-20 19:58:43,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {7361#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {7363#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:43,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {7363#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {7363#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:43,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {7364#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:43,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {7364#(= ~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; {7364#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:43,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {7364#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {7403#(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:58:43,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {7403#(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); {7404#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:43,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {7404#(not (= |old(~q_req_up~0)| 1))} assume true; {7404#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:43,263 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7404#(not (= |old(~q_req_up~0)| 1))} {7364#(= ~c_dr_pc~0 ~q_req_up~0)} #2013#return; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,265 INFO L272 TraceCheckUtils]: 12: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {7405#(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:58:43,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {7405#(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); {7361#true} is VALID [2022-02-20 19:58:43,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {7361#true} assume !(0 == ~q_write_ev~0); {7361#true} is VALID [2022-02-20 19:58:43,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,266 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7361#true} {7368#(not (= ~c_dr_pc~0 1))} #2015#return; {7368#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:43,266 INFO L272 TraceCheckUtils]: 17: Hoare triple {7368#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {7406#(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:58:43,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {7406#(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; {7361#true} is VALID [2022-02-20 19:58:43,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {7361#true} call #t~ret8 := is_do_write_p_triggered(); {7361#true} is VALID [2022-02-20 19:58:43,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#true} havoc ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {7361#true} assume !(1 == ~p_dw_pc~0); {7361#true} is VALID [2022-02-20 19:58:43,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {7361#true} ~__retres1~0 := 0; {7361#true} is VALID [2022-02-20 19:58:43,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {7361#true} #res := ~__retres1~0; {7361#true} is VALID [2022-02-20 19:58:43,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,268 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7361#true} {7361#true} #2009#return; {7361#true} is VALID [2022-02-20 19:58:43,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {7361#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7361#true} is VALID [2022-02-20 19:58:43,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {7361#true} assume !(0 != ~tmp~1); {7361#true} is VALID [2022-02-20 19:58:43,269 INFO L272 TraceCheckUtils]: 28: Hoare triple {7361#true} call #t~ret9 := is_do_read_c_triggered(); {7361#true} is VALID [2022-02-20 19:58:43,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {7361#true} havoc ~__retres1~1; {7361#true} is VALID [2022-02-20 19:58:43,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {7361#true} assume 1 == ~c_dr_pc~0; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,271 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} {7361#true} #2011#return; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:43,272 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7419#(= (+ (- 1) ~c_dr_pc~0) 0)} {7368#(not (= ~c_dr_pc~0 1))} #2017#return; {7362#false} is VALID [2022-02-20 19:58:43,273 INFO L272 TraceCheckUtils]: 39: Hoare triple {7362#false} call reset_delta_events1(); {7405#(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:58:43,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {7405#(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); {7361#true} is VALID [2022-02-20 19:58:43,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {7361#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7361#true} is VALID [2022-02-20 19:58:43,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,273 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7361#true} {7362#false} #2019#return; {7362#false} is VALID [2022-02-20 19:58:43,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-02-20 19:58:43,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {7362#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; {7362#false} is VALID [2022-02-20 19:58:43,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-02-20 19:58:43,274 INFO L272 TraceCheckUtils]: 47: Hoare triple {7362#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7361#true} is VALID [2022-02-20 19:58:43,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {7361#true} havoc ~__retres1~2; {7361#true} is VALID [2022-02-20 19:58:43,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {7361#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7361#true} is VALID [2022-02-20 19:58:43,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {7361#true} #res := ~__retres1~2; {7361#true} is VALID [2022-02-20 19:58:43,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-02-20 19:58:43,280 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7361#true} {7362#false} #2021#return; {7362#false} is VALID [2022-02-20 19:58:43,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {7362#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; {7362#false} is VALID [2022-02-20 19:58:43,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {7362#false} assume 0 != eval1_~tmp___1~0#1; {7362#false} is VALID [2022-02-20 19:58:43,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {7362#false} assume !(0 == ~p_dw_st~0); {7362#false} is VALID [2022-02-20 19:58:43,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {7362#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; {7362#false} is VALID [2022-02-20 19:58:43,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {7362#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; {7362#false} is VALID [2022-02-20 19:58:43,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {7362#false} assume 0 == ~c_dr_pc~0; {7362#false} is VALID [2022-02-20 19:58:43,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-02-20 19:58:43,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {7362#false} assume !(1 == ~q_free~0); {7362#false} is VALID [2022-02-20 19:58:43,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {7362#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; {7362#false} is VALID [2022-02-20 19:58:43,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {7362#false} assume !(~p_last_write~0 == ~c_last_read~0); {7362#false} is VALID [2022-02-20 19:58:43,283 INFO L272 TraceCheckUtils]: 63: Hoare triple {7362#false} call error1(); {7362#false} is VALID [2022-02-20 19:58:43,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-02-20 19:58:43,284 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:58:43,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:43,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844903551] [2022-02-20 19:58:43,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844903551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:43,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:43,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:43,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985191057] [2022-02-20 19:58:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:43,287 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:58:43,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:43,288 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:58:43,328 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:58:43,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:43,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:43,330 INFO L87 Difference]: Start difference. First operand 604 states and 912 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:58:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:49,675 INFO L93 Difference]: Finished difference Result 1504 states and 2131 transitions. [2022-02-20 19:58:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:49,676 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:58:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:49,676 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:58:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1451 transitions. [2022-02-20 19:58:49,689 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:58:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1451 transitions. [2022-02-20 19:58:49,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1451 transitions. [2022-02-20 19:58:50,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1451 edges. 1451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:50,922 INFO L225 Difference]: With dead ends: 1504 [2022-02-20 19:58:50,922 INFO L226 Difference]: Without dead ends: 1310 [2022-02-20 19:58:50,926 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:58:50,931 INFO L933 BasicCegarLoop]: 874 mSDtfsCounter, 4268 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4284 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:50,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4284 Valid, 2746 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:58:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-02-20 19:58:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1185. [2022-02-20 19:58:51,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:51,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1310 states. Second operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:51,012 INFO L74 IsIncluded]: Start isIncluded. First operand 1310 states. Second operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:51,015 INFO L87 Difference]: Start difference. First operand 1310 states. Second operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,102 INFO L93 Difference]: Finished difference Result 1310 states and 1799 transitions. [2022-02-20 19:58:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1799 transitions. [2022-02-20 19:58:51,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1310 states. [2022-02-20 19:58:51,111 INFO L87 Difference]: Start difference. First operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1310 states. [2022-02-20 19:58:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,187 INFO L93 Difference]: Finished difference Result 1310 states and 1799 transitions. [2022-02-20 19:58:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1799 transitions. [2022-02-20 19:58:51,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:51,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 987 states have (on average 1.4346504559270516) internal successors, (1416), 1002 states have internal predecessors, (1416), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1652 transitions. [2022-02-20 19:58:51,282 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1652 transitions. Word has length 65 [2022-02-20 19:58:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:51,282 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1652 transitions. [2022-02-20 19:58:51,283 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:58:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1652 transitions. [2022-02-20 19:58:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:51,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:51,286 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:58:51,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:51,286 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -52813897, now seen corresponding path program 1 times [2022-02-20 19:58:51,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:51,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760903863] [2022-02-20 19:58:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {13722#(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); {13683#true} is VALID [2022-02-20 19:58:51,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13683#true} {13683#true} #2013#return; {13683#true} is VALID [2022-02-20 19:58:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {13723#(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); {13683#true} is VALID [2022-02-20 19:58:51,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume !(0 == ~q_write_ev~0); {13683#true} is VALID [2022-02-20 19:58:51,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13683#true} {13683#true} #2015#return; {13683#true} is VALID [2022-02-20 19:58:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {13683#true} havoc ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume !(1 == ~p_dw_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} ~__retres1~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {13683#true} #res := ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,425 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13683#true} {13683#true} #2009#return; {13683#true} is VALID [2022-02-20 19:58:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {13683#true} havoc ~__retres1~1; {13683#true} is VALID [2022-02-20 19:58:51,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume !(1 == ~c_dr_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} ~__retres1~1 := 0; {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,458 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13683#true} #2011#return; {13737#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {13724#(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; {13683#true} is VALID [2022-02-20 19:58:51,459 INFO L272 TraceCheckUtils]: 1: Hoare triple {13683#true} call #t~ret8 := is_do_write_p_triggered(); {13683#true} is VALID [2022-02-20 19:58:51,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} havoc ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {13683#true} assume !(1 == ~p_dw_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {13683#true} ~__retres1~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {13683#true} #res := ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13683#true} {13683#true} #2009#return; {13683#true} is VALID [2022-02-20 19:58:51,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {13683#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13683#true} is VALID [2022-02-20 19:58:51,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {13683#true} assume !(0 != ~tmp~1); {13683#true} is VALID [2022-02-20 19:58:51,462 INFO L272 TraceCheckUtils]: 10: Hoare triple {13683#true} call #t~ret9 := is_do_read_c_triggered(); {13683#true} is VALID [2022-02-20 19:58:51,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {13683#true} havoc ~__retres1~1; {13683#true} is VALID [2022-02-20 19:58:51,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {13683#true} assume !(1 == ~c_dr_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {13683#true} ~__retres1~1 := 0; {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,464 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13683#true} #2011#return; {13737#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {13737#(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; {13738#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {13738#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13684#false} is VALID [2022-02-20 19:58:51,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {13684#false} assume true; {13684#false} is VALID [2022-02-20 19:58:51,473 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13684#false} {13683#true} #2017#return; {13684#false} is VALID [2022-02-20 19:58:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {13723#(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); {13683#true} is VALID [2022-02-20 19:58:51,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13683#true} is VALID [2022-02-20 19:58:51,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13683#true} {13684#false} #2019#return; {13684#false} is VALID [2022-02-20 19:58:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {13683#true} havoc ~__retres1~2; {13683#true} is VALID [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13683#true} is VALID [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} #res := ~__retres1~2; {13683#true} is VALID [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13683#true} {13684#false} #2021#return; {13684#false} is VALID [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {13683#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {13683#true} is VALID [2022-02-20 19:58:51,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {13683#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {13683#true} is VALID [2022-02-20 19:58:51,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {13683#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; {13683#true} is VALID [2022-02-20 19:58:51,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {13683#true} call update_channels1(); {13722#(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:58:51,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {13722#(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); {13683#true} is VALID [2022-02-20 19:58:51,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13683#true} {13683#true} #2013#return; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {13683#true} assume { :begin_inline_init_threads1 } true; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {13683#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {13683#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {13683#true} assume { :end_inline_init_threads1 } true; {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L272 TraceCheckUtils]: 12: Hoare triple {13683#true} call fire_delta_events1(); {13723#(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:58:51,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {13723#(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); {13683#true} is VALID [2022-02-20 19:58:51,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {13683#true} assume !(0 == ~q_write_ev~0); {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13683#true} {13683#true} #2015#return; {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L272 TraceCheckUtils]: 17: Hoare triple {13683#true} call activate_threads1(); {13724#(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:58:51,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {13724#(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; {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L272 TraceCheckUtils]: 19: Hoare triple {13683#true} call #t~ret8 := is_do_write_p_triggered(); {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {13683#true} havoc ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {13683#true} assume !(1 == ~p_dw_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {13683#true} ~__retres1~0 := 0; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {13683#true} #res := ~__retres1~0; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13683#true} {13683#true} #2009#return; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {13683#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {13683#true} assume !(0 != ~tmp~1); {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L272 TraceCheckUtils]: 28: Hoare triple {13683#true} call #t~ret9 := is_do_read_c_triggered(); {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {13683#true} havoc ~__retres1~1; {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {13683#true} assume !(1 == ~c_dr_pc~0); {13683#true} is VALID [2022-02-20 19:58:51,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {13683#true} ~__retres1~1 := 0; {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {13739#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,498 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13740#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13683#true} #2011#return; {13737#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {13737#(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; {13738#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {13738#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {13684#false} assume true; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13684#false} {13683#true} #2017#return; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L272 TraceCheckUtils]: 39: Hoare triple {13684#false} call reset_delta_events1(); {13723#(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:58:51,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {13723#(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); {13683#true} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {13683#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13683#true} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,499 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13683#true} {13684#false} #2019#return; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {13684#false} assume !false; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {13684#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; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {13684#false} assume !false; {13684#false} is VALID [2022-02-20 19:58:51,499 INFO L272 TraceCheckUtils]: 47: Hoare triple {13684#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13683#true} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {13683#true} havoc ~__retres1~2; {13683#true} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {13683#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13683#true} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {13683#true} #res := ~__retres1~2; {13683#true} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {13683#true} assume true; {13683#true} is VALID [2022-02-20 19:58:51,500 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13683#true} {13684#false} #2021#return; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {13684#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; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {13684#false} assume 0 != eval1_~tmp___1~0#1; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {13684#false} assume !(0 == ~p_dw_st~0); {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {13684#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; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {13684#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; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {13684#false} assume 0 == ~c_dr_pc~0; {13684#false} is VALID [2022-02-20 19:58:51,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {13684#false} assume !false; {13684#false} is VALID [2022-02-20 19:58:51,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {13684#false} assume !(1 == ~q_free~0); {13684#false} is VALID [2022-02-20 19:58:51,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {13684#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; {13684#false} is VALID [2022-02-20 19:58:51,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {13684#false} assume !(~p_last_write~0 == ~c_last_read~0); {13684#false} is VALID [2022-02-20 19:58:51,501 INFO L272 TraceCheckUtils]: 63: Hoare triple {13684#false} call error1(); {13684#false} is VALID [2022-02-20 19:58:51,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {13684#false} assume !false; {13684#false} is VALID [2022-02-20 19:58:51,501 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:58:51,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760903863] [2022-02-20 19:58:51,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760903863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:51,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:51,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:51,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818425694] [2022-02-20 19:58:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:51,502 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:58:51,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:51,502 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:58:51,541 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:58:51,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:51,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:51,542 INFO L87 Difference]: Start difference. First operand 1185 states and 1652 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:58:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,695 INFO L93 Difference]: Finished difference Result 2066 states and 2795 transitions. [2022-02-20 19:58:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:55,696 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:58:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:55,696 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:58:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 932 transitions. [2022-02-20 19:58:55,703 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:58:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 932 transitions. [2022-02-20 19:58:55,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 932 transitions. [2022-02-20 19:58:56,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 932 edges. 932 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:56,568 INFO L225 Difference]: With dead ends: 2066 [2022-02-20 19:58:56,568 INFO L226 Difference]: Without dead ends: 1297 [2022-02-20 19:58:56,569 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:58:56,570 INFO L933 BasicCegarLoop]: 760 mSDtfsCounter, 692 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:56,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 3379 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:58:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-02-20 19:58:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1205. [2022-02-20 19:58:56,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:56,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1297 states. Second operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:56,645 INFO L74 IsIncluded]: Start isIncluded. First operand 1297 states. Second operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:56,648 INFO L87 Difference]: Start difference. First operand 1297 states. Second operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,726 INFO L93 Difference]: Finished difference Result 1297 states and 1779 transitions. [2022-02-20 19:58:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1779 transitions. [2022-02-20 19:58:56,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1297 states. [2022-02-20 19:58:56,749 INFO L87 Difference]: Start difference. First operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1297 states. [2022-02-20 19:58:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,828 INFO L93 Difference]: Finished difference Result 1297 states and 1779 transitions. [2022-02-20 19:58:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1779 transitions. [2022-02-20 19:58:56,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:56,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1003 states have (on average 1.4227318045862414) internal successors, (1427), 1018 states have internal predecessors, (1427), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1667 transitions. [2022-02-20 19:58:56,926 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1667 transitions. Word has length 65 [2022-02-20 19:58:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,927 INFO L470 AbstractCegarLoop]: Abstraction has 1205 states and 1667 transitions. [2022-02-20 19:58:56,927 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:58:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1667 transitions. [2022-02-20 19:58:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:56,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,930 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:58:56,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:56,930 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1333389497, now seen corresponding path program 1 times [2022-02-20 19:58:56,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266813410] [2022-02-20 19:58:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {20747#(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); {20748#(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:58:56,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20748#(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:58:56,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2013#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {20748#(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); {20748#(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:58:57,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {20748#(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); {20748#(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:58:57,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20748#(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:58:57,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2015#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {20707#true} havoc ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {20707#true} assume !(1 == ~p_dw_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#true} ~__retres1~0 := 0; {20707#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {20707#true} #res := ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20707#true} {20707#true} #2009#return; {20707#true} is VALID [2022-02-20 19:58:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {20707#true} havoc ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {20707#true} assume !(1 == ~c_dr_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#true} ~__retres1~1 := 0; {20707#true} is VALID [2022-02-20 19:58:57,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {20707#true} #res := ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,029 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20707#true} {20707#true} #2011#return; {20707#true} is VALID [2022-02-20 19:58:57,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {20749#(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; {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L272 TraceCheckUtils]: 1: Hoare triple {20707#true} call #t~ret8 := is_do_write_p_triggered(); {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#true} havoc ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {20707#true} assume !(1 == ~p_dw_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {20707#true} ~__retres1~0 := 0; {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {20707#true} #res := ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20707#true} {20707#true} #2009#return; {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {20707#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {20707#true} assume !(0 != ~tmp~1); {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L272 TraceCheckUtils]: 10: Hoare triple {20707#true} call #t~ret9 := is_do_read_c_triggered(); {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {20707#true} havoc ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {20707#true} assume !(1 == ~c_dr_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {20707#true} ~__retres1~1 := 0; {20707#true} is VALID [2022-02-20 19:58:57,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {20707#true} #res := ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,033 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20707#true} {20707#true} #2011#return; {20707#true} is VALID [2022-02-20 19:58:57,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {20707#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20707#true} is VALID [2022-02-20 19:58:57,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {20707#true} assume !(0 != ~tmp___0~1); {20707#true} is VALID [2022-02-20 19:58:57,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,035 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20707#true} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2017#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {20748#(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); {20762#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:57,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {20762#(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; {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2019#return; {20708#false} is VALID [2022-02-20 19:58:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {20707#true} havoc ~__retres1~2; {20707#true} is VALID [2022-02-20 19:58:57,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {20707#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20707#true} is VALID [2022-02-20 19:58:57,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#true} #res := ~__retres1~2; {20707#true} is VALID [2022-02-20 19:58:57,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20707#true} {20708#false} #2021#return; {20708#false} is VALID [2022-02-20 19:58:57,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {20707#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {20707#true} is VALID [2022-02-20 19:58:57,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {20707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {20707#true} is VALID [2022-02-20 19:58:57,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {20709#(= ~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; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {20747#(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:58:57,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {20747#(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); {20748#(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:58:57,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20748#(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:58:57,075 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2013#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,077 INFO L272 TraceCheckUtils]: 12: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {20748#(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:58:57,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {20748#(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); {20748#(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:58:57,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {20748#(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); {20748#(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:58:57,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20748#(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:58:57,079 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20748#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2015#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,079 INFO L272 TraceCheckUtils]: 17: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {20749#(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:58:57,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {20749#(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; {20707#true} is VALID [2022-02-20 19:58:57,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {20707#true} call #t~ret8 := is_do_write_p_triggered(); {20707#true} is VALID [2022-02-20 19:58:57,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {20707#true} havoc ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {20707#true} assume !(1 == ~p_dw_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {20707#true} ~__retres1~0 := 0; {20707#true} is VALID [2022-02-20 19:58:57,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {20707#true} #res := ~__retres1~0; {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20707#true} {20707#true} #2009#return; {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {20707#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {20707#true} assume !(0 != ~tmp~1); {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L272 TraceCheckUtils]: 28: Hoare triple {20707#true} call #t~ret9 := is_do_read_c_triggered(); {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {20707#true} havoc ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {20707#true} assume !(1 == ~c_dr_pc~0); {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {20707#true} ~__retres1~1 := 0; {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {20707#true} #res := ~__retres1~1; {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20707#true} {20707#true} #2011#return; {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {20707#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20707#true} is VALID [2022-02-20 19:58:57,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {20707#true} assume !(0 != ~tmp___0~1); {20707#true} is VALID [2022-02-20 19:58:57,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,083 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20707#true} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2017#return; {20709#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,083 INFO L272 TraceCheckUtils]: 39: Hoare triple {20709#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {20748#(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:58:57,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {20748#(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); {20762#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:57,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {20762#(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; {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,085 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {20763#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20709#(= ~q_write_ev~0 ~q_read_ev~0)} #2019#return; {20708#false} is VALID [2022-02-20 19:58:57,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {20708#false} assume !false; {20708#false} is VALID [2022-02-20 19:58:57,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {20708#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; {20708#false} is VALID [2022-02-20 19:58:57,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {20708#false} assume !false; {20708#false} is VALID [2022-02-20 19:58:57,086 INFO L272 TraceCheckUtils]: 47: Hoare triple {20708#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20707#true} is VALID [2022-02-20 19:58:57,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {20707#true} havoc ~__retres1~2; {20707#true} is VALID [2022-02-20 19:58:57,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {20707#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20707#true} is VALID [2022-02-20 19:58:57,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {20707#true} #res := ~__retres1~2; {20707#true} is VALID [2022-02-20 19:58:57,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {20707#true} assume true; {20707#true} is VALID [2022-02-20 19:58:57,087 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20707#true} {20708#false} #2021#return; {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {20708#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; {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {20708#false} assume 0 != eval1_~tmp___1~0#1; {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {20708#false} assume !(0 == ~p_dw_st~0); {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {20708#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; {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {20708#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; {20708#false} is VALID [2022-02-20 19:58:57,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {20708#false} assume 0 == ~c_dr_pc~0; {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {20708#false} assume !false; {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {20708#false} assume !(1 == ~q_free~0); {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {20708#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; {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {20708#false} assume !(~p_last_write~0 == ~c_last_read~0); {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L272 TraceCheckUtils]: 63: Hoare triple {20708#false} call error1(); {20708#false} is VALID [2022-02-20 19:58:57,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {20708#false} assume !false; {20708#false} is VALID [2022-02-20 19:58:57,089 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:58:57,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:57,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266813410] [2022-02-20 19:58:57,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266813410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:57,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:57,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:57,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685973161] [2022-02-20 19:58:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:57,091 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:58:57,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:57,092 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:58:57,136 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:58:57,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:57,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:57,137 INFO L87 Difference]: Start difference. First operand 1205 states and 1667 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:01,160 INFO L93 Difference]: Finished difference Result 2773 states and 3614 transitions. [2022-02-20 19:59:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:01,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1098 transitions. [2022-02-20 19:59:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1098 transitions. [2022-02-20 19:59:01,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1098 transitions. [2022-02-20 19:59:01,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1098 edges. 1098 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:02,113 INFO L225 Difference]: With dead ends: 2773 [2022-02-20 19:59:02,113 INFO L226 Difference]: Without dead ends: 1985 [2022-02-20 19:59:02,115 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:59:02,116 INFO L933 BasicCegarLoop]: 771 mSDtfsCounter, 1527 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:02,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 2611 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:59:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2022-02-20 19:59:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1653. [2022-02-20 19:59:02,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:02,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1985 states. Second operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:02,222 INFO L74 IsIncluded]: Start isIncluded. First operand 1985 states. Second operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:02,223 INFO L87 Difference]: Start difference. First operand 1985 states. Second operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,385 INFO L93 Difference]: Finished difference Result 1985 states and 2591 transitions. [2022-02-20 19:59:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2591 transitions. [2022-02-20 19:59:02,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1985 states. [2022-02-20 19:59:02,395 INFO L87 Difference]: Start difference. First operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1985 states. [2022-02-20 19:59:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,563 INFO L93 Difference]: Finished difference Result 1985 states and 2591 transitions. [2022-02-20 19:59:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2591 transitions. [2022-02-20 19:59:02,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:02,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1356 states have (on average 1.3834808259587021) internal successors, (1876), 1380 states have internal predecessors, (1876), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2234 transitions. [2022-02-20 19:59:02,698 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2234 transitions. Word has length 65 [2022-02-20 19:59:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:02,699 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2234 transitions. [2022-02-20 19:59:02,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2234 transitions. [2022-02-20 19:59:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:02,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:02,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:02,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:02,701 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1199375991, now seen corresponding path program 1 times [2022-02-20 19:59:02,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:02,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114402593] [2022-02-20 19:59:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {30682#(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); {30642#true} is VALID [2022-02-20 19:59:02,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30642#true} {30642#true} #2013#return; {30642#true} is VALID [2022-02-20 19:59:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {30683#(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); {30642#true} is VALID [2022-02-20 19:59:02,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume !(0 == ~q_write_ev~0); {30642#true} is VALID [2022-02-20 19:59:02,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30647#(= ~p_dw_st~0 0)} #2015#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#true} havoc ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume !(1 == ~p_dw_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} ~__retres1~0 := 0; {30642#true} is VALID [2022-02-20 19:59:02,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {30642#true} #res := ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,796 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2009#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#true} havoc ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume !(1 == ~c_dr_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} ~__retres1~1 := 0; {30642#true} is VALID [2022-02-20 19:59:02,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {30642#true} #res := ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,801 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2011#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {30684#(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; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,802 INFO L272 TraceCheckUtils]: 1: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30642#true} is VALID [2022-02-20 19:59:02,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} havoc ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {30642#true} assume !(1 == ~p_dw_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {30642#true} ~__retres1~0 := 0; {30642#true} is VALID [2022-02-20 19:59:02,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {30642#true} #res := ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,803 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2009#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30642#true} is VALID [2022-02-20 19:59:02,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {30642#true} havoc ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {30642#true} assume !(1 == ~c_dr_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {30642#true} ~__retres1~1 := 0; {30642#true} is VALID [2022-02-20 19:59:02,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {30642#true} #res := ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,805 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2011#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,807 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30647#(= ~p_dw_st~0 0)} #2017#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {30683#(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); {30642#true} is VALID [2022-02-20 19:59:02,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume !(1 == ~q_write_ev~0); {30642#true} is VALID [2022-02-20 19:59:02,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30642#true} {30647#(= ~p_dw_st~0 0)} #2019#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#true} havoc ~__retres1~2; {30642#true} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {30647#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {30647#(= ~p_dw_st~0 0)} assume true; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,821 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30647#(= ~p_dw_st~0 0)} {30647#(= ~p_dw_st~0 0)} #2021#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {30642#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {30642#true} is VALID [2022-02-20 19:59:02,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {30642#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {30642#true} is VALID [2022-02-20 19:59:02,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {30642#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {30642#true} is VALID [2022-02-20 19:59:02,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {30642#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; {30642#true} is VALID [2022-02-20 19:59:02,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {30642#true} call update_channels1(); {30682#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:02,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {30682#(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); {30642#true} is VALID [2022-02-20 19:59:02,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,823 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30642#true} {30642#true} #2013#return; {30642#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {30642#true} assume { :begin_inline_init_threads1 } true; {30642#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {30642#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {30647#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {30647#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,824 INFO L272 TraceCheckUtils]: 12: Hoare triple {30647#(= ~p_dw_st~0 0)} call fire_delta_events1(); {30683#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {30683#(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); {30642#true} is VALID [2022-02-20 19:59:02,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {30642#true} assume !(0 == ~q_write_ev~0); {30642#true} is VALID [2022-02-20 19:59:02,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,825 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30642#true} {30647#(= ~p_dw_st~0 0)} #2015#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,826 INFO L272 TraceCheckUtils]: 17: Hoare triple {30647#(= ~p_dw_st~0 0)} call activate_threads1(); {30684#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {30684#(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; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,826 INFO L272 TraceCheckUtils]: 19: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30642#true} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {30642#true} havoc ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {30642#true} assume !(1 == ~p_dw_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {30642#true} ~__retres1~0 := 0; {30642#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {30642#true} #res := ~__retres1~0; {30642#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,827 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2009#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,828 INFO L272 TraceCheckUtils]: 28: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30642#true} is VALID [2022-02-20 19:59:02,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {30642#true} havoc ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {30642#true} assume !(1 == ~c_dr_pc~0); {30642#true} is VALID [2022-02-20 19:59:02,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {30642#true} ~__retres1~1 := 0; {30642#true} is VALID [2022-02-20 19:59:02,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {30642#true} #res := ~__retres1~1; {30642#true} is VALID [2022-02-20 19:59:02,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,830 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30642#true} {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2011#return; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:02,831 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30685#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30647#(= ~p_dw_st~0 0)} #2017#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,832 INFO L272 TraceCheckUtils]: 39: Hoare triple {30647#(= ~p_dw_st~0 0)} call reset_delta_events1(); {30683#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:02,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {30683#(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); {30642#true} is VALID [2022-02-20 19:59:02,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {30642#true} assume !(1 == ~q_write_ev~0); {30642#true} is VALID [2022-02-20 19:59:02,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {30642#true} assume true; {30642#true} is VALID [2022-02-20 19:59:02,833 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30642#true} {30647#(= ~p_dw_st~0 0)} #2019#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {30647#(= ~p_dw_st~0 0)} assume !false; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {30647#(= ~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; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {30647#(= ~p_dw_st~0 0)} assume !false; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,834 INFO L272 TraceCheckUtils]: 47: Hoare triple {30647#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30642#true} is VALID [2022-02-20 19:59:02,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {30642#true} havoc ~__retres1~2; {30642#true} is VALID [2022-02-20 19:59:02,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {30642#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {30647#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {30647#(= ~p_dw_st~0 0)} assume true; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,836 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30647#(= ~p_dw_st~0 0)} {30647#(= ~p_dw_st~0 0)} #2021#return; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {30647#(= ~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; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {30647#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {30647#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:02,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {30647#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {30643#false} is VALID [2022-02-20 19:59:02,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {30643#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; {30643#false} is VALID [2022-02-20 19:59:02,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {30643#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; {30643#false} is VALID [2022-02-20 19:59:02,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {30643#false} assume 0 == ~c_dr_pc~0; {30643#false} is VALID [2022-02-20 19:59:02,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {30643#false} assume !false; {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {30643#false} assume !(1 == ~q_free~0); {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {30643#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; {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {30643#false} assume !(~p_last_write~0 == ~c_last_read~0); {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L272 TraceCheckUtils]: 63: Hoare triple {30643#false} call error1(); {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {30643#false} assume !false; {30643#false} is VALID [2022-02-20 19:59:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:02,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:02,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114402593] [2022-02-20 19:59:02,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114402593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:02,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:02,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:02,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203833518] [2022-02-20 19:59:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:02,840 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:59:02,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:02,841 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:59:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:02,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:02,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:02,882 INFO L87 Difference]: Start difference. First operand 1653 states and 2234 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:59:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,791 INFO L93 Difference]: Finished difference Result 4131 states and 5388 transitions. [2022-02-20 19:59:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:05,791 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:59:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:05,791 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:59:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1053 transitions. [2022-02-20 19:59:05,796 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:59:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1053 transitions. [2022-02-20 19:59:05,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1053 transitions. [2022-02-20 19:59:06,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1053 edges. 1053 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,934 INFO L225 Difference]: With dead ends: 4131 [2022-02-20 19:59:06,934 INFO L226 Difference]: Without dead ends: 2897 [2022-02-20 19:59:06,936 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:59:06,937 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 1490 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:06,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 2187 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-02-20 19:59:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2789. [2022-02-20 19:59:07,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:07,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2897 states. Second operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:59:07,143 INFO L74 IsIncluded]: Start isIncluded. First operand 2897 states. Second operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:59:07,147 INFO L87 Difference]: Start difference. First operand 2897 states. Second operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:59:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,445 INFO L93 Difference]: Finished difference Result 2897 states and 3755 transitions. [2022-02-20 19:59:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3755 transitions. [2022-02-20 19:59:07,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2897 states. [2022-02-20 19:59:07,460 INFO L87 Difference]: Start difference. First operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2897 states. [2022-02-20 19:59:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,719 INFO L93 Difference]: Finished difference Result 2897 states and 3755 transitions. [2022-02-20 19:59:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3755 transitions. [2022-02-20 19:59:07,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:07,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2227 states have (on average 1.3161203412662774) internal successors, (2931), 2273 states have internal predecessors, (2931), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:59:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3632 transitions. [2022-02-20 19:59:08,167 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3632 transitions. Word has length 65 [2022-02-20 19:59:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:08,167 INFO L470 AbstractCegarLoop]: Abstraction has 2789 states and 3632 transitions. [2022-02-20 19:59:08,168 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:59:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3632 transitions. [2022-02-20 19:59:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:08,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:08,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:08,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:08,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -791607456, now seen corresponding path program 1 times [2022-02-20 19:59:08,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:08,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559495550] [2022-02-20 19:59:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {45827#(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); {45787#true} is VALID [2022-02-20 19:59:08,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2013#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {45828#(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); {45787#true} is VALID [2022-02-20 19:59:08,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume !(0 == ~q_write_ev~0); {45787#true} is VALID [2022-02-20 19:59:08,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2015#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {45787#true} havoc ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume !(1 == ~p_dw_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} ~__retres1~0 := 0; {45787#true} is VALID [2022-02-20 19:59:08,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {45787#true} #res := ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,243 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45787#true} {45787#true} #2009#return; {45787#true} is VALID [2022-02-20 19:59:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {45787#true} havoc ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume !(1 == ~c_dr_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} ~__retres1~1 := 0; {45787#true} is VALID [2022-02-20 19:59:08,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {45787#true} #res := ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,248 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45787#true} {45787#true} #2011#return; {45787#true} is VALID [2022-02-20 19:59:08,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {45829#(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; {45787#true} is VALID [2022-02-20 19:59:08,248 INFO L272 TraceCheckUtils]: 1: Hoare triple {45787#true} call #t~ret8 := is_do_write_p_triggered(); {45787#true} is VALID [2022-02-20 19:59:08,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} havoc ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {45787#true} assume !(1 == ~p_dw_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {45787#true} ~__retres1~0 := 0; {45787#true} is VALID [2022-02-20 19:59:08,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {45787#true} #res := ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,268 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45787#true} {45787#true} #2009#return; {45787#true} is VALID [2022-02-20 19:59:08,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {45787#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {45787#true} assume !(0 != ~tmp~1); {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L272 TraceCheckUtils]: 10: Hoare triple {45787#true} call #t~ret9 := is_do_read_c_triggered(); {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {45787#true} havoc ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {45787#true} assume !(1 == ~c_dr_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {45787#true} ~__retres1~1 := 0; {45787#true} is VALID [2022-02-20 19:59:08,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {45787#true} #res := ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,270 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45787#true} {45787#true} #2011#return; {45787#true} is VALID [2022-02-20 19:59:08,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {45787#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45787#true} is VALID [2022-02-20 19:59:08,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {45787#true} assume !(0 != ~tmp___0~1); {45787#true} is VALID [2022-02-20 19:59:08,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,271 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2017#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {45828#(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); {45787#true} is VALID [2022-02-20 19:59:08,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume !(1 == ~q_write_ev~0); {45787#true} is VALID [2022-02-20 19:59:08,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2019#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {45787#true} havoc ~__retres1~2; {45787#true} is VALID [2022-02-20 19:59:08,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45787#true} is VALID [2022-02-20 19:59:08,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} #res := ~__retres1~2; {45787#true} is VALID [2022-02-20 19:59:08,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,286 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2021#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {45787#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {45787#true} is VALID [2022-02-20 19:59:08,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {45787#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {45787#true} is VALID [2022-02-20 19:59:08,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {45787#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {45789#(= ~q_free~0 1)} call update_channels1(); {45827#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:08,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {45827#(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); {45787#true} is VALID [2022-02-20 19:59:08,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2013#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {45789#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {45789#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {45789#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {45789#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {45789#(= ~q_free~0 1)} call fire_delta_events1(); {45828#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:08,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {45828#(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); {45787#true} is VALID [2022-02-20 19:59:08,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {45787#true} assume !(0 == ~q_write_ev~0); {45787#true} is VALID [2022-02-20 19:59:08,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2015#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {45789#(= ~q_free~0 1)} call activate_threads1(); {45829#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:08,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {45829#(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; {45787#true} is VALID [2022-02-20 19:59:08,292 INFO L272 TraceCheckUtils]: 19: Hoare triple {45787#true} call #t~ret8 := is_do_write_p_triggered(); {45787#true} is VALID [2022-02-20 19:59:08,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {45787#true} havoc ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {45787#true} assume !(1 == ~p_dw_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {45787#true} ~__retres1~0 := 0; {45787#true} is VALID [2022-02-20 19:59:08,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {45787#true} #res := ~__retres1~0; {45787#true} is VALID [2022-02-20 19:59:08,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,293 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45787#true} {45787#true} #2009#return; {45787#true} is VALID [2022-02-20 19:59:08,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {45787#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {45787#true} assume !(0 != ~tmp~1); {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L272 TraceCheckUtils]: 28: Hoare triple {45787#true} call #t~ret9 := is_do_read_c_triggered(); {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {45787#true} havoc ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {45787#true} assume !(1 == ~c_dr_pc~0); {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {45787#true} ~__retres1~1 := 0; {45787#true} is VALID [2022-02-20 19:59:08,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {45787#true} #res := ~__retres1~1; {45787#true} is VALID [2022-02-20 19:59:08,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,295 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45787#true} {45787#true} #2011#return; {45787#true} is VALID [2022-02-20 19:59:08,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {45787#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45787#true} is VALID [2022-02-20 19:59:08,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {45787#true} assume !(0 != ~tmp___0~1); {45787#true} is VALID [2022-02-20 19:59:08,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,296 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2017#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,296 INFO L272 TraceCheckUtils]: 39: Hoare triple {45789#(= ~q_free~0 1)} call reset_delta_events1(); {45828#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:08,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {45828#(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); {45787#true} is VALID [2022-02-20 19:59:08,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {45787#true} assume !(1 == ~q_write_ev~0); {45787#true} is VALID [2022-02-20 19:59:08,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,297 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2019#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {45789#(= ~q_free~0 1)} assume !false; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {45789#(= ~q_free~0 1)} assume !false; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,298 INFO L272 TraceCheckUtils]: 47: Hoare triple {45789#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45787#true} is VALID [2022-02-20 19:59:08,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {45787#true} havoc ~__retres1~2; {45787#true} is VALID [2022-02-20 19:59:08,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {45787#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45787#true} is VALID [2022-02-20 19:59:08,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {45787#true} #res := ~__retres1~2; {45787#true} is VALID [2022-02-20 19:59:08,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {45787#true} assume true; {45787#true} is VALID [2022-02-20 19:59:08,299 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45787#true} {45789#(= ~q_free~0 1)} #2021#return; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {45789#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,300 INFO L290 TraceCheckUtils]: 55: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,300 INFO L290 TraceCheckUtils]: 56: Hoare triple {45789#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {45789#(= ~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; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {45789#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {45789#(= ~q_free~0 1)} assume !false; {45789#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:08,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {45789#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45788#false} is VALID [2022-02-20 19:59:08,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {45788#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; {45788#false} is VALID [2022-02-20 19:59:08,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {45788#false} assume !(~p_last_write~0 == ~c_last_read~0); {45788#false} is VALID [2022-02-20 19:59:08,303 INFO L272 TraceCheckUtils]: 64: Hoare triple {45788#false} call error1(); {45788#false} is VALID [2022-02-20 19:59:08,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {45788#false} assume !false; {45788#false} is VALID [2022-02-20 19:59:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:08,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:08,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559495550] [2022-02-20 19:59:08,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559495550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:08,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:08,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:08,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836554904] [2022-02-20 19:59:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:08,305 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:59:08,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:08,305 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:59:08,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:08,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:08,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:08,348 INFO L87 Difference]: Start difference. First operand 2789 states and 3632 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:59:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,178 INFO L93 Difference]: Finished difference Result 6241 states and 7964 transitions. [2022-02-20 19:59:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:12,178 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:59:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:12,179 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:59:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2022-02-20 19:59:12,185 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:59:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2022-02-20 19:59:12,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1041 transitions. [2022-02-20 19:59:12,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1041 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:13,531 INFO L225 Difference]: With dead ends: 6241 [2022-02-20 19:59:13,531 INFO L226 Difference]: Without dead ends: 3878 [2022-02-20 19:59:13,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:13,536 INFO L933 BasicCegarLoop]: 768 mSDtfsCounter, 868 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:13,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [877 Valid, 2182 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-02-20 19:59:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3622. [2022-02-20 19:59:13,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:13,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3878 states. Second operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:59:13,795 INFO L74 IsIncluded]: Start isIncluded. First operand 3878 states. Second operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:59:13,799 INFO L87 Difference]: Start difference. First operand 3878 states. Second operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:59:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,282 INFO L93 Difference]: Finished difference Result 3878 states and 4937 transitions. [2022-02-20 19:59:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 4937 transitions. [2022-02-20 19:59:14,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3878 states. [2022-02-20 19:59:14,301 INFO L87 Difference]: Start difference. First operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3878 states. [2022-02-20 19:59:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,754 INFO L93 Difference]: Finished difference Result 3878 states and 4937 transitions. [2022-02-20 19:59:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 4937 transitions. [2022-02-20 19:59:14,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:14,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 2872 states have (on average 1.2959610027855153) internal successors, (3722), 2925 states have internal predecessors, (3722), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:59:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4633 transitions. [2022-02-20 19:59:15,479 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4633 transitions. Word has length 66 [2022-02-20 19:59:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:15,479 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 4633 transitions. [2022-02-20 19:59:15,480 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:59:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4633 transitions. [2022-02-20 19:59:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:59:15,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:15,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:15,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:15,486 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -993648705, now seen corresponding path program 1 times [2022-02-20 19:59:15,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:15,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903267349] [2022-02-20 19:59:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {66870#(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); {66830#true} is VALID [2022-02-20 19:59:15,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2013#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {66871#(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); {66830#true} is VALID [2022-02-20 19:59:15,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume !(0 == ~q_write_ev~0); {66830#true} is VALID [2022-02-20 19:59:15,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2015#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {66830#true} havoc ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume !(1 == ~p_dw_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} ~__retres1~0 := 0; {66830#true} is VALID [2022-02-20 19:59:15,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {66830#true} #res := ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,587 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66830#true} {66830#true} #2009#return; {66830#true} is VALID [2022-02-20 19:59:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {66830#true} havoc ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume !(1 == ~c_dr_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} ~__retres1~1 := 0; {66830#true} is VALID [2022-02-20 19:59:15,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {66830#true} #res := ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,595 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66830#true} {66830#true} #2011#return; {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {66872#(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; {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L272 TraceCheckUtils]: 1: Hoare triple {66830#true} call #t~ret8 := is_do_write_p_triggered(); {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} havoc ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {66830#true} assume !(1 == ~p_dw_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {66830#true} ~__retres1~0 := 0; {66830#true} is VALID [2022-02-20 19:59:15,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {66830#true} #res := ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66830#true} {66830#true} #2009#return; {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {66830#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {66830#true} assume !(0 != ~tmp~1); {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L272 TraceCheckUtils]: 10: Hoare triple {66830#true} call #t~ret9 := is_do_read_c_triggered(); {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {66830#true} havoc ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {66830#true} assume !(1 == ~c_dr_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {66830#true} ~__retres1~1 := 0; {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {66830#true} #res := ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66830#true} {66830#true} #2011#return; {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {66830#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66830#true} is VALID [2022-02-20 19:59:15,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {66830#true} assume !(0 != ~tmp___0~1); {66830#true} is VALID [2022-02-20 19:59:15,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,599 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2017#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {66871#(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); {66830#true} is VALID [2022-02-20 19:59:15,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume !(1 == ~q_write_ev~0); {66830#true} is VALID [2022-02-20 19:59:15,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2019#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {66830#true} havoc ~__retres1~2; {66830#true} is VALID [2022-02-20 19:59:15,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66830#true} is VALID [2022-02-20 19:59:15,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} #res := ~__retres1~2; {66830#true} is VALID [2022-02-20 19:59:15,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,615 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2021#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {66830#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {66830#true} is VALID [2022-02-20 19:59:15,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {66830#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {66830#true} is VALID [2022-02-20 19:59:15,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {66830#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~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; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {66832#(= ~p_dw_pc~0 0)} call update_channels1(); {66870#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:15,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {66870#(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); {66830#true} is VALID [2022-02-20 19:59:15,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,617 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2013#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,619 INFO L272 TraceCheckUtils]: 12: Hoare triple {66832#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {66871#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:15,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {66871#(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); {66830#true} is VALID [2022-02-20 19:59:15,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {66830#true} assume !(0 == ~q_write_ev~0); {66830#true} is VALID [2022-02-20 19:59:15,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,620 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2015#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,621 INFO L272 TraceCheckUtils]: 17: Hoare triple {66832#(= ~p_dw_pc~0 0)} call activate_threads1(); {66872#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:15,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {66872#(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; {66830#true} is VALID [2022-02-20 19:59:15,621 INFO L272 TraceCheckUtils]: 19: Hoare triple {66830#true} call #t~ret8 := is_do_write_p_triggered(); {66830#true} is VALID [2022-02-20 19:59:15,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {66830#true} havoc ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {66830#true} assume !(1 == ~p_dw_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {66830#true} ~__retres1~0 := 0; {66830#true} is VALID [2022-02-20 19:59:15,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {66830#true} #res := ~__retres1~0; {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {66830#true} {66830#true} #2009#return; {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {66830#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {66830#true} assume !(0 != ~tmp~1); {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {66830#true} call #t~ret9 := is_do_read_c_triggered(); {66830#true} is VALID [2022-02-20 19:59:15,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {66830#true} havoc ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {66830#true} assume !(1 == ~c_dr_pc~0); {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {66830#true} ~__retres1~1 := 0; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {66830#true} #res := ~__retres1~1; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {66830#true} {66830#true} #2011#return; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {66830#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66830#true} is VALID [2022-02-20 19:59:15,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {66830#true} assume !(0 != ~tmp___0~1); {66830#true} is VALID [2022-02-20 19:59:15,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,624 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2017#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,625 INFO L272 TraceCheckUtils]: 39: Hoare triple {66832#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {66871#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:15,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {66871#(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); {66830#true} is VALID [2022-02-20 19:59:15,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {66830#true} assume !(1 == ~q_write_ev~0); {66830#true} is VALID [2022-02-20 19:59:15,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,626 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2019#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume !false; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {66832#(= ~p_dw_pc~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; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume !false; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,627 INFO L272 TraceCheckUtils]: 47: Hoare triple {66832#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66830#true} is VALID [2022-02-20 19:59:15,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {66830#true} havoc ~__retres1~2; {66830#true} is VALID [2022-02-20 19:59:15,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {66830#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66830#true} is VALID [2022-02-20 19:59:15,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {66830#true} #res := ~__retres1~2; {66830#true} is VALID [2022-02-20 19:59:15,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {66830#true} assume true; {66830#true} is VALID [2022-02-20 19:59:15,628 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {66830#true} {66832#(= ~p_dw_pc~0 0)} #2021#return; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {66832#(= ~p_dw_pc~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; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {66832#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:15,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {66832#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {66831#false} is VALID [2022-02-20 19:59:15,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {66831#false} assume 1 == ~p_dw_pc~0; {66831#false} is VALID [2022-02-20 19:59:15,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {66831#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {66831#false} is VALID [2022-02-20 19:59:15,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {66831#false} assume !false; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {66831#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {66831#false} assume { :end_inline_do_write_p } true; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {66831#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; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {66831#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; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {66831#false} assume 0 == ~c_dr_pc~0; {66831#false} is VALID [2022-02-20 19:59:15,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {66831#false} assume !false; {66831#false} is VALID [2022-02-20 19:59:15,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {66831#false} assume !(1 == ~q_free~0); {66831#false} is VALID [2022-02-20 19:59:15,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {66831#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; {66831#false} is VALID [2022-02-20 19:59:15,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {66831#false} assume !(~p_last_write~0 == ~c_last_read~0); {66831#false} is VALID [2022-02-20 19:59:15,632 INFO L272 TraceCheckUtils]: 70: Hoare triple {66831#false} call error1(); {66831#false} is VALID [2022-02-20 19:59:15,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {66831#false} assume !false; {66831#false} is VALID [2022-02-20 19:59:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:15,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:15,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903267349] [2022-02-20 19:59:15,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903267349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:15,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:15,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:15,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164452223] [2022-02-20 19:59:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2022-02-20 19:59:15,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:15,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:59:15,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:15,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:15,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:15,687 INFO L87 Difference]: Start difference. First operand 3622 states and 4633 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:59:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:19,849 INFO L93 Difference]: Finished difference Result 7633 states and 9607 transitions. [2022-02-20 19:59:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:19,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2022-02-20 19:59:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:59:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1038 transitions. [2022-02-20 19:59:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:59:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1038 transitions. [2022-02-20 19:59:19,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1038 transitions. [2022-02-20 19:59:20,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1038 edges. 1038 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:21,339 INFO L225 Difference]: With dead ends: 7633 [2022-02-20 19:59:21,339 INFO L226 Difference]: Without dead ends: 4433 [2022-02-20 19:59:21,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:21,345 INFO L933 BasicCegarLoop]: 783 mSDtfsCounter, 1463 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:21,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1907 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2022-02-20 19:59:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4185. [2022-02-20 19:59:21,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:21,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4433 states. Second operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:21,647 INFO L74 IsIncluded]: Start isIncluded. First operand 4433 states. Second operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:21,653 INFO L87 Difference]: Start difference. First operand 4433 states. Second operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,241 INFO L93 Difference]: Finished difference Result 4433 states and 5604 transitions. [2022-02-20 19:59:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 5604 transitions. [2022-02-20 19:59:22,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4433 states. [2022-02-20 19:59:22,256 INFO L87 Difference]: Start difference. First operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4433 states. [2022-02-20 19:59:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,777 INFO L93 Difference]: Finished difference Result 4433 states and 5604 transitions. [2022-02-20 19:59:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 5604 transitions. [2022-02-20 19:59:22,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:22,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3319 states have (on average 1.2862307924073517) internal successors, (4269), 3378 states have internal predecessors, (4269), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5313 transitions. [2022-02-20 19:59:23,491 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5313 transitions. Word has length 72 [2022-02-20 19:59:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:23,492 INFO L470 AbstractCegarLoop]: Abstraction has 4185 states and 5313 transitions. [2022-02-20 19:59:23,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:59:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5313 transitions. [2022-02-20 19:59:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:59:23,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:23,493 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:23,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:23,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1255358187, now seen corresponding path program 1 times [2022-02-20 19:59:23,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:23,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471463152] [2022-02-20 19:59:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {91664#(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); {91623#true} is VALID [2022-02-20 19:59:23,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91623#true} {91623#true} #2013#return; {91623#true} is VALID [2022-02-20 19:59:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {91665#(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); {91623#true} is VALID [2022-02-20 19:59:23,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume !(0 == ~q_write_ev~0); {91623#true} is VALID [2022-02-20 19:59:23,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91623#true} {91623#true} #2015#return; {91623#true} is VALID [2022-02-20 19:59:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {91623#true} havoc ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume !(1 == ~p_dw_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} ~__retres1~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {91623#true} #res := ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,575 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91623#true} {91623#true} #2009#return; {91623#true} is VALID [2022-02-20 19:59:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {91623#true} havoc ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume !(1 == ~c_dr_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} ~__retres1~1 := 0; {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {91623#true} #res := ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91623#true} {91623#true} #2011#return; {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {91666#(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; {91623#true} is VALID [2022-02-20 19:59:23,581 INFO L272 TraceCheckUtils]: 1: Hoare triple {91623#true} call #t~ret8 := is_do_write_p_triggered(); {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} havoc ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {91623#true} assume !(1 == ~p_dw_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {91623#true} ~__retres1~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {91623#true} #res := ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91623#true} {91623#true} #2009#return; {91623#true} is VALID [2022-02-20 19:59:23,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {91623#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {91623#true} assume !(0 != ~tmp~1); {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L272 TraceCheckUtils]: 10: Hoare triple {91623#true} call #t~ret9 := is_do_read_c_triggered(); {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {91623#true} havoc ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {91623#true} assume !(1 == ~c_dr_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {91623#true} ~__retres1~1 := 0; {91623#true} is VALID [2022-02-20 19:59:23,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {91623#true} #res := ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91623#true} {91623#true} #2011#return; {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {91623#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {91623#true} assume !(0 != ~tmp___0~1); {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,584 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {91623#true} {91623#true} #2017#return; {91623#true} is VALID [2022-02-20 19:59:23,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {91665#(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); {91623#true} is VALID [2022-02-20 19:59:23,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume !(1 == ~q_write_ev~0); {91623#true} is VALID [2022-02-20 19:59:23,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91623#true} {91623#true} #2019#return; {91623#true} is VALID [2022-02-20 19:59:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {91623#true} havoc ~__retres1~2; {91623#true} is VALID [2022-02-20 19:59:23,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91623#true} is VALID [2022-02-20 19:59:23,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} #res := ~__retres1~2; {91623#true} is VALID [2022-02-20 19:59:23,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,592 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91623#true} {91623#true} #2021#return; {91623#true} is VALID [2022-02-20 19:59:23,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {91623#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;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {91623#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {91623#true} is VALID [2022-02-20 19:59:23,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {91623#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#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; {91623#true} is VALID [2022-02-20 19:59:23,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {91623#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; {91623#true} is VALID [2022-02-20 19:59:23,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {91623#true} call update_channels1(); {91664#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:23,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {91664#(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); {91623#true} is VALID [2022-02-20 19:59:23,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,594 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91623#true} {91623#true} #2013#return; {91623#true} is VALID [2022-02-20 19:59:23,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {91623#true} assume { :begin_inline_init_threads1 } true; {91623#true} is VALID [2022-02-20 19:59:23,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {91623#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {91623#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {91623#true} assume { :end_inline_init_threads1 } true; {91623#true} is VALID [2022-02-20 19:59:23,595 INFO L272 TraceCheckUtils]: 12: Hoare triple {91623#true} call fire_delta_events1(); {91665#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {91665#(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); {91623#true} is VALID [2022-02-20 19:59:23,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {91623#true} assume !(0 == ~q_write_ev~0); {91623#true} is VALID [2022-02-20 19:59:23,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91623#true} {91623#true} #2015#return; {91623#true} is VALID [2022-02-20 19:59:23,596 INFO L272 TraceCheckUtils]: 17: Hoare triple {91623#true} call activate_threads1(); {91666#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:23,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {91666#(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; {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L272 TraceCheckUtils]: 19: Hoare triple {91623#true} call #t~ret8 := is_do_write_p_triggered(); {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {91623#true} havoc ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {91623#true} assume !(1 == ~p_dw_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {91623#true} ~__retres1~0 := 0; {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {91623#true} #res := ~__retres1~0; {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,597 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {91623#true} {91623#true} #2009#return; {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {91623#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {91623#true} assume !(0 != ~tmp~1); {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L272 TraceCheckUtils]: 28: Hoare triple {91623#true} call #t~ret9 := is_do_read_c_triggered(); {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {91623#true} havoc ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {91623#true} assume !(1 == ~c_dr_pc~0); {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {91623#true} ~__retres1~1 := 0; {91623#true} is VALID [2022-02-20 19:59:23,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {91623#true} #res := ~__retres1~1; {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {91623#true} {91623#true} #2011#return; {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {91623#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {91623#true} assume !(0 != ~tmp___0~1); {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,599 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {91623#true} {91623#true} #2017#return; {91623#true} is VALID [2022-02-20 19:59:23,600 INFO L272 TraceCheckUtils]: 39: Hoare triple {91623#true} call reset_delta_events1(); {91665#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {91665#(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); {91623#true} is VALID [2022-02-20 19:59:23,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {91623#true} assume !(1 == ~q_write_ev~0); {91623#true} is VALID [2022-02-20 19:59:23,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,600 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {91623#true} {91623#true} #2019#return; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {91623#true} assume !false; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {91623#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {91623#true} assume !false; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L272 TraceCheckUtils]: 47: Hoare triple {91623#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {91623#true} havoc ~__retres1~2; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {91623#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91623#true} is VALID [2022-02-20 19:59:23,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {91623#true} #res := ~__retres1~2; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {91623#true} assume true; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {91623#true} {91623#true} #2021#return; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {91623#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {91623#true} assume 0 != eval1_~tmp___1~0#1; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {91623#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {91623#true} is VALID [2022-02-20 19:59:23,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {91623#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {91623#true} is VALID [2022-02-20 19:59:23,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {91623#true} assume 0 == ~p_dw_pc~0; {91623#true} is VALID [2022-02-20 19:59:23,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {91623#true} assume !false; {91623#true} is VALID [2022-02-20 19:59:23,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {91623#true} assume !(0 == ~q_free~0); {91623#true} is VALID [2022-02-20 19:59:23,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {91623#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} 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; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {91662#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:23,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {91662#(= ~p_last_write~0 ~q_buf_0~0)} 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; {91663#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:59:23,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {91663#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {91624#false} is VALID [2022-02-20 19:59:23,608 INFO L272 TraceCheckUtils]: 71: Hoare triple {91624#false} call error1(); {91624#false} is VALID [2022-02-20 19:59:23,608 INFO L290 TraceCheckUtils]: 72: Hoare triple {91624#false} assume !false; {91624#false} is VALID [2022-02-20 19:59:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:23,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:23,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471463152] [2022-02-20 19:59:23,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471463152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:23,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:23,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:23,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742860928] [2022-02-20 19:59:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:59:23,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:23,610 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), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:23,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:23,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:23,666 INFO L87 Difference]: Start difference. First operand 4185 states and 5313 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)