./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:33,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:33,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:33,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:33,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:33,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:33,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:33,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:33,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:33,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:33,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:33,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:33,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:33,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:33,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:33,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:33,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:33,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:33,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:33,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:33,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:33,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:33,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:33,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:33,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:33,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:33,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:33,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:33,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:33,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:33,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:33,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:33,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:33,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:33,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:33,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:33,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:33,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:33,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:33,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:33,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:33,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:00:33,958 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:33,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:33,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:33,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:33,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:33,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:33,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:33,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:33,961 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:33,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:33,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:33,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:33,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:33,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:33,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:33,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:33,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:33,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:33,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:33,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:33,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:33,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:33,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:33,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:33,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:33,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:33,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:33,970 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 -> 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f [2022-02-20 20:00:34,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:34,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:34,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:34,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:34,204 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:34,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2022-02-20 20:00:34,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bb6ad9/a5b6874362204df1806033d359c479fa/FLAG9d2c382bc [2022-02-20 20:00:34,696 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:34,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2022-02-20 20:00:34,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bb6ad9/a5b6874362204df1806033d359c479fa/FLAG9d2c382bc [2022-02-20 20:00:35,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bb6ad9/a5b6874362204df1806033d359c479fa [2022-02-20 20:00:35,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:35,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:35,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:35,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:35,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:35,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12445323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35, skipping insertion in model container [2022-02-20 20:00:35,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:35,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:35,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[911,924] [2022-02-20 20:00:35,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[8416,8429] [2022-02-20 20:00:35,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:35,399 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:35,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_3.cil+token_ring.10.cil-1.c[911,924] [2022-02-20 20:00:35,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[8416,8429] [2022-02-20 20:00:35,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:35,489 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:35,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35 WrapperNode [2022-02-20 20:00:35,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:35,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:35,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:35,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:35,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,581 INFO L137 Inliner]: procedures = 75, calls = 92, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 967 [2022-02-20 20:00:35,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:35,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:35,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:35,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:35,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:35,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:35,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:35,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:35,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (1/1) ... [2022-02-20 20:00:35,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:35,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:35,696 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 20:00:35,704 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 20:00:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:35,727 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:35,727 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:35,727 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:35,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:35,744 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:35,744 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:35,744 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:00:35,744 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:00:35,876 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:35,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:36,585 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:36,586 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:36,644 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:36,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:36,660 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 20:00:36,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:36 BoogieIcfgContainer [2022-02-20 20:00:36,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:36,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:36,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:36,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:36,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:35" (1/3) ... [2022-02-20 20:00:36,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761d72ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:36, skipping insertion in model container [2022-02-20 20:00:36,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:35" (2/3) ... [2022-02-20 20:00:36,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761d72ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:36, skipping insertion in model container [2022-02-20 20:00:36,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:36" (3/3) ... [2022-02-20 20:00:36,670 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c [2022-02-20 20:00:36,673 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:36,674 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:36,710 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:36,715 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 20:00:36,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 397 states have (on average 1.6347607052896724) internal successors, (649), 405 states have internal predecessors, (649), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 20:00:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:36,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:36,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:36,774 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2009342201, now seen corresponding path program 1 times [2022-02-20 20:00:36,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:36,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79043692] [2022-02-20 20:00:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#(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); {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:37,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:37,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {462#(= ~q_read_ev~0 2)} #1750#return; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#(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; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#(= |old(~q_read_ev~0)| 0)} assume true; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#(= |old(~q_read_ev~0)| 0)} {462#(= ~q_read_ev~0 2)} #1752#return; {461#false} is VALID [2022-02-20 20:00:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} havoc ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume 1 == ~p_dw_pc~0; {460#true} is VALID [2022-02-20 20:00:37,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {460#true} is VALID [2022-02-20 20:00:37,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} #res := ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,111 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {460#true} {460#true} #1746#return; {460#true} is VALID [2022-02-20 20:00:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} havoc ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume 1 == ~c_dr_pc~0; {460#true} is VALID [2022-02-20 20:00:37,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {460#true} is VALID [2022-02-20 20:00:37,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} #res := ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,123 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {460#true} {460#true} #1748#return; {460#true} is VALID [2022-02-20 20:00:37,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(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; {460#true} is VALID [2022-02-20 20:00:37,124 INFO L272 TraceCheckUtils]: 1: Hoare triple {460#true} call #t~ret8 := is_do_write_p_triggered(); {460#true} is VALID [2022-02-20 20:00:37,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} havoc ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} assume 1 == ~p_dw_pc~0; {460#true} is VALID [2022-02-20 20:00:37,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {460#true} is VALID [2022-02-20 20:00:37,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} #res := ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,127 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {460#true} {460#true} #1746#return; {460#true} is VALID [2022-02-20 20:00:37,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {460#true} is VALID [2022-02-20 20:00:37,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {460#true} is VALID [2022-02-20 20:00:37,127 INFO L272 TraceCheckUtils]: 10: Hoare triple {460#true} call #t~ret9 := is_do_read_c_triggered(); {460#true} is VALID [2022-02-20 20:00:37,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} havoc ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#true} assume 1 == ~c_dr_pc~0; {460#true} is VALID [2022-02-20 20:00:37,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {460#true} is VALID [2022-02-20 20:00:37,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} #res := ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,129 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {460#true} {460#true} #1748#return; {460#true} is VALID [2022-02-20 20:00:37,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {460#true} is VALID [2022-02-20 20:00:37,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {460#true} is VALID [2022-02-20 20:00:37,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,132 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {460#true} {461#false} #1754#return; {461#false} is VALID [2022-02-20 20:00:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {460#true} is VALID [2022-02-20 20:00:37,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {460#true} is VALID [2022-02-20 20:00:37,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {461#false} #1756#return; {461#false} is VALID [2022-02-20 20:00:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} havoc ~__retres1~2; {460#true} is VALID [2022-02-20 20:00:37,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {460#true} is VALID [2022-02-20 20:00:37,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} #res := ~__retres1~2; {460#true} is VALID [2022-02-20 20:00:37,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,158 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {460#true} {461#false} #1758#return; {461#false} is VALID [2022-02-20 20:00:37,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {460#true} is VALID [2022-02-20 20:00:37,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {460#true} is VALID [2022-02-20 20:00:37,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#(= ~q_read_ev~0 2)} call update_channels1(); {500#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:37,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#(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); {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:37,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:37,165 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {501#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {462#(= ~q_read_ev~0 2)} #1750#return; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {462#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:37,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {462#(= ~q_read_ev~0 2)} call fire_delta_events1(); {502#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:37,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#(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; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {503#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {503#(= |old(~q_read_ev~0)| 0)} assume true; {503#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:37,170 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {503#(= |old(~q_read_ev~0)| 0)} {462#(= ~q_read_ev~0 2)} #1752#return; {461#false} is VALID [2022-02-20 20:00:37,170 INFO L272 TraceCheckUtils]: 17: Hoare triple {461#false} call activate_threads1(); {504#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:37,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {504#(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; {460#true} is VALID [2022-02-20 20:00:37,170 INFO L272 TraceCheckUtils]: 19: Hoare triple {460#true} call #t~ret8 := is_do_write_p_triggered(); {460#true} is VALID [2022-02-20 20:00:37,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#true} havoc ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#true} assume 1 == ~p_dw_pc~0; {460#true} is VALID [2022-02-20 20:00:37,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {460#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {460#true} is VALID [2022-02-20 20:00:37,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {460#true} #res := ~__retres1~0; {460#true} is VALID [2022-02-20 20:00:37,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,172 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {460#true} {460#true} #1746#return; {460#true} is VALID [2022-02-20 20:00:37,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {460#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {460#true} is VALID [2022-02-20 20:00:37,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {460#true} is VALID [2022-02-20 20:00:37,172 INFO L272 TraceCheckUtils]: 28: Hoare triple {460#true} call #t~ret9 := is_do_read_c_triggered(); {460#true} is VALID [2022-02-20 20:00:37,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {460#true} havoc ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {460#true} assume 1 == ~c_dr_pc~0; {460#true} is VALID [2022-02-20 20:00:37,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {460#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {460#true} is VALID [2022-02-20 20:00:37,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {460#true} #res := ~__retres1~1; {460#true} is VALID [2022-02-20 20:00:37,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,173 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {460#true} {460#true} #1748#return; {460#true} is VALID [2022-02-20 20:00:37,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {460#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {460#true} is VALID [2022-02-20 20:00:37,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {460#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {460#true} is VALID [2022-02-20 20:00:37,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,174 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {460#true} {461#false} #1754#return; {461#false} is VALID [2022-02-20 20:00:37,174 INFO L272 TraceCheckUtils]: 39: Hoare triple {461#false} call reset_delta_events1(); {502#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:37,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {502#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {460#true} is VALID [2022-02-20 20:00:37,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {460#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {460#true} is VALID [2022-02-20 20:00:37,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,175 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {460#true} {461#false} #1756#return; {461#false} is VALID [2022-02-20 20:00:37,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 20:00:37,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {461#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; {461#false} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 20:00:37,176 INFO L272 TraceCheckUtils]: 47: Hoare triple {461#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {460#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {460#true} havoc ~__retres1~2; {460#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {460#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {460#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {460#true} #res := ~__retres1~2; {460#true} is VALID [2022-02-20 20:00:37,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 20:00:37,178 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {460#true} {461#false} #1758#return; {461#false} is VALID [2022-02-20 20:00:37,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {461#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; {461#false} is VALID [2022-02-20 20:00:37,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {461#false} assume 0 != eval1_~tmp___1~0#1; {461#false} is VALID [2022-02-20 20:00:37,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {461#false} assume !(0 == ~p_dw_st~0); {461#false} is VALID [2022-02-20 20:00:37,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {461#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; {461#false} is VALID [2022-02-20 20:00:37,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {461#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; {461#false} is VALID [2022-02-20 20:00:37,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {461#false} assume !(0 == ~c_dr_pc~0); {461#false} is VALID [2022-02-20 20:00:37,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {461#false} assume 2 == ~c_dr_pc~0; {461#false} is VALID [2022-02-20 20:00:37,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {461#false} do_read_c_~a~0#1 := ~a_t~0; {461#false} is VALID [2022-02-20 20:00:37,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {461#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; {461#false} is VALID [2022-02-20 20:00:37,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {461#false} assume !(~p_last_write~0 == ~c_last_read~0); {461#false} is VALID [2022-02-20 20:00:37,184 INFO L272 TraceCheckUtils]: 63: Hoare triple {461#false} call error1(); {461#false} is VALID [2022-02-20 20:00:37,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 20:00:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:37,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:37,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79043692] [2022-02-20 20:00:37,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79043692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:37,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:37,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:37,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839637662] [2022-02-20 20:00:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:37,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:37,197 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 20:00:37,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:37,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:37,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:37,277 INFO L87 Difference]: Start difference. First operand has 457 states, 397 states have (on average 1.6347607052896724) internal successors, (649), 405 states have internal predecessors, (649), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,333 INFO L93 Difference]: Finished difference Result 1038 states and 1657 transitions. [2022-02-20 20:00:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:40,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1657 transitions. [2022-02-20 20:00:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1657 transitions. [2022-02-20 20:00:40,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1657 transitions. [2022-02-20 20:00:41,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1657 edges. 1657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,592 INFO L225 Difference]: With dead ends: 1038 [2022-02-20 20:00:41,592 INFO L226 Difference]: Without dead ends: 597 [2022-02-20 20:00:41,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:41,599 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 1154 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:41,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1161 Valid, 2011 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-02-20 20:00:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 558. [2022-02-20 20:00:41,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:41,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:41,652 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:41,653 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,685 INFO L93 Difference]: Finished difference Result 597 states and 897 transitions. [2022-02-20 20:00:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 897 transitions. [2022-02-20 20:00:41,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) Second operand 597 states. [2022-02-20 20:00:41,692 INFO L87 Difference]: Start difference. First operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) Second operand 597 states. [2022-02-20 20:00:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,713 INFO L93 Difference]: Finished difference Result 597 states and 897 transitions. [2022-02-20 20:00:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 897 transitions. [2022-02-20 20:00:41,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:41,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 479 states have (on average 1.524008350730689) internal successors, (730), 486 states have internal predecessors, (730), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 841 transitions. [2022-02-20 20:00:41,739 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 841 transitions. Word has length 65 [2022-02-20 20:00:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:41,739 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 841 transitions. [2022-02-20 20:00:41,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 841 transitions. [2022-02-20 20:00:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:41,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:41,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:41,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:41,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -330453561, now seen corresponding path program 1 times [2022-02-20 20:00:41,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:41,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152357622] [2022-02-20 20:00:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {3883#(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); {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3845#(= ~q_write_ev~0 ~q_read_ev~0)} #1750#return; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {3884#(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); {3885#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {3885#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3845#(= ~q_write_ev~0 ~q_read_ev~0)} #1752#return; {3844#false} is VALID [2022-02-20 20:00:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {3843#true} havoc ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume 1 == ~p_dw_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3843#true} is VALID [2022-02-20 20:00:41,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {3843#true} #res := ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,838 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3843#true} {3843#true} #1746#return; {3843#true} is VALID [2022-02-20 20:00:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {3843#true} havoc ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume 1 == ~c_dr_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {3843#true} #res := ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3843#true} {3843#true} #1748#return; {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {3887#(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; {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L272 TraceCheckUtils]: 1: Hoare triple {3843#true} call #t~ret8 := is_do_write_p_triggered(); {3843#true} is VALID [2022-02-20 20:00:41,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} havoc ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {3843#true} assume 1 == ~p_dw_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {3843#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} #res := ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3843#true} {3843#true} #1746#return; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {3843#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3843#true} is VALID [2022-02-20 20:00:41,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3843#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L272 TraceCheckUtils]: 10: Hoare triple {3843#true} call #t~ret9 := is_do_read_c_triggered(); {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3843#true} havoc ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {3843#true} assume 1 == ~c_dr_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {3843#true} #res := ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3843#true} {3843#true} #1748#return; {3843#true} is VALID [2022-02-20 20:00:41,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {3843#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3843#true} is VALID [2022-02-20 20:00:41,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {3843#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3843#true} is VALID [2022-02-20 20:00:41,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,854 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3843#true} {3844#false} #1754#return; {3844#false} is VALID [2022-02-20 20:00:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {3884#(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); {3843#true} is VALID [2022-02-20 20:00:41,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3843#true} is VALID [2022-02-20 20:00:41,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3844#false} #1756#return; {3844#false} is VALID [2022-02-20 20:00:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {3843#true} havoc ~__retres1~2; {3843#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3843#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} #res := ~__retres1~2; {3843#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,862 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3843#true} {3844#false} #1758#return; {3844#false} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {3843#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3843#true} is VALID [2022-02-20 20:00:41,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {3843#true} is VALID [2022-02-20 20:00:41,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3883#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:41,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#(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); {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,865 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3845#(= ~q_write_ev~0 ~q_read_ev~0)} #1750#return; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3845#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {3845#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {3884#(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); {3885#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {3885#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:41,868 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3886#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3845#(= ~q_write_ev~0 ~q_read_ev~0)} #1752#return; {3844#false} is VALID [2022-02-20 20:00:41,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {3844#false} call activate_threads1(); {3887#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:41,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(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; {3843#true} is VALID [2022-02-20 20:00:41,868 INFO L272 TraceCheckUtils]: 19: Hoare triple {3843#true} call #t~ret8 := is_do_write_p_triggered(); {3843#true} is VALID [2022-02-20 20:00:41,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {3843#true} havoc ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {3843#true} assume 1 == ~p_dw_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {3843#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {3843#true} #res := ~__retres1~0; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3843#true} {3843#true} #1746#return; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {3843#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {3843#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3843#true} is VALID [2022-02-20 20:00:41,869 INFO L272 TraceCheckUtils]: 28: Hoare triple {3843#true} call #t~ret9 := is_do_read_c_triggered(); {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {3843#true} havoc ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {3843#true} assume 1 == ~c_dr_pc~0; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {3843#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {3843#true} #res := ~__retres1~1; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3843#true} {3843#true} #1748#return; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {3843#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3843#true} is VALID [2022-02-20 20:00:41,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {3843#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3843#true} is VALID [2022-02-20 20:00:41,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,871 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3843#true} {3844#false} #1754#return; {3844#false} is VALID [2022-02-20 20:00:41,871 INFO L272 TraceCheckUtils]: 39: Hoare triple {3844#false} call reset_delta_events1(); {3884#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:41,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {3884#(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); {3843#true} is VALID [2022-02-20 20:00:41,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {3843#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3843#true} is VALID [2022-02-20 20:00:41,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,871 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3843#true} {3844#false} #1756#return; {3844#false} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {3844#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; {3844#false} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-02-20 20:00:41,872 INFO L272 TraceCheckUtils]: 47: Hoare triple {3844#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3843#true} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {3843#true} havoc ~__retres1~2; {3843#true} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {3843#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3843#true} is VALID [2022-02-20 20:00:41,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {3843#true} #res := ~__retres1~2; {3843#true} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-02-20 20:00:41,873 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3843#true} {3844#false} #1758#return; {3844#false} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {3844#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; {3844#false} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {3844#false} assume 0 != eval1_~tmp___1~0#1; {3844#false} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {3844#false} assume !(0 == ~p_dw_st~0); {3844#false} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {3844#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; {3844#false} is VALID [2022-02-20 20:00:41,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {3844#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; {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {3844#false} assume !(0 == ~c_dr_pc~0); {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {3844#false} assume 2 == ~c_dr_pc~0; {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {3844#false} do_read_c_~a~0#1 := ~a_t~0; {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {3844#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; {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {3844#false} assume !(~p_last_write~0 == ~c_last_read~0); {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L272 TraceCheckUtils]: 63: Hoare triple {3844#false} call error1(); {3844#false} is VALID [2022-02-20 20:00:41,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-02-20 20:00:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:41,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:41,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152357622] [2022-02-20 20:00:41,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152357622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:41,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:41,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:41,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071031209] [2022-02-20 20:00:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:41,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:41,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:41,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:41,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:41,918 INFO L87 Difference]: Start difference. First operand 558 states and 841 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,769 INFO L93 Difference]: Finished difference Result 955 states and 1407 transitions. [2022-02-20 20:00:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1083 transitions. [2022-02-20 20:00:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1083 transitions. [2022-02-20 20:00:45,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1083 transitions. [2022-02-20 20:00:46,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1083 edges. 1083 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:46,553 INFO L225 Difference]: With dead ends: 955 [2022-02-20 20:00:46,553 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 20:00:46,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:46,559 INFO L933 BasicCegarLoop]: 762 mSDtfsCounter, 1320 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:46,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1352 Valid, 2683 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:00:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 20:00:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 670. [2022-02-20 20:00:46,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:46,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:46,602 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:46,604 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,629 INFO L93 Difference]: Finished difference Result 746 states and 1115 transitions. [2022-02-20 20:00:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1115 transitions. [2022-02-20 20:00:46,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) Second operand 746 states. [2022-02-20 20:00:46,635 INFO L87 Difference]: Start difference. First operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) Second operand 746 states. [2022-02-20 20:00:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,661 INFO L93 Difference]: Finished difference Result 746 states and 1115 transitions. [2022-02-20 20:00:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1115 transitions. [2022-02-20 20:00:46,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:46,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 569 states have (on average 1.5043936731107206) internal successors, (856), 578 states have internal predecessors, (856), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1001 transitions. [2022-02-20 20:00:46,691 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1001 transitions. Word has length 65 [2022-02-20 20:00:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:46,693 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1001 transitions. [2022-02-20 20:00:46,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1001 transitions. [2022-02-20 20:00:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:46,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:46,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:46,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:46,695 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1935927625, now seen corresponding path program 1 times [2022-02-20 20:00:46,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:46,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427761603] [2022-02-20 20:00:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {7622#(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); {7623#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {7623#(not (= |old(~q_req_up~0)| 1))} assume true; {7623#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:46,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7623#(not (= |old(~q_req_up~0)| 1))} {7583#(= ~q_req_up~0 ~p_dw_pc~0)} #1750#return; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {7624#(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); {7580#true} is VALID [2022-02-20 20:00:46,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#true} assume !(0 == ~q_write_ev~0); {7580#true} is VALID [2022-02-20 20:00:46,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7580#true} {7587#(not (= ~p_dw_pc~0 1))} #1752#return; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#true} havoc ~__retres1~0; {7580#true} is VALID [2022-02-20 20:00:46,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#true} assume 1 == ~p_dw_pc~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,836 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} {7580#true} #1746#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#true} havoc ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#true} assume 1 == ~c_dr_pc~0; {7580#true} is VALID [2022-02-20 20:00:46,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7580#true} is VALID [2022-02-20 20:00:46,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {7580#true} #res := ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,844 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7580#true} {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #1748#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {7625#(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; {7580#true} is VALID [2022-02-20 20:00:46,844 INFO L272 TraceCheckUtils]: 1: Hoare triple {7580#true} call #t~ret8 := is_do_write_p_triggered(); {7580#true} is VALID [2022-02-20 20:00:46,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#true} havoc ~__retres1~0; {7580#true} is VALID [2022-02-20 20:00:46,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {7580#true} assume 1 == ~p_dw_pc~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,847 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} {7580#true} #1746#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,848 INFO L272 TraceCheckUtils]: 10: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7580#true} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {7580#true} havoc ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {7580#true} assume 1 == ~c_dr_pc~0; {7580#true} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {7580#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7580#true} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {7580#true} #res := ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,849 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7580#true} {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #1748#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,850 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} {7587#(not (= ~p_dw_pc~0 1))} #1754#return; {7581#false} is VALID [2022-02-20 20:00:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {7624#(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); {7580#true} is VALID [2022-02-20 20:00:46,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7580#true} is VALID [2022-02-20 20:00:46,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7580#true} {7581#false} #1756#return; {7581#false} is VALID [2022-02-20 20:00:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#true} havoc ~__retres1~2; {7580#true} is VALID [2022-02-20 20:00:46,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7580#true} is VALID [2022-02-20 20:00:46,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#true} #res := ~__retres1~2; {7580#true} is VALID [2022-02-20 20:00:46,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7580#true} {7581#false} #1758#return; {7581#false} is VALID [2022-02-20 20:00:46,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {7582#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:46,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {7582#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {7582#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {7583#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:46,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {7583#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {7583#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:46,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {7583#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {7622#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:46,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {7622#(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); {7623#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:46,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {7623#(not (= |old(~q_req_up~0)| 1))} assume true; {7623#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:46,876 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7623#(not (= |old(~q_req_up~0)| 1))} {7583#(= ~q_req_up~0 ~p_dw_pc~0)} #1750#return; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,878 INFO L272 TraceCheckUtils]: 12: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {7624#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {7624#(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); {7580#true} is VALID [2022-02-20 20:00:46,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {7580#true} assume !(0 == ~q_write_ev~0); {7580#true} is VALID [2022-02-20 20:00:46,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,879 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7580#true} {7587#(not (= ~p_dw_pc~0 1))} #1752#return; {7587#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:46,879 INFO L272 TraceCheckUtils]: 17: Hoare triple {7587#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {7625#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {7625#(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; {7580#true} is VALID [2022-02-20 20:00:46,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {7580#true} call #t~ret8 := is_do_write_p_triggered(); {7580#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {7580#true} havoc ~__retres1~0; {7580#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {7580#true} assume 1 == ~p_dw_pc~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,882 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} {7580#true} #1746#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7580#true} is VALID [2022-02-20 20:00:46,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {7580#true} havoc ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#true} assume 1 == ~c_dr_pc~0; {7580#true} is VALID [2022-02-20 20:00:46,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7580#true} is VALID [2022-02-20 20:00:46,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#true} #res := ~__retres1~1; {7580#true} is VALID [2022-02-20 20:00:46,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,886 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7580#true} {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} #1748#return; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:46,887 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7632#(= (+ (- 1) ~p_dw_pc~0) 0)} {7587#(not (= ~p_dw_pc~0 1))} #1754#return; {7581#false} is VALID [2022-02-20 20:00:46,887 INFO L272 TraceCheckUtils]: 39: Hoare triple {7581#false} call reset_delta_events1(); {7624#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {7624#(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); {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {7580#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7580#true} {7581#false} #1756#return; {7581#false} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {7581#false} assume !false; {7581#false} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {7581#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; {7581#false} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {7581#false} assume !false; {7581#false} is VALID [2022-02-20 20:00:46,888 INFO L272 TraceCheckUtils]: 47: Hoare triple {7581#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {7580#true} havoc ~__retres1~2; {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {7580#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7580#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {7580#true} #res := ~__retres1~2; {7580#true} is VALID [2022-02-20 20:00:46,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {7580#true} assume true; {7580#true} is VALID [2022-02-20 20:00:46,889 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7580#true} {7581#false} #1758#return; {7581#false} is VALID [2022-02-20 20:00:46,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {7581#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; {7581#false} is VALID [2022-02-20 20:00:46,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {7581#false} assume 0 != eval1_~tmp___1~0#1; {7581#false} is VALID [2022-02-20 20:00:46,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {7581#false} assume !(0 == ~p_dw_st~0); {7581#false} is VALID [2022-02-20 20:00:46,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {7581#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; {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {7581#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; {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {7581#false} assume !(0 == ~c_dr_pc~0); {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {7581#false} assume 2 == ~c_dr_pc~0; {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {7581#false} do_read_c_~a~0#1 := ~a_t~0; {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {7581#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; {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {7581#false} assume !(~p_last_write~0 == ~c_last_read~0); {7581#false} is VALID [2022-02-20 20:00:46,890 INFO L272 TraceCheckUtils]: 63: Hoare triple {7581#false} call error1(); {7581#false} is VALID [2022-02-20 20:00:46,891 INFO L290 TraceCheckUtils]: 64: Hoare triple {7581#false} assume !false; {7581#false} is VALID [2022-02-20 20:00:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:46,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:46,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427761603] [2022-02-20 20:00:46,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427761603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:46,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:46,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:46,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330732041] [2022-02-20 20:00:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:46,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:46,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:46,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:46,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:46,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:46,933 INFO L87 Difference]: Start difference. First operand 670 states and 1001 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:53,126 INFO L93 Difference]: Finished difference Result 2216 states and 3199 transitions. [2022-02-20 20:00:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:53,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1488 transitions. [2022-02-20 20:00:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1488 transitions. [2022-02-20 20:00:53,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1488 transitions. [2022-02-20 20:00:54,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1488 edges. 1488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:54,363 INFO L225 Difference]: With dead ends: 2216 [2022-02-20 20:00:54,364 INFO L226 Difference]: Without dead ends: 1883 [2022-02-20 20:00:54,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:54,366 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 3547 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3565 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:54,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3565 Valid, 3026 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 20:00:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-02-20 20:00:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1723. [2022-02-20 20:00:54,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:54,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1883 states. Second operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:54,422 INFO L74 IsIncluded]: Start isIncluded. First operand 1883 states. Second operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:54,424 INFO L87 Difference]: Start difference. First operand 1883 states. Second operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,531 INFO L93 Difference]: Finished difference Result 1883 states and 2600 transitions. [2022-02-20 20:00:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2600 transitions. [2022-02-20 20:00:54,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:54,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) Second operand 1883 states. [2022-02-20 20:00:54,542 INFO L87 Difference]: Start difference. First operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) Second operand 1883 states. [2022-02-20 20:00:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,659 INFO L93 Difference]: Finished difference Result 1883 states and 2600 transitions. [2022-02-20 20:00:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2600 transitions. [2022-02-20 20:00:54,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:54,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:54,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:54,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1417 states have (on average 1.4114326040931546) internal successors, (2000), 1441 states have internal predecessors, (2000), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2388 transitions. [2022-02-20 20:00:54,787 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2388 transitions. Word has length 65 [2022-02-20 20:00:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:54,788 INFO L470 AbstractCegarLoop]: Abstraction has 1723 states and 2388 transitions. [2022-02-20 20:00:54,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2388 transitions. [2022-02-20 20:00:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:54,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:54,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:54,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:54,790 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1448069129, now seen corresponding path program 1 times [2022-02-20 20:00:54,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:54,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660015336] [2022-02-20 20:00:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {16800#(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); {16760#true} is VALID [2022-02-20 20:00:54,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16760#true} {16760#true} #1750#return; {16760#true} is VALID [2022-02-20 20:00:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {16801#(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); {16760#true} is VALID [2022-02-20 20:00:54,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume !(0 == ~q_write_ev~0); {16760#true} is VALID [2022-02-20 20:00:54,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16760#true} {16760#true} #1752#return; {16760#true} is VALID [2022-02-20 20:00:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {16760#true} havoc ~__retres1~0; {16760#true} is VALID [2022-02-20 20:00:54,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume !(1 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} assume !(2 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {16760#true} ~__retres1~0 := 0; {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:54,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,918 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16760#true} #1746#return; {16810#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {16760#true} havoc ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume 1 == ~c_dr_pc~0; {16760#true} is VALID [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16760#true} is VALID [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {16760#true} #res := ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,921 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16760#true} {16761#false} #1748#return; {16761#false} is VALID [2022-02-20 20:00:54,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {16802#(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; {16760#true} is VALID [2022-02-20 20:00:54,922 INFO L272 TraceCheckUtils]: 1: Hoare triple {16760#true} call #t~ret8 := is_do_write_p_triggered(); {16760#true} is VALID [2022-02-20 20:00:54,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} havoc ~__retres1~0; {16760#true} is VALID [2022-02-20 20:00:54,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {16760#true} assume !(1 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {16760#true} assume !(2 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {16760#true} ~__retres1~0 := 0; {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:54,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,923 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16760#true} #1746#return; {16810#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:54,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {16810#(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; {16811#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:54,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {16811#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16761#false} is VALID [2022-02-20 20:00:54,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {16761#false} call #t~ret9 := is_do_read_c_triggered(); {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {16760#true} havoc ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {16760#true} assume 1 == ~c_dr_pc~0; {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {16760#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {16760#true} #res := ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,925 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16760#true} {16761#false} #1748#return; {16761#false} is VALID [2022-02-20 20:00:54,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {16761#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16761#false} is VALID [2022-02-20 20:00:54,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {16761#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16761#false} is VALID [2022-02-20 20:00:54,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {16761#false} assume true; {16761#false} is VALID [2022-02-20 20:00:54,926 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16761#false} {16760#true} #1754#return; {16761#false} is VALID [2022-02-20 20:00:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {16801#(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); {16760#true} is VALID [2022-02-20 20:00:54,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16760#true} is VALID [2022-02-20 20:00:54,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16760#true} {16761#false} #1756#return; {16761#false} is VALID [2022-02-20 20:00:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {16760#true} havoc ~__retres1~2; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} #res := ~__retres1~2; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16760#true} {16761#false} #1758#return; {16761#false} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {16760#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {16760#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {16760#true} is VALID [2022-02-20 20:00:54,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {16760#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {16760#true} call update_channels1(); {16800#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {16800#(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); {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16760#true} {16760#true} #1750#return; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {16760#true} assume { :begin_inline_init_threads1 } true; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {16760#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {16760#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {16760#true} assume { :end_inline_init_threads1 } true; {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {16760#true} call fire_delta_events1(); {16801#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {16801#(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); {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {16760#true} assume !(0 == ~q_write_ev~0); {16760#true} is VALID [2022-02-20 20:00:54,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16760#true} {16760#true} #1752#return; {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {16760#true} call activate_threads1(); {16802#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:54,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {16802#(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; {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L272 TraceCheckUtils]: 19: Hoare triple {16760#true} call #t~ret8 := is_do_write_p_triggered(); {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {16760#true} havoc ~__retres1~0; {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {16760#true} assume !(1 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {16760#true} assume !(2 == ~p_dw_pc~0); {16760#true} is VALID [2022-02-20 20:00:54,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {16760#true} ~__retres1~0 := 0; {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:54,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {16818#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:54,947 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16819#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16760#true} #1746#return; {16810#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:54,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {16810#(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; {16811#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:54,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {16811#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16761#false} is VALID [2022-02-20 20:00:54,948 INFO L272 TraceCheckUtils]: 29: Hoare triple {16761#false} call #t~ret9 := is_do_read_c_triggered(); {16760#true} is VALID [2022-02-20 20:00:54,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {16760#true} havoc ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {16760#true} assume 1 == ~c_dr_pc~0; {16760#true} is VALID [2022-02-20 20:00:54,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {16760#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {16760#true} #res := ~__retres1~1; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16760#true} {16761#false} #1748#return; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {16761#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {16761#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {16761#false} assume true; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16761#false} {16760#true} #1754#return; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L272 TraceCheckUtils]: 40: Hoare triple {16761#false} call reset_delta_events1(); {16801#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {16801#(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); {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {16760#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16760#true} {16761#false} #1756#return; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {16761#false} assume !false; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {16761#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; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {16761#false} assume !false; {16761#false} is VALID [2022-02-20 20:00:54,949 INFO L272 TraceCheckUtils]: 48: Hoare triple {16761#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {16760#true} havoc ~__retres1~2; {16760#true} is VALID [2022-02-20 20:00:54,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {16760#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16760#true} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {16760#true} #res := ~__retres1~2; {16760#true} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {16760#true} assume true; {16760#true} is VALID [2022-02-20 20:00:54,950 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16760#true} {16761#false} #1758#return; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {16761#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; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {16761#false} assume 0 != eval1_~tmp___1~0#1; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {16761#false} assume !(0 == ~p_dw_st~0); {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {16761#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; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {16761#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; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {16761#false} assume !(0 == ~c_dr_pc~0); {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {16761#false} assume 2 == ~c_dr_pc~0; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {16761#false} do_read_c_~a~0#1 := ~a_t~0; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {16761#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; {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {16761#false} assume !(~p_last_write~0 == ~c_last_read~0); {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L272 TraceCheckUtils]: 64: Hoare triple {16761#false} call error1(); {16761#false} is VALID [2022-02-20 20:00:54,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {16761#false} assume !false; {16761#false} is VALID [2022-02-20 20:00:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:54,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:54,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660015336] [2022-02-20 20:00:54,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660015336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:54,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:54,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:54,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763649876] [2022-02-20 20:00:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:54,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:54,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:54,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:54,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:54,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:54,989 INFO L87 Difference]: Start difference. First operand 1723 states and 2388 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,817 INFO L93 Difference]: Finished difference Result 3251 states and 4467 transitions. [2022-02-20 20:00:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 864 transitions. [2022-02-20 20:00:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 864 transitions. [2022-02-20 20:00:58,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 864 transitions. [2022-02-20 20:00:59,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 864 edges. 864 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:59,541 INFO L225 Difference]: With dead ends: 3251 [2022-02-20 20:00:59,541 INFO L226 Difference]: Without dead ends: 1871 [2022-02-20 20:00:59,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:00:59,549 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 588 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:59,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 3012 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-02-20 20:00:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1763. [2022-02-20 20:00:59,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:59,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1871 states. Second operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:00:59,649 INFO L74 IsIncluded]: Start isIncluded. First operand 1871 states. Second operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:00:59,653 INFO L87 Difference]: Start difference. First operand 1871 states. Second operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:00:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:59,759 INFO L93 Difference]: Finished difference Result 1871 states and 2576 transitions. [2022-02-20 20:00:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2576 transitions. [2022-02-20 20:00:59,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:59,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:59,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) Second operand 1871 states. [2022-02-20 20:00:59,767 INFO L87 Difference]: Start difference. First operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) Second operand 1871 states. [2022-02-20 20:00:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:59,870 INFO L93 Difference]: Finished difference Result 1871 states and 2576 transitions. [2022-02-20 20:00:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2576 transitions. [2022-02-20 20:00:59,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:59,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:59,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:59,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1449 states have (on average 1.3982056590752243) internal successors, (2026), 1473 states have internal predecessors, (2026), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:01:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2422 transitions. [2022-02-20 20:01:00,002 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2422 transitions. Word has length 66 [2022-02-20 20:01:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:00,003 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2422 transitions. [2022-02-20 20:01:00,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2422 transitions. [2022-02-20 20:01:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:00,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:00,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:00,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:00,004 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 418709831, now seen corresponding path program 1 times [2022-02-20 20:01:00,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:00,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585654850] [2022-02-20 20:01:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {27334#(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); {27335#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:00,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {27335#(not (= |old(~q_req_up~0)| 1))} assume true; {27335#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:00,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27335#(not (= |old(~q_req_up~0)| 1))} {27294#(= ~c_dr_pc~0 ~q_req_up~0)} #1750#return; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {27336#(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); {27291#true} is VALID [2022-02-20 20:01:00,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {27291#true} assume !(0 == ~q_write_ev~0); {27291#true} is VALID [2022-02-20 20:01:00,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27291#true} {27298#(not (= ~c_dr_pc~0 1))} #1752#return; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {27291#true} havoc ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {27291#true} assume !(1 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {27291#true} assume !(2 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {27291#true} ~__retres1~0 := 0; {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {27291#true} #res := ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27291#true} {27291#true} #1746#return; {27291#true} is VALID [2022-02-20 20:01:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {27291#true} havoc ~__retres1~1; {27291#true} is VALID [2022-02-20 20:01:00,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {27291#true} assume 1 == ~c_dr_pc~0; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,103 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} {27291#true} #1748#return; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {27337#(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; {27291#true} is VALID [2022-02-20 20:01:00,103 INFO L272 TraceCheckUtils]: 1: Hoare triple {27291#true} call #t~ret8 := is_do_write_p_triggered(); {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {27291#true} havoc ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {27291#true} assume !(1 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {27291#true} assume !(2 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {27291#true} ~__retres1~0 := 0; {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {27291#true} #res := ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27291#true} {27291#true} #1746#return; {27291#true} is VALID [2022-02-20 20:01:00,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {27291#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27291#true} is VALID [2022-02-20 20:01:00,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {27291#true} assume !(0 != ~tmp~1); {27291#true} is VALID [2022-02-20 20:01:00,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {27291#true} call #t~ret9 := is_do_read_c_triggered(); {27291#true} is VALID [2022-02-20 20:01:00,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {27291#true} havoc ~__retres1~1; {27291#true} is VALID [2022-02-20 20:01:00,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {27291#true} assume 1 == ~c_dr_pc~0; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,106 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} {27291#true} #1748#return; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,107 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} {27298#(not (= ~c_dr_pc~0 1))} #1754#return; {27292#false} is VALID [2022-02-20 20:01:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {27336#(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); {27291#true} is VALID [2022-02-20 20:01:00,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {27291#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27291#true} is VALID [2022-02-20 20:01:00,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27291#true} {27292#false} #1756#return; {27292#false} is VALID [2022-02-20 20:01:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {27291#true} havoc ~__retres1~2; {27291#true} is VALID [2022-02-20 20:01:00,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {27291#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27291#true} is VALID [2022-02-20 20:01:00,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {27291#true} #res := ~__retres1~2; {27291#true} is VALID [2022-02-20 20:01:00,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,124 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27291#true} {27292#false} #1758#return; {27292#false} is VALID [2022-02-20 20:01:00,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {27291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {27293#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:00,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {27293#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {27293#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:00,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {27293#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {27294#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:00,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {27294#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {27294#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:00,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {27294#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {27334#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:00,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {27334#(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); {27335#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:00,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {27335#(not (= |old(~q_req_up~0)| 1))} assume true; {27335#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:00,129 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27335#(not (= |old(~q_req_up~0)| 1))} {27294#(= ~c_dr_pc~0 ~q_req_up~0)} #1750#return; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,131 INFO L272 TraceCheckUtils]: 12: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {27336#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:00,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {27336#(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); {27291#true} is VALID [2022-02-20 20:01:00,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {27291#true} assume !(0 == ~q_write_ev~0); {27291#true} is VALID [2022-02-20 20:01:00,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,131 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27291#true} {27298#(not (= ~c_dr_pc~0 1))} #1752#return; {27298#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:00,132 INFO L272 TraceCheckUtils]: 17: Hoare triple {27298#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {27337#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {27337#(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; {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L272 TraceCheckUtils]: 19: Hoare triple {27291#true} call #t~ret8 := is_do_write_p_triggered(); {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {27291#true} havoc ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {27291#true} assume !(1 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {27291#true} assume !(2 == ~p_dw_pc~0); {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {27291#true} ~__retres1~0 := 0; {27291#true} is VALID [2022-02-20 20:01:00,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {27291#true} #res := ~__retres1~0; {27291#true} is VALID [2022-02-20 20:01:00,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,133 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27291#true} {27291#true} #1746#return; {27291#true} is VALID [2022-02-20 20:01:00,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {27291#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27291#true} is VALID [2022-02-20 20:01:00,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {27291#true} assume !(0 != ~tmp~1); {27291#true} is VALID [2022-02-20 20:01:00,134 INFO L272 TraceCheckUtils]: 29: Hoare triple {27291#true} call #t~ret9 := is_do_read_c_triggered(); {27291#true} is VALID [2022-02-20 20:01:00,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {27291#true} havoc ~__retres1~1; {27291#true} is VALID [2022-02-20 20:01:00,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {27291#true} assume 1 == ~c_dr_pc~0; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,135 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} {27291#true} #1748#return; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:00,136 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27351#(= (+ (- 1) ~c_dr_pc~0) 0)} {27298#(not (= ~c_dr_pc~0 1))} #1754#return; {27292#false} is VALID [2022-02-20 20:01:00,136 INFO L272 TraceCheckUtils]: 40: Hoare triple {27292#false} call reset_delta_events1(); {27336#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:00,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {27336#(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); {27291#true} is VALID [2022-02-20 20:01:00,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {27291#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27291#true} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,137 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27291#true} {27292#false} #1756#return; {27292#false} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {27292#false} assume !false; {27292#false} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {27292#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; {27292#false} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {27292#false} assume !false; {27292#false} is VALID [2022-02-20 20:01:00,137 INFO L272 TraceCheckUtils]: 48: Hoare triple {27292#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27291#true} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {27291#true} havoc ~__retres1~2; {27291#true} is VALID [2022-02-20 20:01:00,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {27291#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27291#true} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {27291#true} #res := ~__retres1~2; {27291#true} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {27291#true} assume true; {27291#true} is VALID [2022-02-20 20:01:00,138 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27291#true} {27292#false} #1758#return; {27292#false} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {27292#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; {27292#false} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {27292#false} assume 0 != eval1_~tmp___1~0#1; {27292#false} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {27292#false} assume !(0 == ~p_dw_st~0); {27292#false} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {27292#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; {27292#false} is VALID [2022-02-20 20:01:00,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {27292#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; {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {27292#false} assume !(0 == ~c_dr_pc~0); {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {27292#false} assume 2 == ~c_dr_pc~0; {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {27292#false} do_read_c_~a~0#1 := ~a_t~0; {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {27292#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; {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {27292#false} assume !(~p_last_write~0 == ~c_last_read~0); {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L272 TraceCheckUtils]: 64: Hoare triple {27292#false} call error1(); {27292#false} is VALID [2022-02-20 20:01:00,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {27292#false} assume !false; {27292#false} is VALID [2022-02-20 20:01:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:00,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:00,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585654850] [2022-02-20 20:01:00,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585654850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:00,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:00,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:00,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498474338] [2022-02-20 20:01:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:00,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:00,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:00,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:00,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:00,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:00,181 INFO L87 Difference]: Start difference. First operand 1763 states and 2422 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:07,101 INFO L93 Difference]: Finished difference Result 5335 states and 7296 transitions. [2022-02-20 20:01:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:07,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1477 transitions. [2022-02-20 20:01:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1477 transitions. [2022-02-20 20:01:07,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1477 transitions. [2022-02-20 20:01:08,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1477 edges. 1477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:08,335 INFO L225 Difference]: With dead ends: 5335 [2022-02-20 20:01:08,335 INFO L226 Difference]: Without dead ends: 2154 [2022-02-20 20:01:08,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:08,340 INFO L933 BasicCegarLoop]: 809 mSDtfsCounter, 4083 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:08,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4101 Valid, 2651 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:01:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-02-20 20:01:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1974. [2022-02-20 20:01:08,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:08,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2154 states. Second operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:08,422 INFO L74 IsIncluded]: Start isIncluded. First operand 2154 states. Second operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:08,424 INFO L87 Difference]: Start difference. First operand 2154 states. Second operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,559 INFO L93 Difference]: Finished difference Result 2154 states and 2865 transitions. [2022-02-20 20:01:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2865 transitions. [2022-02-20 20:01:08,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:08,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:08,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) Second operand 2154 states. [2022-02-20 20:01:08,567 INFO L87 Difference]: Start difference. First operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) Second operand 2154 states. [2022-02-20 20:01:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,700 INFO L93 Difference]: Finished difference Result 2154 states and 2865 transitions. [2022-02-20 20:01:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2865 transitions. [2022-02-20 20:01:08,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:08,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:08,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:08,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1588 states have (on average 1.3551637279596978) internal successors, (2152), 1614 states have internal predecessors, (2152), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2634 transitions. [2022-02-20 20:01:08,867 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2634 transitions. Word has length 66 [2022-02-20 20:01:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:08,867 INFO L470 AbstractCegarLoop]: Abstraction has 1974 states and 2634 transitions. [2022-02-20 20:01:08,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2634 transitions. [2022-02-20 20:01:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:08,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:08,869 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:08,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:08,869 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -440043302, now seen corresponding path program 1 times [2022-02-20 20:01:08,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:08,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143576939] [2022-02-20 20:01:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {41593#(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); {41547#true} is VALID [2022-02-20 20:01:08,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:08,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41547#true} {41547#true} #1750#return; {41547#true} is VALID [2022-02-20 20:01:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {41594#(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); {41547#true} is VALID [2022-02-20 20:01:08,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume !(0 == ~q_write_ev~0); {41547#true} is VALID [2022-02-20 20:01:08,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:08,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41547#true} {41547#true} #1752#return; {41547#true} is VALID [2022-02-20 20:01:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {41547#true} havoc ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:08,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume !(1 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} assume !(2 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} ~__retres1~0 := 0; {41547#true} is VALID [2022-02-20 20:01:08,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {41547#true} #res := ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:08,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:08,954 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41547#true} {41547#true} #1746#return; {41547#true} is VALID [2022-02-20 20:01:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {41547#true} havoc ~__retres1~1; {41547#true} is VALID [2022-02-20 20:01:08,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume !(1 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} assume !(2 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} ~__retres1~1 := 0; {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:08,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:08,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:08,990 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41547#true} #1748#return; {41610#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:08,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {41595#(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; {41547#true} is VALID [2022-02-20 20:01:08,990 INFO L272 TraceCheckUtils]: 1: Hoare triple {41547#true} call #t~ret8 := is_do_write_p_triggered(); {41547#true} is VALID [2022-02-20 20:01:08,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} havoc ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} assume !(1 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {41547#true} assume !(2 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {41547#true} ~__retres1~0 := 0; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {41547#true} #res := ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {41547#true} {41547#true} #1746#return; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {41547#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {41547#true} assume !(0 != ~tmp~1); {41547#true} is VALID [2022-02-20 20:01:08,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {41547#true} call #t~ret9 := is_do_read_c_triggered(); {41547#true} is VALID [2022-02-20 20:01:08,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {41547#true} havoc ~__retres1~1; {41547#true} is VALID [2022-02-20 20:01:08,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {41547#true} assume !(1 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {41547#true} assume !(2 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:08,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {41547#true} ~__retres1~1 := 0; {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:08,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:08,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:08,993 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41547#true} #1748#return; {41610#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:08,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {41610#(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; {41611#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:08,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {41611#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41548#false} is VALID [2022-02-20 20:01:08,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {41548#false} assume true; {41548#false} is VALID [2022-02-20 20:01:08,994 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41548#false} {41547#true} #1754#return; {41548#false} is VALID [2022-02-20 20:01:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:08,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {41594#(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); {41547#true} is VALID [2022-02-20 20:01:08,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41547#true} is VALID [2022-02-20 20:01:08,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:08,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41547#true} {41548#false} #1756#return; {41548#false} is VALID [2022-02-20 20:01:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {41547#true} havoc ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41547#true} is VALID [2022-02-20 20:01:09,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} #res := ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,003 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41547#true} {41548#false} #1758#return; {41548#false} is VALID [2022-02-20 20:01:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {41547#true} havoc ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41547#true} is VALID [2022-02-20 20:01:09,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} #res := ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,006 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41547#true} {41548#false} #1758#return; {41548#false} is VALID [2022-02-20 20:01:09,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {41547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {41547#true} is VALID [2022-02-20 20:01:09,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {41547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {41547#true} is VALID [2022-02-20 20:01:09,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {41547#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {41547#true} is VALID [2022-02-20 20:01:09,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {41547#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {41547#true} is VALID [2022-02-20 20:01:09,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {41547#true} call update_channels1(); {41593#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:09,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {41593#(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); {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {41547#true} {41547#true} #1750#return; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {41547#true} assume { :begin_inline_init_threads1 } true; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {41547#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {41547#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {41547#true} assume { :end_inline_init_threads1 } true; {41547#true} is VALID [2022-02-20 20:01:09,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {41547#true} call fire_delta_events1(); {41594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {41594#(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); {41547#true} is VALID [2022-02-20 20:01:09,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {41547#true} assume !(0 == ~q_write_ev~0); {41547#true} is VALID [2022-02-20 20:01:09,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,009 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41547#true} {41547#true} #1752#return; {41547#true} is VALID [2022-02-20 20:01:09,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {41547#true} call activate_threads1(); {41595#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:09,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {41595#(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; {41547#true} is VALID [2022-02-20 20:01:09,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {41547#true} call #t~ret8 := is_do_write_p_triggered(); {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {41547#true} havoc ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {41547#true} assume !(1 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {41547#true} assume !(2 == ~p_dw_pc~0); {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {41547#true} ~__retres1~0 := 0; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {41547#true} #res := ~__retres1~0; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41547#true} {41547#true} #1746#return; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {41547#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41547#true} is VALID [2022-02-20 20:01:09,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {41547#true} assume !(0 != ~tmp~1); {41547#true} is VALID [2022-02-20 20:01:09,011 INFO L272 TraceCheckUtils]: 29: Hoare triple {41547#true} call #t~ret9 := is_do_read_c_triggered(); {41547#true} is VALID [2022-02-20 20:01:09,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {41547#true} havoc ~__retres1~1; {41547#true} is VALID [2022-02-20 20:01:09,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {41547#true} assume !(1 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:09,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {41547#true} assume !(2 == ~c_dr_pc~0); {41547#true} is VALID [2022-02-20 20:01:09,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {41547#true} ~__retres1~1 := 0; {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:09,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {41612#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:09,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:09,012 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41613#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41547#true} #1748#return; {41610#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:09,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {41610#(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; {41611#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:09,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {41611#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41548#false} is VALID [2022-02-20 20:01:09,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {41548#false} assume true; {41548#false} is VALID [2022-02-20 20:01:09,013 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41548#false} {41547#true} #1754#return; {41548#false} is VALID [2022-02-20 20:01:09,013 INFO L272 TraceCheckUtils]: 41: Hoare triple {41548#false} call reset_delta_events1(); {41594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {41594#(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); {41547#true} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {41547#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41547#true} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,014 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {41547#true} {41548#false} #1756#return; {41548#false} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,014 INFO L272 TraceCheckUtils]: 49: Hoare triple {41548#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41547#true} is VALID [2022-02-20 20:01:09,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {41547#true} havoc ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {41547#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41547#true} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {41547#true} #res := ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,015 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {41547#true} {41548#false} #1758#return; {41548#false} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {41548#false} assume 0 != eval1_~tmp___1~0#1; {41548#false} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {41548#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {41548#false} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {41548#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {41548#false} is VALID [2022-02-20 20:01:09,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {41548#false} assume 0 == ~p_dw_pc~0; {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {41548#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {41548#false} assume { :end_inline_do_write_p } true; {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {41548#false} assume !(0 == ~c_dr_st~0); {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,016 INFO L272 TraceCheckUtils]: 65: Hoare triple {41548#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41547#true} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {41547#true} havoc ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {41547#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41547#true} is VALID [2022-02-20 20:01:09,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {41547#true} #res := ~__retres1~2; {41547#true} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {41547#true} assume true; {41547#true} is VALID [2022-02-20 20:01:09,017 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {41547#true} {41548#false} #1758#return; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {41548#false} assume 0 != eval1_~tmp___1~0#1; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {41548#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 74: Hoare triple {41548#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {41548#false} assume !(0 == ~p_dw_pc~0); {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 76: Hoare triple {41548#false} assume 1 == ~p_dw_pc~0; {41548#false} is VALID [2022-02-20 20:01:09,017 INFO L290 TraceCheckUtils]: 77: Hoare triple {41548#false} assume !(0 == ~q_free~0); {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {41548#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {41548#false} assume { :end_inline_do_write_p } true; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {41548#false} assume !(0 == ~c_dr_pc~0); {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 85: Hoare triple {41548#false} assume 2 == ~c_dr_pc~0; {41548#false} is VALID [2022-02-20 20:01:09,018 INFO L290 TraceCheckUtils]: 86: Hoare triple {41548#false} do_read_c_~a~0#1 := ~a_t~0; {41548#false} is VALID [2022-02-20 20:01:09,019 INFO L290 TraceCheckUtils]: 87: Hoare triple {41548#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; {41548#false} is VALID [2022-02-20 20:01:09,019 INFO L290 TraceCheckUtils]: 88: Hoare triple {41548#false} assume !(~p_last_write~0 == ~c_last_read~0); {41548#false} is VALID [2022-02-20 20:01:09,019 INFO L272 TraceCheckUtils]: 89: Hoare triple {41548#false} call error1(); {41548#false} is VALID [2022-02-20 20:01:09,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {41548#false} assume !false; {41548#false} is VALID [2022-02-20 20:01:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:09,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:09,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143576939] [2022-02-20 20:01:09,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143576939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:09,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:09,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:09,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049660133] [2022-02-20 20:01:09,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:09,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:09,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:09,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:09,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:09,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:09,064 INFO L87 Difference]: Start difference. First operand 1974 states and 2634 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:12,849 INFO L93 Difference]: Finished difference Result 3799 states and 5036 transitions. [2022-02-20 20:01:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 849 transitions. [2022-02-20 20:01:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 849 transitions. [2022-02-20 20:01:12,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 849 transitions. [2022-02-20 20:01:13,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 849 edges. 849 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:13,568 INFO L225 Difference]: With dead ends: 3799 [2022-02-20 20:01:13,568 INFO L226 Difference]: Without dead ends: 2168 [2022-02-20 20:01:13,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:13,571 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 869 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:13,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [871 Valid, 2654 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2022-02-20 20:01:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2034. [2022-02-20 20:01:13,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:13,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2168 states. Second operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:13,678 INFO L74 IsIncluded]: Start isIncluded. First operand 2168 states. Second operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:13,680 INFO L87 Difference]: Start difference. First operand 2168 states. Second operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:13,811 INFO L93 Difference]: Finished difference Result 2168 states and 2877 transitions. [2022-02-20 20:01:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2877 transitions. [2022-02-20 20:01:13,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:13,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:13,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) Second operand 2168 states. [2022-02-20 20:01:13,819 INFO L87 Difference]: Start difference. First operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) Second operand 2168 states. [2022-02-20 20:01:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:13,952 INFO L93 Difference]: Finished difference Result 2168 states and 2877 transitions. [2022-02-20 20:01:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2877 transitions. [2022-02-20 20:01:13,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:13,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:13,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:13,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1636 states have (on average 1.341075794621027) internal successors, (2194), 1662 states have internal predecessors, (2194), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2688 transitions. [2022-02-20 20:01:14,127 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2688 transitions. Word has length 91 [2022-02-20 20:01:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:14,127 INFO L470 AbstractCegarLoop]: Abstraction has 2034 states and 2688 transitions. [2022-02-20 20:01:14,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2688 transitions. [2022-02-20 20:01:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:14,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:14,129 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:14,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:14,130 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash 3857372, now seen corresponding path program 1 times [2022-02-20 20:01:14,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:14,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243190343] [2022-02-20 20:01:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {53818#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1750#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {53819#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {53819#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1752#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {53771#true} havoc ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {53771#true} assume !(1 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} assume !(2 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {53771#true} ~__retres1~0 := 0; {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {53771#true} #res := ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53771#true} {53771#true} #1746#return; {53771#true} is VALID [2022-02-20 20:01:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {53771#true} havoc ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {53771#true} assume !(1 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} assume !(2 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {53771#true} ~__retres1~1 := 0; {53771#true} is VALID [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {53771#true} #res := ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53771#true} {53771#true} #1748#return; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {53820#(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; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L272 TraceCheckUtils]: 1: Hoare triple {53771#true} call #t~ret8 := is_do_write_p_triggered(); {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} havoc ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {53771#true} assume !(1 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {53771#true} assume !(2 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {53771#true} ~__retres1~0 := 0; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {53771#true} #res := ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {53771#true} {53771#true} #1746#return; {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {53771#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {53771#true} assume !(0 != ~tmp~1); {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {53771#true} call #t~ret9 := is_do_read_c_triggered(); {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {53771#true} havoc ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {53771#true} assume !(1 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {53771#true} assume !(2 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {53771#true} ~__retres1~1 := 0; {53771#true} is VALID [2022-02-20 20:01:14,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {53771#true} #res := ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {53771#true} {53771#true} #1748#return; {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {53771#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {53771#true} assume !(0 != ~tmp___0~1); {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,216 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {53771#true} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1754#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {53819#(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); {53835#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:14,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {53835#(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; {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:14,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:14,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1756#return; {53772#false} is VALID [2022-02-20 20:01:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {53771#true} havoc ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {53771#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53771#true} is VALID [2022-02-20 20:01:14,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} #res := ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,239 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53771#true} {53772#false} #1758#return; {53772#false} is VALID [2022-02-20 20:01:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {53771#true} havoc ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {53771#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53771#true} is VALID [2022-02-20 20:01:14,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} #res := ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,243 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53771#true} {53772#false} #1758#return; {53772#false} is VALID [2022-02-20 20:01:14,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {53771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {53771#true} is VALID [2022-02-20 20:01:14,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {53771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {53771#true} is VALID [2022-02-20 20:01:14,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {53771#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {53818#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:14,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {53818#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,245 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1750#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,246 INFO L272 TraceCheckUtils]: 12: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {53819#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {53819#(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); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,248 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1752#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {53820#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:14,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {53820#(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; {53771#true} is VALID [2022-02-20 20:01:14,248 INFO L272 TraceCheckUtils]: 19: Hoare triple {53771#true} call #t~ret8 := is_do_write_p_triggered(); {53771#true} is VALID [2022-02-20 20:01:14,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {53771#true} havoc ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {53771#true} assume !(1 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {53771#true} assume !(2 == ~p_dw_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {53771#true} ~__retres1~0 := 0; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {53771#true} #res := ~__retres1~0; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53771#true} {53771#true} #1746#return; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {53771#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {53771#true} assume !(0 != ~tmp~1); {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L272 TraceCheckUtils]: 29: Hoare triple {53771#true} call #t~ret9 := is_do_read_c_triggered(); {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {53771#true} havoc ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {53771#true} assume !(1 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {53771#true} assume !(2 == ~c_dr_pc~0); {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {53771#true} ~__retres1~1 := 0; {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {53771#true} #res := ~__retres1~1; {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53771#true} {53771#true} #1748#return; {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {53771#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {53771#true} assume !(0 != ~tmp___0~1); {53771#true} is VALID [2022-02-20 20:01:14,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,251 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {53771#true} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1754#return; {53773#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:14,251 INFO L272 TraceCheckUtils]: 41: Hoare triple {53773#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {53819#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {53819#(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); {53835#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:14,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {53835#(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; {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:14,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:14,252 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {53836#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53773#(= ~q_write_ev~0 ~q_read_ev~0)} #1756#return; {53772#false} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,253 INFO L272 TraceCheckUtils]: 49: Hoare triple {53772#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53771#true} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {53771#true} havoc ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {53771#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53771#true} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {53771#true} #res := ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,253 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {53771#true} {53772#false} #1758#return; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {53772#false} assume 0 != eval1_~tmp___1~0#1; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {53772#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {53772#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {53772#false} assume 0 == ~p_dw_pc~0; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {53772#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {53772#false} assume { :end_inline_do_write_p } true; {53772#false} is VALID [2022-02-20 20:01:14,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {53772#false} assume !(0 == ~c_dr_st~0); {53772#false} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,255 INFO L272 TraceCheckUtils]: 65: Hoare triple {53772#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53771#true} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {53771#true} havoc ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {53771#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53771#true} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {53771#true} #res := ~__retres1~2; {53771#true} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {53771#true} assume true; {53771#true} is VALID [2022-02-20 20:01:14,255 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {53771#true} {53772#false} #1758#return; {53772#false} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,255 INFO L290 TraceCheckUtils]: 72: Hoare triple {53772#false} assume 0 != eval1_~tmp___1~0#1; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {53772#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {53772#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {53772#false} assume !(0 == ~p_dw_pc~0); {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {53772#false} assume 1 == ~p_dw_pc~0; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {53772#false} assume !(0 == ~q_free~0); {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 79: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {53772#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53772#false} is VALID [2022-02-20 20:01:14,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {53772#false} assume { :end_inline_do_write_p } true; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {53772#false} assume !(0 == ~c_dr_pc~0); {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {53772#false} assume 2 == ~c_dr_pc~0; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {53772#false} do_read_c_~a~0#1 := ~a_t~0; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {53772#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; {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {53772#false} assume !(~p_last_write~0 == ~c_last_read~0); {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L272 TraceCheckUtils]: 89: Hoare triple {53772#false} call error1(); {53772#false} is VALID [2022-02-20 20:01:14,257 INFO L290 TraceCheckUtils]: 90: Hoare triple {53772#false} assume !false; {53772#false} is VALID [2022-02-20 20:01:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:14,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:14,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243190343] [2022-02-20 20:01:14,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243190343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:14,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:14,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:14,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328829398] [2022-02-20 20:01:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:14,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:14,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:14,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:14,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:14,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:14,330 INFO L87 Difference]: Start difference. First operand 2034 states and 2688 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:17,912 INFO L93 Difference]: Finished difference Result 3561 states and 4652 transitions. [2022-02-20 20:01:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1041 transitions. [2022-02-20 20:01:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1041 transitions. [2022-02-20 20:01:17,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1041 transitions. [2022-02-20 20:01:18,605 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 20:01:18,795 INFO L225 Difference]: With dead ends: 3561 [2022-02-20 20:01:18,795 INFO L226 Difference]: Without dead ends: 2108 [2022-02-20 20:01:18,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:01:18,798 INFO L933 BasicCegarLoop]: 691 mSDtfsCounter, 1636 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:18,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 2050 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-02-20 20:01:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1813. [2022-02-20 20:01:18,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:18,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2108 states. Second operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:18,888 INFO L74 IsIncluded]: Start isIncluded. First operand 2108 states. Second operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:18,890 INFO L87 Difference]: Start difference. First operand 2108 states. Second operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:19,032 INFO L93 Difference]: Finished difference Result 2108 states and 2775 transitions. [2022-02-20 20:01:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2775 transitions. [2022-02-20 20:01:19,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:19,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:19,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 2108 states. [2022-02-20 20:01:19,039 INFO L87 Difference]: Start difference. First operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 2108 states. [2022-02-20 20:01:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:19,166 INFO L93 Difference]: Finished difference Result 2108 states and 2775 transitions. [2022-02-20 20:01:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2775 transitions. [2022-02-20 20:01:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:19,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:19,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:19,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1468 states have (on average 1.3460490463215258) internal successors, (1976), 1489 states have internal predecessors, (1976), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2402 transitions. [2022-02-20 20:01:19,300 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2402 transitions. Word has length 91 [2022-02-20 20:01:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:19,300 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 2402 transitions. [2022-02-20 20:01:19,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2402 transitions. [2022-02-20 20:01:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:19,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:19,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:19,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:19,302 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1943019418, now seen corresponding path program 1 times [2022-02-20 20:01:19,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:19,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31559736] [2022-02-20 20:01:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:19,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {65273#(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); {65226#true} is VALID [2022-02-20 20:01:19,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65226#true} {65226#true} #1750#return; {65226#true} is VALID [2022-02-20 20:01:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {65274#(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); {65226#true} is VALID [2022-02-20 20:01:19,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume !(0 == ~q_write_ev~0); {65226#true} is VALID [2022-02-20 20:01:19,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1752#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {65226#true} havoc ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume !(1 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} assume !(2 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} ~__retres1~0 := 0; {65226#true} is VALID [2022-02-20 20:01:19,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {65226#true} #res := ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,374 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1746#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {65226#true} havoc ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume !(1 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} assume !(2 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} ~__retres1~1 := 0; {65226#true} is VALID [2022-02-20 20:01:19,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {65226#true} #res := ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1748#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {65275#(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; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,378 INFO L272 TraceCheckUtils]: 1: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} havoc ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} assume !(1 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {65226#true} assume !(2 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {65226#true} ~__retres1~0 := 0; {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {65226#true} #res := ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,379 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1746#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,380 INFO L272 TraceCheckUtils]: 11: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {65226#true} is VALID [2022-02-20 20:01:19,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {65226#true} havoc ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {65226#true} assume !(1 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {65226#true} assume !(2 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {65226#true} ~__retres1~1 := 0; {65226#true} is VALID [2022-02-20 20:01:19,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {65226#true} #res := ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,381 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1748#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,382 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {65231#(= ~c_dr_st~0 0)} #1754#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {65274#(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); {65226#true} is VALID [2022-02-20 20:01:19,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume !(1 == ~q_write_ev~0); {65226#true} is VALID [2022-02-20 20:01:19,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1756#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {65226#true} havoc ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65226#true} is VALID [2022-02-20 20:01:19,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} #res := ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,389 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1758#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:19,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {65226#true} havoc ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65226#true} is VALID [2022-02-20 20:01:19,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} #res := ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,393 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65226#true} {65227#false} #1758#return; {65227#false} is VALID [2022-02-20 20:01:19,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {65226#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {65226#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {65226#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {65226#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {65226#true} call update_channels1(); {65273#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:19,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {65273#(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); {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,394 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65226#true} {65226#true} #1750#return; {65226#true} is VALID [2022-02-20 20:01:19,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {65226#true} assume { :begin_inline_init_threads1 } true; {65226#true} is VALID [2022-02-20 20:01:19,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {65226#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65226#true} is VALID [2022-02-20 20:01:19,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {65226#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {65231#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,396 INFO L272 TraceCheckUtils]: 12: Hoare triple {65231#(= ~c_dr_st~0 0)} call fire_delta_events1(); {65274#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:19,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {65274#(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); {65226#true} is VALID [2022-02-20 20:01:19,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {65226#true} assume !(0 == ~q_write_ev~0); {65226#true} is VALID [2022-02-20 20:01:19,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1752#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {65231#(= ~c_dr_st~0 0)} call activate_threads1(); {65275#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {65275#(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; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,397 INFO L272 TraceCheckUtils]: 19: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {65226#true} havoc ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {65226#true} assume !(1 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {65226#true} assume !(2 == ~p_dw_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {65226#true} ~__retres1~0 := 0; {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {65226#true} #res := ~__retres1~0; {65226#true} is VALID [2022-02-20 20:01:19,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,398 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1746#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,399 INFO L272 TraceCheckUtils]: 29: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {65226#true} havoc ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {65226#true} assume !(1 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {65226#true} assume !(2 == ~c_dr_pc~0); {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {65226#true} ~__retres1~1 := 0; {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {65226#true} #res := ~__retres1~1; {65226#true} is VALID [2022-02-20 20:01:19,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,400 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65226#true} {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1748#return; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:19,401 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65276#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {65231#(= ~c_dr_st~0 0)} #1754#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,401 INFO L272 TraceCheckUtils]: 41: Hoare triple {65231#(= ~c_dr_st~0 0)} call reset_delta_events1(); {65274#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:19,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {65274#(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); {65226#true} is VALID [2022-02-20 20:01:19,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {65226#true} assume !(1 == ~q_write_ev~0); {65226#true} is VALID [2022-02-20 20:01:19,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,402 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1756#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {65231#(= ~c_dr_st~0 0)} assume !false; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {65231#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {65231#(= ~c_dr_st~0 0)} assume !false; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,403 INFO L272 TraceCheckUtils]: 49: Hoare triple {65231#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65226#true} is VALID [2022-02-20 20:01:19,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {65226#true} havoc ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {65226#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65226#true} is VALID [2022-02-20 20:01:19,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {65226#true} #res := ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,403 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {65226#true} {65231#(= ~c_dr_st~0 0)} #1758#return; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {65231#(= ~c_dr_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {65231#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {65231#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {65231#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {65231#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {65231#(= ~c_dr_st~0 0)} assume !false; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {65231#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {65231#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {65231#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {65231#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {65227#false} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {65227#false} assume !false; {65227#false} is VALID [2022-02-20 20:01:19,406 INFO L272 TraceCheckUtils]: 65: Hoare triple {65227#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65226#true} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {65226#true} havoc ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {65226#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65226#true} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {65226#true} #res := ~__retres1~2; {65226#true} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {65226#true} assume true; {65226#true} is VALID [2022-02-20 20:01:19,406 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {65226#true} {65227#false} #1758#return; {65227#false} is VALID [2022-02-20 20:01:19,406 INFO L290 TraceCheckUtils]: 71: Hoare triple {65227#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; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {65227#false} assume 0 != eval1_~tmp___1~0#1; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 73: Hoare triple {65227#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 74: Hoare triple {65227#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {65227#false} assume !(0 == ~p_dw_pc~0); {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 76: Hoare triple {65227#false} assume 1 == ~p_dw_pc~0; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {65227#false} assume !(0 == ~q_free~0); {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {65227#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; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {65227#false} assume !false; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 80: Hoare triple {65227#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {65227#false} is VALID [2022-02-20 20:01:19,407 INFO L290 TraceCheckUtils]: 81: Hoare triple {65227#false} assume { :end_inline_do_write_p } true; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {65227#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; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {65227#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; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {65227#false} assume !(0 == ~c_dr_pc~0); {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {65227#false} assume 2 == ~c_dr_pc~0; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 86: Hoare triple {65227#false} do_read_c_~a~0#1 := ~a_t~0; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {65227#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; {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {65227#false} assume !(~p_last_write~0 == ~c_last_read~0); {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L272 TraceCheckUtils]: 89: Hoare triple {65227#false} call error1(); {65227#false} is VALID [2022-02-20 20:01:19,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {65227#false} assume !false; {65227#false} is VALID [2022-02-20 20:01:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:01:19,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:19,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31559736] [2022-02-20 20:01:19,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31559736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:19,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:19,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:19,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009397295] [2022-02-20 20:01:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:19,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:19,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:19,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:19,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:19,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:19,454 INFO L87 Difference]: Start difference. First operand 1813 states and 2402 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:22,387 INFO L93 Difference]: Finished difference Result 4965 states and 6514 transitions. [2022-02-20 20:01:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 990 transitions. [2022-02-20 20:01:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 990 transitions. [2022-02-20 20:01:22,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 990 transitions. [2022-02-20 20:01:23,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 990 edges. 990 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:23,619 INFO L225 Difference]: With dead ends: 4965 [2022-02-20 20:01:23,619 INFO L226 Difference]: Without dead ends: 3496 [2022-02-20 20:01:23,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:01:23,622 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 1867 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:23,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1899 Valid, 1405 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2022-02-20 20:01:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3282. [2022-02-20 20:01:23,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:23,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3496 states. Second operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:23,805 INFO L74 IsIncluded]: Start isIncluded. First operand 3496 states. Second operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:23,809 INFO L87 Difference]: Start difference. First operand 3496 states. Second operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,168 INFO L93 Difference]: Finished difference Result 3496 states and 4570 transitions. [2022-02-20 20:01:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4570 transitions. [2022-02-20 20:01:24,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:24,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:24,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) Second operand 3496 states. [2022-02-20 20:01:24,181 INFO L87 Difference]: Start difference. First operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) Second operand 3496 states. [2022-02-20 20:01:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,558 INFO L93 Difference]: Finished difference Result 3496 states and 4570 transitions. [2022-02-20 20:01:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4570 transitions. [2022-02-20 20:01:24,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:24,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:24,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:24,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2617 states have (on average 1.3007260221627819) internal successors, (3404), 2667 states have internal predecessors, (3404), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4274 transitions. [2022-02-20 20:01:25,032 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4274 transitions. Word has length 91 [2022-02-20 20:01:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:25,032 INFO L470 AbstractCegarLoop]: Abstraction has 3282 states and 4274 transitions. [2022-02-20 20:01:25,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4274 transitions. [2022-02-20 20:01:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:25,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:25,034 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:25,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:25,035 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 885181340, now seen corresponding path program 1 times [2022-02-20 20:01:25,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:25,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698882855] [2022-02-20 20:01:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {83373#(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); {83326#true} is VALID [2022-02-20 20:01:25,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83326#true} {83328#(= 1 ~c_dr_i~0)} #1750#return; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {83374#(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); {83326#true} is VALID [2022-02-20 20:01:25,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume !(0 == ~q_write_ev~0); {83326#true} is VALID [2022-02-20 20:01:25,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83326#true} {83327#false} #1752#return; {83327#false} is VALID [2022-02-20 20:01:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {83326#true} havoc ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume !(1 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} assume !(2 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {83326#true} ~__retres1~0 := 0; {83326#true} is VALID [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {83326#true} #res := ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,090 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83326#true} {83326#true} #1746#return; {83326#true} is VALID [2022-02-20 20:01:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {83326#true} havoc ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume !(1 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} assume !(2 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {83326#true} ~__retres1~1 := 0; {83326#true} is VALID [2022-02-20 20:01:25,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {83326#true} #res := ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83326#true} {83326#true} #1748#return; {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {83375#(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; {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L272 TraceCheckUtils]: 1: Hoare triple {83326#true} call #t~ret8 := is_do_write_p_triggered(); {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} havoc ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {83326#true} assume !(1 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {83326#true} assume !(2 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {83326#true} ~__retres1~0 := 0; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {83326#true} #res := ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {83326#true} {83326#true} #1746#return; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {83326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {83326#true} assume !(0 != ~tmp~1); {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {83326#true} call #t~ret9 := is_do_read_c_triggered(); {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {83326#true} havoc ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {83326#true} assume !(1 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {83326#true} assume !(2 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {83326#true} ~__retres1~1 := 0; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {83326#true} #res := ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {83326#true} {83326#true} #1748#return; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {83326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {83326#true} assume !(0 != ~tmp___0~1); {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,096 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {83326#true} {83327#false} #1754#return; {83327#false} is VALID [2022-02-20 20:01:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {83374#(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); {83326#true} is VALID [2022-02-20 20:01:25,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume !(1 == ~q_write_ev~0); {83326#true} is VALID [2022-02-20 20:01:25,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83326#true} {83327#false} #1756#return; {83327#false} is VALID [2022-02-20 20:01:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {83326#true} havoc ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83326#true} is VALID [2022-02-20 20:01:25,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} #res := ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,103 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83326#true} {83327#false} #1758#return; {83327#false} is VALID [2022-02-20 20:01:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {83326#true} havoc ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83326#true} is VALID [2022-02-20 20:01:25,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} #res := ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,107 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83326#true} {83327#false} #1758#return; {83327#false} is VALID [2022-02-20 20:01:25,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {83326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {83326#true} is VALID [2022-02-20 20:01:25,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {83326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {83326#true} is VALID [2022-02-20 20:01:25,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {83326#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {83328#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {83328#(= 1 ~c_dr_i~0)} call update_channels1(); {83373#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:25,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {83373#(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); {83326#true} is VALID [2022-02-20 20:01:25,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,109 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83326#true} {83328#(= 1 ~c_dr_i~0)} #1750#return; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {83328#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {83328#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {83328#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:25,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {83328#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {83327#false} is VALID [2022-02-20 20:01:25,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {83327#false} assume { :end_inline_init_threads1 } true; {83327#false} is VALID [2022-02-20 20:01:25,110 INFO L272 TraceCheckUtils]: 12: Hoare triple {83327#false} call fire_delta_events1(); {83374#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:25,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {83374#(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); {83326#true} is VALID [2022-02-20 20:01:25,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {83326#true} assume !(0 == ~q_write_ev~0); {83326#true} is VALID [2022-02-20 20:01:25,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,110 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83326#true} {83327#false} #1752#return; {83327#false} is VALID [2022-02-20 20:01:25,110 INFO L272 TraceCheckUtils]: 17: Hoare triple {83327#false} call activate_threads1(); {83375#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:25,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {83375#(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; {83326#true} is VALID [2022-02-20 20:01:25,110 INFO L272 TraceCheckUtils]: 19: Hoare triple {83326#true} call #t~ret8 := is_do_write_p_triggered(); {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {83326#true} havoc ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {83326#true} assume !(1 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {83326#true} assume !(2 == ~p_dw_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {83326#true} ~__retres1~0 := 0; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {83326#true} #res := ~__retres1~0; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {83326#true} {83326#true} #1746#return; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {83326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83326#true} is VALID [2022-02-20 20:01:25,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {83326#true} assume !(0 != ~tmp~1); {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L272 TraceCheckUtils]: 29: Hoare triple {83326#true} call #t~ret9 := is_do_read_c_triggered(); {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {83326#true} havoc ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {83326#true} assume !(1 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {83326#true} assume !(2 == ~c_dr_pc~0); {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {83326#true} ~__retres1~1 := 0; {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {83326#true} #res := ~__retres1~1; {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {83326#true} {83326#true} #1748#return; {83326#true} is VALID [2022-02-20 20:01:25,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {83326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {83326#true} assume !(0 != ~tmp___0~1); {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {83326#true} {83327#false} #1754#return; {83327#false} is VALID [2022-02-20 20:01:25,113 INFO L272 TraceCheckUtils]: 41: Hoare triple {83327#false} call reset_delta_events1(); {83374#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {83374#(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); {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {83326#true} assume !(1 == ~q_write_ev~0); {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,113 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {83326#true} {83327#false} #1756#return; {83327#false} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,114 INFO L272 TraceCheckUtils]: 49: Hoare triple {83327#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83326#true} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {83326#true} havoc ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {83326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83326#true} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {83326#true} #res := ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,114 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {83326#true} {83327#false} #1758#return; {83327#false} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {83327#false} assume 0 != eval1_~tmp___1~0#1; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {83327#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {83327#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {83327#false} assume 0 == ~p_dw_pc~0; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {83327#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {83327#false} assume { :end_inline_do_write_p } true; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {83327#false} assume !(0 == ~c_dr_st~0); {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,115 INFO L272 TraceCheckUtils]: 65: Hoare triple {83327#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83326#true} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {83326#true} havoc ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {83326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83326#true} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {83326#true} #res := ~__retres1~2; {83326#true} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {83326#true} assume true; {83326#true} is VALID [2022-02-20 20:01:25,116 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {83326#true} {83327#false} #1758#return; {83327#false} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {83327#false} assume 0 != eval1_~tmp___1~0#1; {83327#false} is VALID [2022-02-20 20:01:25,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {83327#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {83327#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {83327#false} assume !(0 == ~p_dw_pc~0); {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {83327#false} assume 1 == ~p_dw_pc~0; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {83327#false} assume !(0 == ~q_free~0); {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 79: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 80: Hoare triple {83327#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83327#false} is VALID [2022-02-20 20:01:25,117 INFO L290 TraceCheckUtils]: 81: Hoare triple {83327#false} assume { :end_inline_do_write_p } true; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {83327#false} assume !(0 == ~c_dr_pc~0); {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {83327#false} assume 2 == ~c_dr_pc~0; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {83327#false} do_read_c_~a~0#1 := ~a_t~0; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 87: Hoare triple {83327#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; {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {83327#false} assume !(~p_last_write~0 == ~c_last_read~0); {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L272 TraceCheckUtils]: 89: Hoare triple {83327#false} call error1(); {83327#false} is VALID [2022-02-20 20:01:25,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {83327#false} assume !false; {83327#false} is VALID [2022-02-20 20:01:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:25,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:25,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698882855] [2022-02-20 20:01:25,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698882855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:25,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:25,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:25,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961525197] [2022-02-20 20:01:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:25,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:25,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:25,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:25,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:25,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:25,174 INFO L87 Difference]: Start difference. First operand 3282 states and 4274 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:27,538 INFO L93 Difference]: Finished difference Result 4866 states and 6258 transitions. [2022-02-20 20:01:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:27,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2022-02-20 20:01:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2022-02-20 20:01:27,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 835 transitions. [2022-02-20 20:01:28,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 835 edges. 835 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:28,220 INFO L225 Difference]: With dead ends: 4866 [2022-02-20 20:01:28,220 INFO L226 Difference]: Without dead ends: 1928 [2022-02-20 20:01:28,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:28,223 INFO L933 BasicCegarLoop]: 658 mSDtfsCounter, 977 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:28,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [992 Valid, 1529 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-02-20 20:01:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1813. [2022-02-20 20:01:28,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:28,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1928 states. Second operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:28,308 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:28,310 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,416 INFO L93 Difference]: Finished difference Result 1928 states and 2525 transitions. [2022-02-20 20:01:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2525 transitions. [2022-02-20 20:01:28,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 1928 states. [2022-02-20 20:01:28,424 INFO L87 Difference]: Start difference. First operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 1928 states. [2022-02-20 20:01:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,531 INFO L93 Difference]: Finished difference Result 1928 states and 2525 transitions. [2022-02-20 20:01:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2525 transitions. [2022-02-20 20:01:28,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:28,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1468 states have (on average 1.3208446866485013) internal successors, (1939), 1489 states have internal predecessors, (1939), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2365 transitions. [2022-02-20 20:01:28,686 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2365 transitions. Word has length 91 [2022-02-20 20:01:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:28,686 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 2365 transitions. [2022-02-20 20:01:28,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2365 transitions. [2022-02-20 20:01:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:28,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:28,687 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:28,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:28,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1161498813, now seen corresponding path program 1 times [2022-02-20 20:01:28,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:28,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157010120] [2022-02-20 20:01:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {96242#(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); {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:28,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:28,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {96196#(= ~q_read_ev~0 2)} #1750#return; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {96244#(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); {96194#true} is VALID [2022-02-20 20:01:28,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume !(0 == ~q_write_ev~0); {96194#true} is VALID [2022-02-20 20:01:28,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96194#true} {96196#(= ~q_read_ev~0 2)} #1752#return; {96194#true} is VALID [2022-02-20 20:01:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {96194#true} havoc ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume !(1 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} assume !(2 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {96194#true} ~__retres1~0 := 0; {96194#true} is VALID [2022-02-20 20:01:28,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {96194#true} #res := ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,772 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96194#true} {96194#true} #1746#return; {96194#true} is VALID [2022-02-20 20:01:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {96194#true} havoc ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume !(1 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} assume !(2 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {96194#true} ~__retres1~1 := 0; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {96194#true} #res := ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96194#true} {96194#true} #1748#return; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {96245#(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; {96194#true} is VALID [2022-02-20 20:01:28,775 INFO L272 TraceCheckUtils]: 1: Hoare triple {96194#true} call #t~ret8 := is_do_write_p_triggered(); {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} havoc ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {96194#true} assume !(1 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {96194#true} assume !(2 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {96194#true} ~__retres1~0 := 0; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {96194#true} #res := ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {96194#true} {96194#true} #1746#return; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {96194#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96194#true} is VALID [2022-02-20 20:01:28,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {96194#true} assume !(0 != ~tmp~1); {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {96194#true} call #t~ret9 := is_do_read_c_triggered(); {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {96194#true} havoc ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {96194#true} assume !(1 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {96194#true} assume !(2 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {96194#true} ~__retres1~1 := 0; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {96194#true} #res := ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {96194#true} {96194#true} #1748#return; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {96194#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96194#true} is VALID [2022-02-20 20:01:28,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {96194#true} assume !(0 != ~tmp___0~1); {96194#true} is VALID [2022-02-20 20:01:28,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,778 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {96194#true} {96194#true} #1754#return; {96194#true} is VALID [2022-02-20 20:01:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {96244#(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); {96194#true} is VALID [2022-02-20 20:01:28,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume !(1 == ~q_write_ev~0); {96194#true} is VALID [2022-02-20 20:01:28,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96194#true} {96194#true} #1756#return; {96194#true} is VALID [2022-02-20 20:01:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {96194#true} havoc ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96194#true} is VALID [2022-02-20 20:01:28,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} #res := ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,785 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96194#true} {96194#true} #1758#return; {96194#true} is VALID [2022-02-20 20:01:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {96194#true} havoc ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {96260#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {96260#(= ~p_dw_st~0 0)} assume true; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,793 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96260#(= ~p_dw_st~0 0)} {96236#(not (= ~p_dw_st~0 0))} #1758#return; {96195#false} is VALID [2022-02-20 20:01:28,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {96194#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {96194#true} is VALID [2022-02-20 20:01:28,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {96194#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {96194#true} is VALID [2022-02-20 20:01:28,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {96194#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {96196#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {96196#(= ~q_read_ev~0 2)} call update_channels1(); {96242#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:28,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {96242#(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); {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:28,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:28,795 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96243#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {96196#(= ~q_read_ev~0 2)} #1750#return; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {96196#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {96196#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {96196#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {96196#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {96196#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:28,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {96196#(= ~q_read_ev~0 2)} call fire_delta_events1(); {96244#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:28,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {96244#(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); {96194#true} is VALID [2022-02-20 20:01:28,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {96194#true} assume !(0 == ~q_write_ev~0); {96194#true} is VALID [2022-02-20 20:01:28,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,797 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96194#true} {96196#(= ~q_read_ev~0 2)} #1752#return; {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {96194#true} call activate_threads1(); {96245#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {96245#(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; {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L272 TraceCheckUtils]: 19: Hoare triple {96194#true} call #t~ret8 := is_do_write_p_triggered(); {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {96194#true} havoc ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {96194#true} assume !(1 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {96194#true} assume !(2 == ~p_dw_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {96194#true} ~__retres1~0 := 0; {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {96194#true} #res := ~__retres1~0; {96194#true} is VALID [2022-02-20 20:01:28,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {96194#true} {96194#true} #1746#return; {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {96194#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {96194#true} assume !(0 != ~tmp~1); {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L272 TraceCheckUtils]: 29: Hoare triple {96194#true} call #t~ret9 := is_do_read_c_triggered(); {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {96194#true} havoc ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {96194#true} assume !(1 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {96194#true} assume !(2 == ~c_dr_pc~0); {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {96194#true} ~__retres1~1 := 0; {96194#true} is VALID [2022-02-20 20:01:28,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {96194#true} #res := ~__retres1~1; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {96194#true} {96194#true} #1748#return; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {96194#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {96194#true} assume !(0 != ~tmp___0~1); {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {96194#true} {96194#true} #1754#return; {96194#true} is VALID [2022-02-20 20:01:28,800 INFO L272 TraceCheckUtils]: 41: Hoare triple {96194#true} call reset_delta_events1(); {96244#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {96244#(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); {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {96194#true} assume !(1 == ~q_write_ev~0); {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {96194#true} {96194#true} #1756#return; {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {96194#true} assume !false; {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {96194#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; {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {96194#true} assume !false; {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L272 TraceCheckUtils]: 49: Hoare triple {96194#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96194#true} is VALID [2022-02-20 20:01:28,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {96194#true} havoc ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {96194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {96194#true} #res := ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {96194#true} assume true; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {96194#true} {96194#true} #1758#return; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {96194#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; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {96194#true} assume 0 != eval1_~tmp___1~0#1; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {96194#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; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {96194#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; {96194#true} is VALID [2022-02-20 20:01:28,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {96194#true} assume 0 == ~p_dw_pc~0; {96194#true} is VALID [2022-02-20 20:01:28,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {96194#true} assume !false; {96194#true} is VALID [2022-02-20 20:01:28,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {96194#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96236#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:28,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {96236#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {96236#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:28,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {96236#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {96236#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:28,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {96236#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {96236#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:28,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {96236#(not (= ~p_dw_st~0 0))} assume !false; {96236#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:28,804 INFO L272 TraceCheckUtils]: 66: Hoare triple {96236#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96194#true} is VALID [2022-02-20 20:01:28,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {96194#true} havoc ~__retres1~2; {96194#true} is VALID [2022-02-20 20:01:28,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {96194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {96260#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {96260#(= ~p_dw_st~0 0)} assume true; {96260#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:28,805 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {96260#(= ~p_dw_st~0 0)} {96236#(not (= ~p_dw_st~0 0))} #1758#return; {96195#false} is VALID [2022-02-20 20:01:28,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {96195#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; {96195#false} is VALID [2022-02-20 20:01:28,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {96195#false} assume 0 != eval1_~tmp___1~0#1; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {96195#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {96195#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 76: Hoare triple {96195#false} assume !(0 == ~p_dw_pc~0); {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 77: Hoare triple {96195#false} assume 1 == ~p_dw_pc~0; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {96195#false} assume !(0 == ~q_free~0); {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {96195#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; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 80: Hoare triple {96195#false} assume !false; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {96195#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {96195#false} assume { :end_inline_do_write_p } true; {96195#false} is VALID [2022-02-20 20:01:28,806 INFO L290 TraceCheckUtils]: 83: Hoare triple {96195#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; {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {96195#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; {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {96195#false} assume !(0 == ~c_dr_pc~0); {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 86: Hoare triple {96195#false} assume 2 == ~c_dr_pc~0; {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 87: Hoare triple {96195#false} do_read_c_~a~0#1 := ~a_t~0; {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 88: Hoare triple {96195#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; {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {96195#false} assume !(~p_last_write~0 == ~c_last_read~0); {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L272 TraceCheckUtils]: 90: Hoare triple {96195#false} call error1(); {96195#false} is VALID [2022-02-20 20:01:28,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {96195#false} assume !false; {96195#false} is VALID [2022-02-20 20:01:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:01:28,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:28,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157010120] [2022-02-20 20:01:28,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157010120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:28,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:28,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:28,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164998683] [2022-02-20 20:01:28,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:28,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:28,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:28,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:28,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:28,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:28,854 INFO L87 Difference]: Start difference. First operand 1813 states and 2365 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:33,487 INFO L93 Difference]: Finished difference Result 4231 states and 5448 transitions. [2022-02-20 20:01:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:01:33,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1275 transitions. [2022-02-20 20:01:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1275 transitions. [2022-02-20 20:01:33,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1275 transitions.