./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.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 ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:06,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:06,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:06,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:06,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:06,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:06,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:06,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:06,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:06,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:06,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:06,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:06,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:06,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:06,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:06,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:06,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:06,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:06,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:06,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:06,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:06,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:06,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:06,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:06,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:06,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:06,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:07,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:07,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:07,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:07,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:07,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:07,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:07,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:07,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:07,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:07,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:07,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:07,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:07,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:07,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:07,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:58:07,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:07,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:07,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:07,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:07,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:07,039 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:07,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:07,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:07,039 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:07,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:07,040 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:07,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:07,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:07,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:07,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:07,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:07,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:07,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:07,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:07,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:07,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:07,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:07,045 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 -> ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f [2022-02-20 19:58:07,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:07,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:07,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:07,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:07,281 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:07,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2022-02-20 19:58:07,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9540b03f4/93368cebe6b64353a7dbef94f91ad390/FLAGd682d5858 [2022-02-20 19:58:07,721 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:07,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2022-02-20 19:58:07,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9540b03f4/93368cebe6b64353a7dbef94f91ad390/FLAGd682d5858 [2022-02-20 19:58:08,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9540b03f4/93368cebe6b64353a7dbef94f91ad390 [2022-02-20 19:58:08,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:08,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:08,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:08,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:08,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:08,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509ce0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08, skipping insertion in model container [2022-02-20 19:58:08,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:08,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:08,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2022-02-20 19:58:08,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2022-02-20 19:58:08,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:08,434 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:08,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2022-02-20 19:58:08,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2022-02-20 19:58:08,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:08,538 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:08,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08 WrapperNode [2022-02-20 19:58:08,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:08,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:08,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:08,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:08,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,635 INFO L137 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1103 [2022-02-20 19:58:08,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:08,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:08,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:08,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:08,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:08,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:08,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:08,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:08,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:08,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:58:08,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:58:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:58:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:58:08,852 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:08,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:09,596 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:09,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:09,611 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-02-20 19:58:09,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:09 BoogieIcfgContainer [2022-02-20 19:58:09,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:09,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:09,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:09,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:08" (1/3) ... [2022-02-20 19:58:09,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9cdc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:09, skipping insertion in model container [2022-02-20 19:58:09,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (2/3) ... [2022-02-20 19:58:09,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9cdc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:09, skipping insertion in model container [2022-02-20 19:58:09,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:09" (3/3) ... [2022-02-20 19:58:09,619 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2022-02-20 19:58:09,623 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:09,623 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:09,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:09,669 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:58:09,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 455 states have (on average 1.6483516483516483) internal successors, (750), 463 states have internal predecessors, (750), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-02-20 19:58:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:09,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:09,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:09,702 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1743097905, now seen corresponding path program 1 times [2022-02-20 19:58:09,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:09,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922389369] [2022-02-20 19:58:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:09,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#(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); {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:09,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:09,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {521#(= ~q_read_ev~0 2)} #2025#return; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:09,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(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; {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:09,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {562#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:09,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {562#(= |old(~q_read_ev~0)| 0)} assume true; {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:09,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {562#(= |old(~q_read_ev~0)| 0)} {521#(= ~q_read_ev~0 2)} #2027#return; {520#false} is VALID [2022-02-20 19:58:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} havoc ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume 1 == ~p_dw_pc~0; {519#true} is VALID [2022-02-20 19:58:10,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {519#true} is VALID [2022-02-20 19:58:10,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} #res := ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,017 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {519#true} {519#true} #2021#return; {519#true} is VALID [2022-02-20 19:58:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} havoc ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume 1 == ~c_dr_pc~0; {519#true} is VALID [2022-02-20 19:58:10,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {519#true} is VALID [2022-02-20 19:58:10,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} #res := ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,027 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {519#true} {519#true} #2023#return; {519#true} is VALID [2022-02-20 19:58:10,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(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; {519#true} is VALID [2022-02-20 19:58:10,028 INFO L272 TraceCheckUtils]: 1: Hoare triple {519#true} call #t~ret8 := is_do_write_p_triggered(); {519#true} is VALID [2022-02-20 19:58:10,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} havoc ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} assume 1 == ~p_dw_pc~0; {519#true} is VALID [2022-02-20 19:58:10,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {519#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {519#true} is VALID [2022-02-20 19:58:10,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#true} #res := ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,029 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {519#true} {519#true} #2021#return; {519#true} is VALID [2022-02-20 19:58:10,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {519#true} is VALID [2022-02-20 19:58:10,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {519#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {519#true} is VALID [2022-02-20 19:58:10,030 INFO L272 TraceCheckUtils]: 10: Hoare triple {519#true} call #t~ret9 := is_do_read_c_triggered(); {519#true} is VALID [2022-02-20 19:58:10,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#true} havoc ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#true} assume 1 == ~c_dr_pc~0; {519#true} is VALID [2022-02-20 19:58:10,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {519#true} is VALID [2022-02-20 19:58:10,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#true} #res := ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,031 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {519#true} {519#true} #2023#return; {519#true} is VALID [2022-02-20 19:58:10,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {519#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {519#true} is VALID [2022-02-20 19:58:10,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {519#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {519#true} is VALID [2022-02-20 19:58:10,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,034 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {519#true} {520#false} #2029#return; {520#false} is VALID [2022-02-20 19:58:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(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; {519#true} is VALID [2022-02-20 19:58:10,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {519#true} is VALID [2022-02-20 19:58:10,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {520#false} #2031#return; {520#false} is VALID [2022-02-20 19:58:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} havoc ~__retres1~2; {519#true} is VALID [2022-02-20 19:58:10,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {519#true} is VALID [2022-02-20 19:58:10,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} #res := ~__retres1~2; {519#true} is VALID [2022-02-20 19:58:10,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,063 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {519#true} {520#false} #2033#return; {520#false} is VALID [2022-02-20 19:58:10,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {519#true} is VALID [2022-02-20 19:58:10,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {519#true} is VALID [2022-02-20 19:58:10,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {521#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#(= ~q_read_ev~0 2)} call update_channels1(); {559#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:10,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {559#(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); {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,069 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {560#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {521#(= ~q_read_ev~0 2)} #2025#return; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {521#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {521#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {521#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {521#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,071 INFO L272 TraceCheckUtils]: 12: Hoare triple {521#(= ~q_read_ev~0 2)} call fire_delta_events1(); {561#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {561#(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; {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(= |old(~q_read_ev~0)| 0)} assume true; {562#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {562#(= |old(~q_read_ev~0)| 0)} {521#(= ~q_read_ev~0 2)} #2027#return; {520#false} is VALID [2022-02-20 19:58:10,073 INFO L272 TraceCheckUtils]: 17: Hoare triple {520#false} call activate_threads1(); {563#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:10,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {563#(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; {519#true} is VALID [2022-02-20 19:58:10,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {519#true} call #t~ret8 := is_do_write_p_triggered(); {519#true} is VALID [2022-02-20 19:58:10,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {519#true} havoc ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#true} assume 1 == ~p_dw_pc~0; {519#true} is VALID [2022-02-20 19:58:10,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {519#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {519#true} is VALID [2022-02-20 19:58:10,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {519#true} #res := ~__retres1~0; {519#true} is VALID [2022-02-20 19:58:10,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,075 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {519#true} {519#true} #2021#return; {519#true} is VALID [2022-02-20 19:58:10,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {519#true} is VALID [2022-02-20 19:58:10,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {519#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {519#true} is VALID [2022-02-20 19:58:10,076 INFO L272 TraceCheckUtils]: 28: Hoare triple {519#true} call #t~ret9 := is_do_read_c_triggered(); {519#true} is VALID [2022-02-20 19:58:10,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {519#true} havoc ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {519#true} assume 1 == ~c_dr_pc~0; {519#true} is VALID [2022-02-20 19:58:10,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {519#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {519#true} is VALID [2022-02-20 19:58:10,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {519#true} #res := ~__retres1~1; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {519#true} {519#true} #2023#return; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {519#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {519#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,077 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {519#true} {520#false} #2029#return; {520#false} is VALID [2022-02-20 19:58:10,078 INFO L272 TraceCheckUtils]: 39: Hoare triple {520#false} call reset_delta_events1(); {561#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {561#(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; {519#true} is VALID [2022-02-20 19:58:10,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {519#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {519#true} is VALID [2022-02-20 19:58:10,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,078 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {519#true} {520#false} #2031#return; {520#false} is VALID [2022-02-20 19:58:10,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 19:58:10,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {520#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; {520#false} is VALID [2022-02-20 19:58:10,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 19:58:10,079 INFO L272 TraceCheckUtils]: 47: Hoare triple {520#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {519#true} is VALID [2022-02-20 19:58:10,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {519#true} havoc ~__retres1~2; {519#true} is VALID [2022-02-20 19:58:10,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {519#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {519#true} is VALID [2022-02-20 19:58:10,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {519#true} #res := ~__retres1~2; {519#true} is VALID [2022-02-20 19:58:10,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 19:58:10,082 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {519#true} {520#false} #2033#return; {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {520#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; {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {520#false} assume 0 != eval1_~tmp___1~0#1; {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {520#false} assume !(0 == ~p_dw_st~0); {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {520#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; {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {520#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; {520#false} is VALID [2022-02-20 19:58:10,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {520#false} assume 0 == ~c_dr_pc~0; {520#false} is VALID [2022-02-20 19:58:10,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 19:58:10,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {520#false} assume !(1 == ~q_free~0); {520#false} is VALID [2022-02-20 19:58:10,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {520#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; {520#false} is VALID [2022-02-20 19:58:10,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {520#false} assume !(~p_last_write~0 == ~c_last_read~0); {520#false} is VALID [2022-02-20 19:58:10,083 INFO L272 TraceCheckUtils]: 63: Hoare triple {520#false} call error1(); {520#false} is VALID [2022-02-20 19:58:10,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 19:58:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:10,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922389369] [2022-02-20 19:58:10,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922389369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:10,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146587072] [2022-02-20 19:58:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:10,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:10,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:10,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:10,170 INFO L87 Difference]: Start difference. First operand has 516 states, 455 states have (on average 1.6483516483516483) internal successors, (750), 463 states have internal predecessors, (750), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,412 INFO L93 Difference]: Finished difference Result 1137 states and 1828 transitions. [2022-02-20 19:58:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1828 transitions. [2022-02-20 19:58:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1828 transitions. [2022-02-20 19:58:13,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1828 transitions. [2022-02-20 19:58:14,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1828 edges. 1828 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:14,669 INFO L225 Difference]: With dead ends: 1137 [2022-02-20 19:58:14,669 INFO L226 Difference]: Without dead ends: 640 [2022-02-20 19:58:14,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:14,680 INFO L933 BasicCegarLoop]: 793 mSDtfsCounter, 1258 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:14,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 2281 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-02-20 19:58:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 601. [2022-02-20 19:58:14,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:14,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 640 states. Second operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:14,768 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:14,772 INFO L87 Difference]: Start difference. First operand 640 states. Second operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,800 INFO L93 Difference]: Finished difference Result 640 states and 966 transitions. [2022-02-20 19:58:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 966 transitions. [2022-02-20 19:58:14,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 640 states. [2022-02-20 19:58:14,808 INFO L87 Difference]: Start difference. First operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 640 states. [2022-02-20 19:58:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,831 INFO L93 Difference]: Finished difference Result 640 states and 966 transitions. [2022-02-20 19:58:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 966 transitions. [2022-02-20 19:58:14,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:14,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 523 states have (on average 1.5353728489483747) internal successors, (803), 530 states have internal predecessors, (803), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 912 transitions. [2022-02-20 19:58:14,859 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 912 transitions. Word has length 65 [2022-02-20 19:58:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:14,859 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 912 transitions. [2022-02-20 19:58:14,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 912 transitions. [2022-02-20 19:58:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:14,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:14,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:14,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:14,862 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2146883856, now seen corresponding path program 1 times [2022-02-20 19:58:14,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:14,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023854778] [2022-02-20 19:58:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#(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); {4159#true} is VALID [2022-02-20 19:58:14,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:14,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4159#true} {4159#true} #2025#return; {4159#true} is VALID [2022-02-20 19:58:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {4199#(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); {4159#true} is VALID [2022-02-20 19:58:14,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume !(0 == ~q_write_ev~0); {4159#true} is VALID [2022-02-20 19:58:14,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:14,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4159#true} {4159#true} #2027#return; {4159#true} is VALID [2022-02-20 19:58:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#true} havoc ~__retres1~0; {4159#true} is VALID [2022-02-20 19:58:15,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume !(1 == ~p_dw_pc~0); {4159#true} is VALID [2022-02-20 19:58:15,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} ~__retres1~0 := 0; {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,029 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4159#true} #2021#return; {4207#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#true} havoc ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume 1 == ~c_dr_pc~0; {4159#true} is VALID [2022-02-20 19:58:15,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4159#true} is VALID [2022-02-20 19:58:15,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {4159#true} #res := ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,033 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4159#true} {4160#false} #2023#return; {4160#false} is VALID [2022-02-20 19:58:15,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {4200#(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; {4159#true} is VALID [2022-02-20 19:58:15,034 INFO L272 TraceCheckUtils]: 1: Hoare triple {4159#true} call #t~ret8 := is_do_write_p_triggered(); {4159#true} is VALID [2022-02-20 19:58:15,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} havoc ~__retres1~0; {4159#true} is VALID [2022-02-20 19:58:15,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {4159#true} assume !(1 == ~p_dw_pc~0); {4159#true} is VALID [2022-02-20 19:58:15,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {4159#true} ~__retres1~0 := 0; {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,036 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4159#true} #2021#return; {4207#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {4207#(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; {4208#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:15,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {4208#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4160#false} is VALID [2022-02-20 19:58:15,037 INFO L272 TraceCheckUtils]: 10: Hoare triple {4160#false} call #t~ret9 := is_do_read_c_triggered(); {4159#true} is VALID [2022-02-20 19:58:15,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {4159#true} havoc ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {4159#true} assume 1 == ~c_dr_pc~0; {4159#true} is VALID [2022-02-20 19:58:15,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {4159#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4159#true} is VALID [2022-02-20 19:58:15,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {4159#true} #res := ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,038 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4159#true} {4160#false} #2023#return; {4160#false} is VALID [2022-02-20 19:58:15,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {4160#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4160#false} is VALID [2022-02-20 19:58:15,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {4160#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4160#false} is VALID [2022-02-20 19:58:15,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {4160#false} assume true; {4160#false} is VALID [2022-02-20 19:58:15,039 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4160#false} {4159#true} #2029#return; {4160#false} is VALID [2022-02-20 19:58:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {4199#(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); {4159#true} is VALID [2022-02-20 19:58:15,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4159#true} is VALID [2022-02-20 19:58:15,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4159#true} {4160#false} #2031#return; {4160#false} is VALID [2022-02-20 19:58:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#true} havoc ~__retres1~2; {4159#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4159#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} #res := ~__retres1~2; {4159#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,048 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4159#true} {4160#false} #2033#return; {4160#false} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {4159#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {4159#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {4159#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {4159#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {4159#true} is VALID [2022-02-20 19:58:15,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {4159#true} call update_channels1(); {4198#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:15,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#(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); {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4159#true} {4159#true} #2025#return; {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {4159#true} assume { :begin_inline_init_threads1 } true; {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {4159#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {4159#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4159#true} is VALID [2022-02-20 19:58:15,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {4159#true} assume { :end_inline_init_threads1 } true; {4159#true} is VALID [2022-02-20 19:58:15,063 INFO L272 TraceCheckUtils]: 12: Hoare triple {4159#true} call fire_delta_events1(); {4199#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {4199#(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); {4159#true} is VALID [2022-02-20 19:58:15,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {4159#true} assume !(0 == ~q_write_ev~0); {4159#true} is VALID [2022-02-20 19:58:15,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,065 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4159#true} {4159#true} #2027#return; {4159#true} is VALID [2022-02-20 19:58:15,066 INFO L272 TraceCheckUtils]: 17: Hoare triple {4159#true} call activate_threads1(); {4200#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:15,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {4200#(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; {4159#true} is VALID [2022-02-20 19:58:15,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {4159#true} call #t~ret8 := is_do_write_p_triggered(); {4159#true} is VALID [2022-02-20 19:58:15,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {4159#true} havoc ~__retres1~0; {4159#true} is VALID [2022-02-20 19:58:15,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {4159#true} assume !(1 == ~p_dw_pc~0); {4159#true} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {4159#true} ~__retres1~0 := 0; {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,068 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4216#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4159#true} #2021#return; {4207#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#(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; {4208#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {4208#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4160#false} is VALID [2022-02-20 19:58:15,069 INFO L272 TraceCheckUtils]: 28: Hoare triple {4160#false} call #t~ret9 := is_do_read_c_triggered(); {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {4159#true} havoc ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {4159#true} assume 1 == ~c_dr_pc~0; {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {4159#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {4159#true} #res := ~__retres1~1; {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,069 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4159#true} {4160#false} #2023#return; {4160#false} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {4160#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4160#false} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {4160#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4160#false} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {4160#false} assume true; {4160#false} is VALID [2022-02-20 19:58:15,070 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4160#false} {4159#true} #2029#return; {4160#false} is VALID [2022-02-20 19:58:15,070 INFO L272 TraceCheckUtils]: 39: Hoare triple {4160#false} call reset_delta_events1(); {4199#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {4199#(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); {4159#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {4159#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4159#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,071 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4159#true} {4160#false} #2031#return; {4160#false} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {4160#false} assume !false; {4160#false} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {4160#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; {4160#false} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {4160#false} assume !false; {4160#false} is VALID [2022-02-20 19:58:15,071 INFO L272 TraceCheckUtils]: 47: Hoare triple {4160#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4159#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {4159#true} havoc ~__retres1~2; {4159#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {4159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4159#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {4159#true} #res := ~__retres1~2; {4159#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {4159#true} assume true; {4159#true} is VALID [2022-02-20 19:58:15,072 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4159#true} {4160#false} #2033#return; {4160#false} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {4160#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; {4160#false} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {4160#false} assume 0 != eval1_~tmp___1~0#1; {4160#false} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {4160#false} assume !(0 == ~p_dw_st~0); {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {4160#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; {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {4160#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; {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {4160#false} assume 0 == ~c_dr_pc~0; {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {4160#false} assume !false; {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {4160#false} assume !(1 == ~q_free~0); {4160#false} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {4160#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; {4160#false} is VALID [2022-02-20 19:58:15,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {4160#false} assume !(~p_last_write~0 == ~c_last_read~0); {4160#false} is VALID [2022-02-20 19:58:15,074 INFO L272 TraceCheckUtils]: 63: Hoare triple {4160#false} call error1(); {4160#false} is VALID [2022-02-20 19:58:15,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {4160#false} assume !false; {4160#false} is VALID [2022-02-20 19:58:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:15,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:15,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023854778] [2022-02-20 19:58:15,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023854778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:15,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:15,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:15,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866665575] [2022-02-20 19:58:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:15,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:15,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:15,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:15,117 INFO L87 Difference]: Start difference. First operand 601 states and 912 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,013 INFO L93 Difference]: Finished difference Result 815 states and 1206 transitions. [2022-02-20 19:58:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 936 transitions. [2022-02-20 19:58:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 936 transitions. [2022-02-20 19:58:19,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 936 transitions. [2022-02-20 19:58:19,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:19,632 INFO L225 Difference]: With dead ends: 815 [2022-02-20 19:58:19,633 INFO L226 Difference]: Without dead ends: 638 [2022-02-20 19:58:19,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:19,634 INFO L933 BasicCegarLoop]: 768 mSDtfsCounter, 692 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3415 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:19,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3415 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:58:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-02-20 19:58:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 606. [2022-02-20 19:58:19,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:19,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:19,657 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:19,658 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,676 INFO L93 Difference]: Finished difference Result 638 states and 962 transitions. [2022-02-20 19:58:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 962 transitions. [2022-02-20 19:58:19,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 638 states. [2022-02-20 19:58:19,680 INFO L87 Difference]: Start difference. First operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 638 states. [2022-02-20 19:58:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,698 INFO L93 Difference]: Finished difference Result 638 states and 962 transitions. [2022-02-20 19:58:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 962 transitions. [2022-02-20 19:58:19,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:19,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 916 transitions. [2022-02-20 19:58:19,720 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 916 transitions. Word has length 65 [2022-02-20 19:58:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,721 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 916 transitions. [2022-02-20 19:58:19,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 916 transitions. [2022-02-20 19:58:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:19,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:19,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:19,723 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1117524558, now seen corresponding path program 1 times [2022-02-20 19:58:19,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177279306] [2022-02-20 19:58:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {7423#(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); {7424#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {7424#(not (= |old(~q_req_up~0)| 1))} assume true; {7424#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:19,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7424#(not (= |old(~q_req_up~0)| 1))} {7384#(= ~c_dr_pc~0 ~q_req_up~0)} #2025#return; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {7425#(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); {7381#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume !(0 == ~q_write_ev~0); {7381#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7388#(not (= ~c_dr_pc~0 1))} #2027#return; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#true} havoc ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume !(1 == ~p_dw_pc~0); {7381#true} is VALID [2022-02-20 19:58:19,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} ~__retres1~0 := 0; {7381#true} is VALID [2022-02-20 19:58:19,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {7381#true} #res := ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,827 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7381#true} {7381#true} #2021#return; {7381#true} is VALID [2022-02-20 19:58:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#true} havoc ~__retres1~1; {7381#true} is VALID [2022-02-20 19:58:19,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume 1 == ~c_dr_pc~0; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,857 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} {7381#true} #2023#return; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {7426#(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; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L272 TraceCheckUtils]: 1: Hoare triple {7381#true} call #t~ret8 := is_do_write_p_triggered(); {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} havoc ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {7381#true} assume !(1 == ~p_dw_pc~0); {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {7381#true} ~__retres1~0 := 0; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {7381#true} #res := ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7381#true} {7381#true} #2021#return; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {7381#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7381#true} is VALID [2022-02-20 19:58:19,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {7381#true} assume !(0 != ~tmp~1); {7381#true} is VALID [2022-02-20 19:58:19,858 INFO L272 TraceCheckUtils]: 10: Hoare triple {7381#true} call #t~ret9 := is_do_read_c_triggered(); {7381#true} is VALID [2022-02-20 19:58:19,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {7381#true} havoc ~__retres1~1; {7381#true} is VALID [2022-02-20 19:58:19,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {7381#true} assume 1 == ~c_dr_pc~0; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,860 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} {7381#true} #2023#return; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,861 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} {7388#(not (= ~c_dr_pc~0 1))} #2029#return; {7382#false} is VALID [2022-02-20 19:58:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {7425#(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); {7381#true} is VALID [2022-02-20 19:58:19,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7381#true} is VALID [2022-02-20 19:58:19,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7382#false} #2031#return; {7382#false} is VALID [2022-02-20 19:58:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#true} havoc ~__retres1~2; {7381#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7381#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} #res := ~__retres1~2; {7381#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7381#true} {7382#false} #2033#return; {7382#false} is VALID [2022-02-20 19:58:19,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {7383#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:19,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {7383#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {7383#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:19,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {7383#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {7384#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:19,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {7384#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7384#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:19,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {7384#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {7423#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {7423#(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); {7424#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {7424#(not (= |old(~q_req_up~0)| 1))} assume true; {7424#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:19,872 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7424#(not (= |old(~q_req_up~0)| 1))} {7384#(= ~c_dr_pc~0 ~q_req_up~0)} #2025#return; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {7425#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {7425#(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); {7381#true} is VALID [2022-02-20 19:58:19,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {7381#true} assume !(0 == ~q_write_ev~0); {7381#true} is VALID [2022-02-20 19:58:19,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7381#true} {7388#(not (= ~c_dr_pc~0 1))} #2027#return; {7388#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:19,875 INFO L272 TraceCheckUtils]: 17: Hoare triple {7388#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {7426#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:19,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {7426#(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; {7381#true} is VALID [2022-02-20 19:58:19,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {7381#true} call #t~ret8 := is_do_write_p_triggered(); {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {7381#true} havoc ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {7381#true} assume !(1 == ~p_dw_pc~0); {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {7381#true} ~__retres1~0 := 0; {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {7381#true} #res := ~__retres1~0; {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,876 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7381#true} {7381#true} #2021#return; {7381#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {7381#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7381#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {7381#true} assume !(0 != ~tmp~1); {7381#true} is VALID [2022-02-20 19:58:19,877 INFO L272 TraceCheckUtils]: 28: Hoare triple {7381#true} call #t~ret9 := is_do_read_c_triggered(); {7381#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {7381#true} havoc ~__retres1~1; {7381#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {7381#true} assume 1 == ~c_dr_pc~0; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,879 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} {7381#true} #2023#return; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:19,880 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7439#(= (+ (- 1) ~c_dr_pc~0) 0)} {7388#(not (= ~c_dr_pc~0 1))} #2029#return; {7382#false} is VALID [2022-02-20 19:58:19,880 INFO L272 TraceCheckUtils]: 39: Hoare triple {7382#false} call reset_delta_events1(); {7425#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {7425#(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); {7381#true} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {7381#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7381#true} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,881 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7381#true} {7382#false} #2031#return; {7382#false} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {7382#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; {7382#false} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2022-02-20 19:58:19,882 INFO L272 TraceCheckUtils]: 47: Hoare triple {7382#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7381#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {7381#true} havoc ~__retres1~2; {7381#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {7381#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7381#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {7381#true} #res := ~__retres1~2; {7381#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {7381#true} assume true; {7381#true} is VALID [2022-02-20 19:58:19,882 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7381#true} {7382#false} #2033#return; {7382#false} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {7382#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; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {7382#false} assume 0 != eval1_~tmp___1~0#1; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {7382#false} assume !(0 == ~p_dw_st~0); {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {7382#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; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {7382#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; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {7382#false} assume 0 == ~c_dr_pc~0; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {7382#false} assume !(1 == ~q_free~0); {7382#false} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {7382#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; {7382#false} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {7382#false} assume !(~p_last_write~0 == ~c_last_read~0); {7382#false} is VALID [2022-02-20 19:58:19,884 INFO L272 TraceCheckUtils]: 63: Hoare triple {7382#false} call error1(); {7382#false} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2022-02-20 19:58:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:19,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177279306] [2022-02-20 19:58:19,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177279306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:19,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:19,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:19,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593205328] [2022-02-20 19:58:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:19,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:19,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:19,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:19,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:19,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:19,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:19,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:19,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:19,927 INFO L87 Difference]: Start difference. First operand 606 states and 916 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:25,711 INFO L93 Difference]: Finished difference Result 1506 states and 2135 transitions. [2022-02-20 19:58:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:25,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1455 transitions. [2022-02-20 19:58:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1455 transitions. [2022-02-20 19:58:25,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1455 transitions. [2022-02-20 19:58:26,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1455 edges. 1455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:26,827 INFO L225 Difference]: With dead ends: 1506 [2022-02-20 19:58:26,827 INFO L226 Difference]: Without dead ends: 1312 [2022-02-20 19:58:26,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:26,829 INFO L933 BasicCegarLoop]: 878 mSDtfsCounter, 3815 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3831 SdHoareTripleChecker+Valid, 3187 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:26,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3831 Valid, 3187 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:58:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-02-20 19:58:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1187. [2022-02-20 19:58:26,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:26,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1312 states. Second operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:26,879 INFO L74 IsIncluded]: Start isIncluded. First operand 1312 states. Second operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:26,881 INFO L87 Difference]: Start difference. First operand 1312 states. Second operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:26,934 INFO L93 Difference]: Finished difference Result 1312 states and 1803 transitions. [2022-02-20 19:58:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1803 transitions. [2022-02-20 19:58:26,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:26,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:26,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1312 states. [2022-02-20 19:58:26,941 INFO L87 Difference]: Start difference. First operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1312 states. [2022-02-20 19:58:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:26,994 INFO L93 Difference]: Finished difference Result 1312 states and 1803 transitions. [2022-02-20 19:58:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1803 transitions. [2022-02-20 19:58:26,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:26,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:26,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:26,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 989 states have (on average 1.435793731041456) internal successors, (1420), 1004 states have internal predecessors, (1420), 111 states have call successors, (111), 75 states have call predecessors, (111), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1656 transitions. [2022-02-20 19:58:27,060 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1656 transitions. Word has length 65 [2022-02-20 19:58:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:27,061 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 1656 transitions. [2022-02-20 19:58:27,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1656 transitions. [2022-02-20 19:58:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:27,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:27,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:27,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:27,064 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2125993649, now seen corresponding path program 1 times [2022-02-20 19:58:27,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:27,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903073879] [2022-02-20 19:58:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {13750#(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); {13711#true} is VALID [2022-02-20 19:58:27,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13711#true} {13711#true} #2025#return; {13711#true} is VALID [2022-02-20 19:58:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {13751#(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); {13711#true} is VALID [2022-02-20 19:58:27,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume !(0 == ~q_write_ev~0); {13711#true} is VALID [2022-02-20 19:58:27,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13711#true} {13711#true} #2027#return; {13711#true} is VALID [2022-02-20 19:58:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {13711#true} havoc ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume !(1 == ~p_dw_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} ~__retres1~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {13711#true} #res := ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13711#true} {13711#true} #2021#return; {13711#true} is VALID [2022-02-20 19:58:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {13711#true} havoc ~__retres1~1; {13711#true} is VALID [2022-02-20 19:58:27,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume !(1 == ~c_dr_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} ~__retres1~1 := 0; {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,223 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13711#true} #2023#return; {13765#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {13752#(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; {13711#true} is VALID [2022-02-20 19:58:27,223 INFO L272 TraceCheckUtils]: 1: Hoare triple {13711#true} call #t~ret8 := is_do_write_p_triggered(); {13711#true} is VALID [2022-02-20 19:58:27,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} havoc ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {13711#true} assume !(1 == ~p_dw_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {13711#true} ~__retres1~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {13711#true} #res := ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,227 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13711#true} {13711#true} #2021#return; {13711#true} is VALID [2022-02-20 19:58:27,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {13711#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13711#true} is VALID [2022-02-20 19:58:27,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {13711#true} assume !(0 != ~tmp~1); {13711#true} is VALID [2022-02-20 19:58:27,228 INFO L272 TraceCheckUtils]: 10: Hoare triple {13711#true} call #t~ret9 := is_do_read_c_triggered(); {13711#true} is VALID [2022-02-20 19:58:27,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {13711#true} havoc ~__retres1~1; {13711#true} is VALID [2022-02-20 19:58:27,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {13711#true} assume !(1 == ~c_dr_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {13711#true} ~__retres1~1 := 0; {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13711#true} #2023#return; {13765#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {13765#(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; {13766#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:27,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {13766#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13712#false} is VALID [2022-02-20 19:58:27,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {13712#false} assume true; {13712#false} is VALID [2022-02-20 19:58:27,233 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13712#false} {13711#true} #2029#return; {13712#false} is VALID [2022-02-20 19:58:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {13751#(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); {13711#true} is VALID [2022-02-20 19:58:27,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13711#true} is VALID [2022-02-20 19:58:27,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13711#true} {13712#false} #2031#return; {13712#false} is VALID [2022-02-20 19:58:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {13711#true} havoc ~__retres1~2; {13711#true} is VALID [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13711#true} is VALID [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} #res := ~__retres1~2; {13711#true} is VALID [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,244 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13711#true} {13712#false} #2033#return; {13712#false} is VALID [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {13711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {13711#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {13711#true} is VALID [2022-02-20 19:58:27,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {13711#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {13711#true} is VALID [2022-02-20 19:58:27,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {13711#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13711#true} is VALID [2022-02-20 19:58:27,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {13711#true} call update_channels1(); {13750#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:27,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#(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); {13711#true} is VALID [2022-02-20 19:58:27,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13711#true} {13711#true} #2025#return; {13711#true} is VALID [2022-02-20 19:58:27,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {13711#true} assume { :begin_inline_init_threads1 } true; {13711#true} is VALID [2022-02-20 19:58:27,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {13711#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {13711#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {13711#true} assume { :end_inline_init_threads1 } true; {13711#true} is VALID [2022-02-20 19:58:27,253 INFO L272 TraceCheckUtils]: 12: Hoare triple {13711#true} call fire_delta_events1(); {13751#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {13751#(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); {13711#true} is VALID [2022-02-20 19:58:27,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {13711#true} assume !(0 == ~q_write_ev~0); {13711#true} is VALID [2022-02-20 19:58:27,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,253 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13711#true} {13711#true} #2027#return; {13711#true} is VALID [2022-02-20 19:58:27,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {13711#true} call activate_threads1(); {13752#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:27,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {13752#(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; {13711#true} is VALID [2022-02-20 19:58:27,254 INFO L272 TraceCheckUtils]: 19: Hoare triple {13711#true} call #t~ret8 := is_do_write_p_triggered(); {13711#true} is VALID [2022-02-20 19:58:27,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {13711#true} havoc ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {13711#true} assume !(1 == ~p_dw_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {13711#true} ~__retres1~0 := 0; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {13711#true} #res := ~__retres1~0; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13711#true} {13711#true} #2021#return; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {13711#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {13711#true} assume !(0 != ~tmp~1); {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L272 TraceCheckUtils]: 28: Hoare triple {13711#true} call #t~ret9 := is_do_read_c_triggered(); {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {13711#true} havoc ~__retres1~1; {13711#true} is VALID [2022-02-20 19:58:27,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {13711#true} assume !(1 == ~c_dr_pc~0); {13711#true} is VALID [2022-02-20 19:58:27,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {13711#true} ~__retres1~1 := 0; {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {13767#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,257 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13768#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13711#true} #2023#return; {13765#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {13765#(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; {13766#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:27,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {13766#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13712#false} is VALID [2022-02-20 19:58:27,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {13712#false} assume true; {13712#false} is VALID [2022-02-20 19:58:27,258 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13712#false} {13711#true} #2029#return; {13712#false} is VALID [2022-02-20 19:58:27,258 INFO L272 TraceCheckUtils]: 39: Hoare triple {13712#false} call reset_delta_events1(); {13751#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {13751#(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); {13711#true} is VALID [2022-02-20 19:58:27,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {13711#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13711#true} is VALID [2022-02-20 19:58:27,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,259 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13711#true} {13712#false} #2031#return; {13712#false} is VALID [2022-02-20 19:58:27,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {13712#false} assume !false; {13712#false} is VALID [2022-02-20 19:58:27,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {13712#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; {13712#false} is VALID [2022-02-20 19:58:27,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {13712#false} assume !false; {13712#false} is VALID [2022-02-20 19:58:27,259 INFO L272 TraceCheckUtils]: 47: Hoare triple {13712#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13711#true} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {13711#true} havoc ~__retres1~2; {13711#true} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {13711#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13711#true} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {13711#true} #res := ~__retres1~2; {13711#true} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {13711#true} assume true; {13711#true} is VALID [2022-02-20 19:58:27,260 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13711#true} {13712#false} #2033#return; {13712#false} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {13712#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; {13712#false} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {13712#false} assume 0 != eval1_~tmp___1~0#1; {13712#false} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {13712#false} assume !(0 == ~p_dw_st~0); {13712#false} is VALID [2022-02-20 19:58:27,260 INFO L290 TraceCheckUtils]: 56: Hoare triple {13712#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; {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {13712#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; {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {13712#false} assume 0 == ~c_dr_pc~0; {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {13712#false} assume !false; {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 60: Hoare triple {13712#false} assume !(1 == ~q_free~0); {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {13712#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; {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 62: Hoare triple {13712#false} assume !(~p_last_write~0 == ~c_last_read~0); {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L272 TraceCheckUtils]: 63: Hoare triple {13712#false} call error1(); {13712#false} is VALID [2022-02-20 19:58:27,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {13712#false} assume !false; {13712#false} is VALID [2022-02-20 19:58:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:27,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:27,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903073879] [2022-02-20 19:58:27,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903073879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:27,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:27,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:27,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312293868] [2022-02-20 19:58:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:27,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:27,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:27,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:27,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:27,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:27,297 INFO L87 Difference]: Start difference. First operand 1187 states and 1656 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,077 INFO L93 Difference]: Finished difference Result 2068 states and 2799 transitions. [2022-02-20 19:58:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2022-02-20 19:58:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2022-02-20 19:58:31,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 936 transitions. [2022-02-20 19:58:31,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:31,738 INFO L225 Difference]: With dead ends: 2068 [2022-02-20 19:58:31,738 INFO L226 Difference]: Without dead ends: 1299 [2022-02-20 19:58:31,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:31,743 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 692 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:31,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 3411 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2022-02-20 19:58:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1207. [2022-02-20 19:58:31,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:31,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1299 states. Second operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:31,791 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:31,792 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,845 INFO L93 Difference]: Finished difference Result 1299 states and 1783 transitions. [2022-02-20 19:58:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1783 transitions. [2022-02-20 19:58:31,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1299 states. [2022-02-20 19:58:31,863 INFO L87 Difference]: Start difference. First operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1299 states. [2022-02-20 19:58:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,917 INFO L93 Difference]: Finished difference Result 1299 states and 1783 transitions. [2022-02-20 19:58:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1783 transitions. [2022-02-20 19:58:31,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:31,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1005 states have (on average 1.4238805970149253) internal successors, (1431), 1020 states have internal predecessors, (1431), 111 states have call successors, (111), 75 states have call predecessors, (111), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1671 transitions. [2022-02-20 19:58:31,981 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1671 transitions. Word has length 65 [2022-02-20 19:58:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:31,982 INFO L470 AbstractCegarLoop]: Abstraction has 1207 states and 1671 transitions. [2022-02-20 19:58:31,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1671 transitions. [2022-02-20 19:58:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:31,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:31,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:31,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:31,983 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -739790255, now seen corresponding path program 1 times [2022-02-20 19:58:31,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:31,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540013603] [2022-02-20 19:58:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {20783#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2025#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {20784#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {20784#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2027#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {20743#true} havoc ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {20743#true} assume !(1 == ~p_dw_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {20743#true} ~__retres1~0 := 0; {20743#true} is VALID [2022-02-20 19:58:32,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {20743#true} #res := ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,072 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20743#true} {20743#true} #2021#return; {20743#true} is VALID [2022-02-20 19:58:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {20743#true} havoc ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {20743#true} assume !(1 == ~c_dr_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {20743#true} ~__retres1~1 := 0; {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {20743#true} #res := ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20743#true} {20743#true} #2023#return; {20743#true} is VALID [2022-02-20 19:58:32,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {20785#(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; {20743#true} is VALID [2022-02-20 19:58:32,076 INFO L272 TraceCheckUtils]: 1: Hoare triple {20743#true} call #t~ret8 := is_do_write_p_triggered(); {20743#true} is VALID [2022-02-20 19:58:32,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {20743#true} havoc ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {20743#true} assume !(1 == ~p_dw_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {20743#true} ~__retres1~0 := 0; {20743#true} is VALID [2022-02-20 19:58:32,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {20743#true} #res := ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20743#true} {20743#true} #2021#return; {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {20743#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {20743#true} assume !(0 != ~tmp~1); {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L272 TraceCheckUtils]: 10: Hoare triple {20743#true} call #t~ret9 := is_do_read_c_triggered(); {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {20743#true} havoc ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {20743#true} assume !(1 == ~c_dr_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {20743#true} ~__retres1~1 := 0; {20743#true} is VALID [2022-02-20 19:58:32,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {20743#true} #res := ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,078 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20743#true} {20743#true} #2023#return; {20743#true} is VALID [2022-02-20 19:58:32,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {20743#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20743#true} is VALID [2022-02-20 19:58:32,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {20743#true} assume !(0 != ~tmp___0~1); {20743#true} is VALID [2022-02-20 19:58:32,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,081 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20743#true} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2029#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {20784#(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); {20798#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:32,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#(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; {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2031#return; {20744#false} is VALID [2022-02-20 19:58:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {20743#true} havoc ~__retres1~2; {20743#true} is VALID [2022-02-20 19:58:32,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {20743#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20743#true} is VALID [2022-02-20 19:58:32,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {20743#true} #res := ~__retres1~2; {20743#true} is VALID [2022-02-20 19:58:32,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,103 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20743#true} {20744#false} #2033#return; {20744#false} is VALID [2022-02-20 19:58:32,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {20743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {20743#true} is VALID [2022-02-20 19:58:32,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {20743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {20743#true} is VALID [2022-02-20 19:58:32,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {20743#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {20783#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:32,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {20783#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,106 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2025#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,108 INFO L272 TraceCheckUtils]: 12: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {20784#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {20784#(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); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,109 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2027#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {20785#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:32,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {20785#(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; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L272 TraceCheckUtils]: 19: Hoare triple {20743#true} call #t~ret8 := is_do_write_p_triggered(); {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {20743#true} havoc ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {20743#true} assume !(1 == ~p_dw_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {20743#true} ~__retres1~0 := 0; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {20743#true} #res := ~__retres1~0; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20743#true} {20743#true} #2021#return; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {20743#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20743#true} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {20743#true} assume !(0 != ~tmp~1); {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L272 TraceCheckUtils]: 28: Hoare triple {20743#true} call #t~ret9 := is_do_read_c_triggered(); {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {20743#true} havoc ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {20743#true} assume !(1 == ~c_dr_pc~0); {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {20743#true} ~__retres1~1 := 0; {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {20743#true} #res := ~__retres1~1; {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20743#true} {20743#true} #2023#return; {20743#true} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {20743#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20743#true} is VALID [2022-02-20 19:58:32,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {20743#true} assume !(0 != ~tmp___0~1); {20743#true} is VALID [2022-02-20 19:58:32,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,112 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20743#true} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2029#return; {20745#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,112 INFO L272 TraceCheckUtils]: 39: Hoare triple {20745#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {20784#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {20784#(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); {20798#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {20798#(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; {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,114 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {20799#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20745#(= ~q_write_ev~0 ~q_read_ev~0)} #2031#return; {20744#false} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {20744#false} assume !false; {20744#false} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {20744#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; {20744#false} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {20744#false} assume !false; {20744#false} is VALID [2022-02-20 19:58:32,114 INFO L272 TraceCheckUtils]: 47: Hoare triple {20744#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20743#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {20743#true} havoc ~__retres1~2; {20743#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {20743#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20743#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {20743#true} #res := ~__retres1~2; {20743#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {20743#true} assume true; {20743#true} is VALID [2022-02-20 19:58:32,115 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20743#true} {20744#false} #2033#return; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {20744#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; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {20744#false} assume 0 != eval1_~tmp___1~0#1; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {20744#false} assume !(0 == ~p_dw_st~0); {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {20744#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; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {20744#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; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {20744#false} assume 0 == ~c_dr_pc~0; {20744#false} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {20744#false} assume !false; {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {20744#false} assume !(1 == ~q_free~0); {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {20744#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; {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {20744#false} assume !(~p_last_write~0 == ~c_last_read~0); {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L272 TraceCheckUtils]: 63: Hoare triple {20744#false} call error1(); {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {20744#false} assume !false; {20744#false} is VALID [2022-02-20 19:58:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:32,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:32,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540013603] [2022-02-20 19:58:32,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540013603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:32,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:32,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:32,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669166426] [2022-02-20 19:58:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:32,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:32,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:32,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:32,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:32,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:32,151 INFO L87 Difference]: Start difference. First operand 1207 states and 1671 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,808 INFO L93 Difference]: Finished difference Result 2775 states and 3618 transitions. [2022-02-20 19:58:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1102 transitions. [2022-02-20 19:58:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1102 transitions. [2022-02-20 19:58:35,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1102 transitions. [2022-02-20 19:58:36,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1102 edges. 1102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,724 INFO L225 Difference]: With dead ends: 2775 [2022-02-20 19:58:36,725 INFO L226 Difference]: Without dead ends: 1987 [2022-02-20 19:58:36,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:36,727 INFO L933 BasicCegarLoop]: 775 mSDtfsCounter, 1531 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:36,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 2635 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-02-20 19:58:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1655. [2022-02-20 19:58:36,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:36,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1987 states. Second operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:36,828 INFO L74 IsIncluded]: Start isIncluded. First operand 1987 states. Second operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:36,830 INFO L87 Difference]: Start difference. First operand 1987 states. Second operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,946 INFO L93 Difference]: Finished difference Result 1987 states and 2595 transitions. [2022-02-20 19:58:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2595 transitions. [2022-02-20 19:58:36,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1987 states. [2022-02-20 19:58:36,954 INFO L87 Difference]: Start difference. First operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1987 states. [2022-02-20 19:58:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,080 INFO L93 Difference]: Finished difference Result 1987 states and 2595 transitions. [2022-02-20 19:58:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2595 transitions. [2022-02-20 19:58:37,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:37,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:37,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:37,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1358 states have (on average 1.3843888070692194) internal successors, (1880), 1382 states have internal predecessors, (1880), 157 states have call successors, (157), 114 states have call predecessors, (157), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2238 transitions. [2022-02-20 19:58:37,212 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2238 transitions. Word has length 65 [2022-02-20 19:58:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:37,213 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2238 transitions. [2022-02-20 19:58:37,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2238 transitions. [2022-02-20 19:58:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:37,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:37,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:37,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:37,214 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -873803761, now seen corresponding path program 1 times [2022-02-20 19:58:37,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:37,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108763138] [2022-02-20 19:58:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {30726#(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); {30686#true} is VALID [2022-02-20 19:58:37,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30686#true} {30686#true} #2025#return; {30686#true} is VALID [2022-02-20 19:58:37,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {30727#(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); {30686#true} is VALID [2022-02-20 19:58:37,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume !(0 == ~q_write_ev~0); {30686#true} is VALID [2022-02-20 19:58:37,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30686#true} {30691#(= ~p_dw_st~0 0)} #2027#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {30686#true} havoc ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume !(1 == ~p_dw_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} ~__retres1~0 := 0; {30686#true} is VALID [2022-02-20 19:58:37,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {30686#true} #res := ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,280 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2021#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {30686#true} havoc ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume !(1 == ~c_dr_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} ~__retres1~1 := 0; {30686#true} is VALID [2022-02-20 19:58:37,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {30686#true} #res := ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,284 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2023#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {30728#(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; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,284 INFO L272 TraceCheckUtils]: 1: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30686#true} is VALID [2022-02-20 19:58:37,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} havoc ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {30686#true} assume !(1 == ~p_dw_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {30686#true} ~__retres1~0 := 0; {30686#true} is VALID [2022-02-20 19:58:37,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {30686#true} #res := ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,285 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2021#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,286 INFO L272 TraceCheckUtils]: 10: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30686#true} is VALID [2022-02-20 19:58:37,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {30686#true} havoc ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {30686#true} assume !(1 == ~c_dr_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {30686#true} ~__retres1~1 := 0; {30686#true} is VALID [2022-02-20 19:58:37,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {30686#true} #res := ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,287 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2023#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,288 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30691#(= ~p_dw_st~0 0)} #2029#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {30727#(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); {30686#true} is VALID [2022-02-20 19:58:37,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume !(1 == ~q_write_ev~0); {30686#true} is VALID [2022-02-20 19:58:37,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30686#true} {30691#(= ~p_dw_st~0 0)} #2031#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {30686#true} havoc ~__retres1~2; {30686#true} is VALID [2022-02-20 19:58:37,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {30691#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {30691#(= ~p_dw_st~0 0)} assume true; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,300 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30691#(= ~p_dw_st~0 0)} {30691#(= ~p_dw_st~0 0)} #2033#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {30686#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {30686#true} is VALID [2022-02-20 19:58:37,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {30686#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {30686#true} is VALID [2022-02-20 19:58:37,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {30686#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {30686#true} is VALID [2022-02-20 19:58:37,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {30686#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {30686#true} is VALID [2022-02-20 19:58:37,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {30686#true} call update_channels1(); {30726#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:37,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {30726#(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); {30686#true} is VALID [2022-02-20 19:58:37,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,301 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30686#true} {30686#true} #2025#return; {30686#true} is VALID [2022-02-20 19:58:37,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {30686#true} assume { :begin_inline_init_threads1 } true; {30686#true} is VALID [2022-02-20 19:58:37,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {30686#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {30691#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {30691#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {30691#(= ~p_dw_st~0 0)} call fire_delta_events1(); {30727#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:37,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {30727#(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); {30686#true} is VALID [2022-02-20 19:58:37,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {30686#true} assume !(0 == ~q_write_ev~0); {30686#true} is VALID [2022-02-20 19:58:37,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30686#true} {30691#(= ~p_dw_st~0 0)} #2027#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,303 INFO L272 TraceCheckUtils]: 17: Hoare triple {30691#(= ~p_dw_st~0 0)} call activate_threads1(); {30728#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {30728#(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; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30686#true} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {30686#true} havoc ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {30686#true} assume !(1 == ~p_dw_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {30686#true} ~__retres1~0 := 0; {30686#true} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {30686#true} #res := ~__retres1~0; {30686#true} is VALID [2022-02-20 19:58:37,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,304 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2021#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30686#true} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {30686#true} havoc ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {30686#true} assume !(1 == ~c_dr_pc~0); {30686#true} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {30686#true} ~__retres1~1 := 0; {30686#true} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {30686#true} #res := ~__retres1~1; {30686#true} is VALID [2022-02-20 19:58:37,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,306 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30686#true} {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #2023#return; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:37,309 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30729#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30691#(= ~p_dw_st~0 0)} #2029#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,309 INFO L272 TraceCheckUtils]: 39: Hoare triple {30691#(= ~p_dw_st~0 0)} call reset_delta_events1(); {30727#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:37,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {30727#(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); {30686#true} is VALID [2022-02-20 19:58:37,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {30686#true} assume !(1 == ~q_write_ev~0); {30686#true} is VALID [2022-02-20 19:58:37,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {30686#true} assume true; {30686#true} is VALID [2022-02-20 19:58:37,310 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30686#true} {30691#(= ~p_dw_st~0 0)} #2031#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {30691#(= ~p_dw_st~0 0)} assume !false; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {30691#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {30691#(= ~p_dw_st~0 0)} assume !false; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,311 INFO L272 TraceCheckUtils]: 47: Hoare triple {30691#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30686#true} is VALID [2022-02-20 19:58:37,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {30686#true} havoc ~__retres1~2; {30686#true} is VALID [2022-02-20 19:58:37,312 INFO L290 TraceCheckUtils]: 49: Hoare triple {30686#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {30691#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {30691#(= ~p_dw_st~0 0)} assume true; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,312 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30691#(= ~p_dw_st~0 0)} {30691#(= ~p_dw_st~0 0)} #2033#return; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {30691#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {30691#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {30691#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:37,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {30691#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {30687#false} is VALID [2022-02-20 19:58:37,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {30687#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; {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {30687#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; {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {30687#false} assume 0 == ~c_dr_pc~0; {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {30687#false} assume !false; {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {30687#false} assume !(1 == ~q_free~0); {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {30687#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; {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {30687#false} assume !(~p_last_write~0 == ~c_last_read~0); {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L272 TraceCheckUtils]: 63: Hoare triple {30687#false} call error1(); {30687#false} is VALID [2022-02-20 19:58:37,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {30687#false} assume !false; {30687#false} is VALID [2022-02-20 19:58:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:37,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:37,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108763138] [2022-02-20 19:58:37,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108763138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:37,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:37,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:37,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773943523] [2022-02-20 19:58:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:37,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:37,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:37,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:37,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:37,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:37,355 INFO L87 Difference]: Start difference. First operand 1655 states and 2238 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:40,151 INFO L93 Difference]: Finished difference Result 4133 states and 5392 transitions. [2022-02-20 19:58:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1057 transitions. [2022-02-20 19:58:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1057 transitions. [2022-02-20 19:58:40,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1057 transitions. [2022-02-20 19:58:40,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1057 edges. 1057 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:41,196 INFO L225 Difference]: With dead ends: 4133 [2022-02-20 19:58:41,197 INFO L226 Difference]: Without dead ends: 2899 [2022-02-20 19:58:41,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:41,199 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 1494 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:41,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 2207 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2022-02-20 19:58:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2791. [2022-02-20 19:58:41,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:41,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2899 states. Second operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:41,350 INFO L74 IsIncluded]: Start isIncluded. First operand 2899 states. Second operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:41,354 INFO L87 Difference]: Start difference. First operand 2899 states. Second operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,589 INFO L93 Difference]: Finished difference Result 2899 states and 3759 transitions. [2022-02-20 19:58:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3759 transitions. [2022-02-20 19:58:41,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2899 states. [2022-02-20 19:58:41,601 INFO L87 Difference]: Start difference. First operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2899 states. [2022-02-20 19:58:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,829 INFO L93 Difference]: Finished difference Result 2899 states and 3759 transitions. [2022-02-20 19:58:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3759 transitions. [2022-02-20 19:58:41,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:41,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2229 states have (on average 1.316733961417676) internal successors, (2935), 2275 states have internal predecessors, (2935), 286 states have call successors, (286), 220 states have call predecessors, (286), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3636 transitions. [2022-02-20 19:58:42,174 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3636 transitions. Word has length 65 [2022-02-20 19:58:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:42,174 INFO L470 AbstractCegarLoop]: Abstraction has 2791 states and 3636 transitions. [2022-02-20 19:58:42,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3636 transitions. [2022-02-20 19:58:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:42,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:42,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:42,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:42,176 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash -635681848, now seen corresponding path program 1 times [2022-02-20 19:58:42,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:42,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323309262] [2022-02-20 19:58:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {45879#(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); {45839#true} is VALID [2022-02-20 19:58:42,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2025#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {45880#(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); {45839#true} is VALID [2022-02-20 19:58:42,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume !(0 == ~q_write_ev~0); {45839#true} is VALID [2022-02-20 19:58:42,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2027#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {45839#true} havoc ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume !(1 == ~p_dw_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} ~__retres1~0 := 0; {45839#true} is VALID [2022-02-20 19:58:42,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {45839#true} #res := ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,226 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45839#true} {45839#true} #2021#return; {45839#true} is VALID [2022-02-20 19:58:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {45839#true} havoc ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume !(1 == ~c_dr_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} ~__retres1~1 := 0; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {45839#true} #res := ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45839#true} {45839#true} #2023#return; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {45881#(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; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L272 TraceCheckUtils]: 1: Hoare triple {45839#true} call #t~ret8 := is_do_write_p_triggered(); {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} havoc ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {45839#true} assume !(1 == ~p_dw_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {45839#true} ~__retres1~0 := 0; {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {45839#true} #res := ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45839#true} {45839#true} #2021#return; {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {45839#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {45839#true} assume !(0 != ~tmp~1); {45839#true} is VALID [2022-02-20 19:58:42,253 INFO L272 TraceCheckUtils]: 10: Hoare triple {45839#true} call #t~ret9 := is_do_read_c_triggered(); {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {45839#true} havoc ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {45839#true} assume !(1 == ~c_dr_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {45839#true} ~__retres1~1 := 0; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {45839#true} #res := ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45839#true} {45839#true} #2023#return; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {45839#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {45839#true} assume !(0 != ~tmp___0~1); {45839#true} is VALID [2022-02-20 19:58:42,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,255 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2029#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {45880#(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); {45839#true} is VALID [2022-02-20 19:58:42,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume !(1 == ~q_write_ev~0); {45839#true} is VALID [2022-02-20 19:58:42,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2031#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {45839#true} havoc ~__retres1~2; {45839#true} is VALID [2022-02-20 19:58:42,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45839#true} is VALID [2022-02-20 19:58:42,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} #res := ~__retres1~2; {45839#true} is VALID [2022-02-20 19:58:42,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,263 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2033#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {45839#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {45839#true} is VALID [2022-02-20 19:58:42,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {45839#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {45839#true} is VALID [2022-02-20 19:58:42,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {45839#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {45841#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {45841#(= ~q_free~0 1)} call update_channels1(); {45879#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:42,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {45879#(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); {45839#true} is VALID [2022-02-20 19:58:42,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,265 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2025#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {45841#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {45841#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {45841#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {45841#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,266 INFO L272 TraceCheckUtils]: 12: Hoare triple {45841#(= ~q_free~0 1)} call fire_delta_events1(); {45880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:42,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {45880#(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); {45839#true} is VALID [2022-02-20 19:58:42,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {45839#true} assume !(0 == ~q_write_ev~0); {45839#true} is VALID [2022-02-20 19:58:42,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,267 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2027#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {45841#(= ~q_free~0 1)} call activate_threads1(); {45881#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:42,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {45881#(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; {45839#true} is VALID [2022-02-20 19:58:42,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {45839#true} call #t~ret8 := is_do_write_p_triggered(); {45839#true} is VALID [2022-02-20 19:58:42,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {45839#true} havoc ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {45839#true} assume !(1 == ~p_dw_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {45839#true} ~__retres1~0 := 0; {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {45839#true} #res := ~__retres1~0; {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45839#true} {45839#true} #2021#return; {45839#true} is VALID [2022-02-20 19:58:42,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {45839#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {45839#true} assume !(0 != ~tmp~1); {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L272 TraceCheckUtils]: 28: Hoare triple {45839#true} call #t~ret9 := is_do_read_c_triggered(); {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {45839#true} havoc ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {45839#true} assume !(1 == ~c_dr_pc~0); {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {45839#true} ~__retres1~1 := 0; {45839#true} is VALID [2022-02-20 19:58:42,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {45839#true} #res := ~__retres1~1; {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45839#true} {45839#true} #2023#return; {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {45839#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {45839#true} assume !(0 != ~tmp___0~1); {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2029#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,271 INFO L272 TraceCheckUtils]: 39: Hoare triple {45841#(= ~q_free~0 1)} call reset_delta_events1(); {45880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:42,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {45880#(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); {45839#true} is VALID [2022-02-20 19:58:42,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {45839#true} assume !(1 == ~q_write_ev~0); {45839#true} is VALID [2022-02-20 19:58:42,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,271 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2031#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {45841#(= ~q_free~0 1)} assume !false; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {45841#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {45841#(= ~q_free~0 1)} assume !false; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,272 INFO L272 TraceCheckUtils]: 47: Hoare triple {45841#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45839#true} is VALID [2022-02-20 19:58:42,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {45839#true} havoc ~__retres1~2; {45839#true} is VALID [2022-02-20 19:58:42,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {45839#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45839#true} is VALID [2022-02-20 19:58:42,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {45839#true} #res := ~__retres1~2; {45839#true} is VALID [2022-02-20 19:58:42,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {45839#true} assume true; {45839#true} is VALID [2022-02-20 19:58:42,273 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45839#true} {45841#(= ~q_free~0 1)} #2033#return; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {45841#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {45841#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {45841#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {45841#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {45841#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {45841#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {45841#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {45841#(= ~q_free~0 1)} assume !false; {45841#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:42,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {45841#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45840#false} is VALID [2022-02-20 19:58:42,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {45840#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; {45840#false} is VALID [2022-02-20 19:58:42,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {45840#false} assume !(~p_last_write~0 == ~c_last_read~0); {45840#false} is VALID [2022-02-20 19:58:42,282 INFO L272 TraceCheckUtils]: 64: Hoare triple {45840#false} call error1(); {45840#false} is VALID [2022-02-20 19:58:42,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {45840#false} assume !false; {45840#false} is VALID [2022-02-20 19:58:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:42,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:42,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323309262] [2022-02-20 19:58:42,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323309262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:42,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:42,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:42,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911876271] [2022-02-20 19:58:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:42,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:42,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:42,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:42,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:42,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:42,316 INFO L87 Difference]: Start difference. First operand 2791 states and 3636 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:45,918 INFO L93 Difference]: Finished difference Result 6243 states and 7968 transitions. [2022-02-20 19:58:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1045 transitions. [2022-02-20 19:58:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1045 transitions. [2022-02-20 19:58:45,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1045 transitions. [2022-02-20 19:58:46,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1045 edges. 1045 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:47,185 INFO L225 Difference]: With dead ends: 6243 [2022-02-20 19:58:47,185 INFO L226 Difference]: Without dead ends: 3880 [2022-02-20 19:58:47,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:47,189 INFO L933 BasicCegarLoop]: 772 mSDtfsCounter, 1247 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:47,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1256 Valid, 1848 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2022-02-20 19:58:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3624. [2022-02-20 19:58:47,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:47,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3880 states. Second operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:47,392 INFO L74 IsIncluded]: Start isIncluded. First operand 3880 states. Second operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:47,396 INFO L87 Difference]: Start difference. First operand 3880 states. Second operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,829 INFO L93 Difference]: Finished difference Result 3880 states and 4941 transitions. [2022-02-20 19:58:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 4941 transitions. [2022-02-20 19:58:47,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:47,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:47,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3880 states. [2022-02-20 19:58:47,843 INFO L87 Difference]: Start difference. First operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3880 states. [2022-02-20 19:58:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,283 INFO L93 Difference]: Finished difference Result 3880 states and 4941 transitions. [2022-02-20 19:58:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 4941 transitions. [2022-02-20 19:58:48,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 2874 states have (on average 1.2964509394572026) internal successors, (3726), 2927 states have internal predecessors, (3726), 378 states have call successors, (378), 300 states have call predecessors, (378), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4637 transitions. [2022-02-20 19:58:48,862 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4637 transitions. Word has length 66 [2022-02-20 19:58:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,863 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 4637 transitions. [2022-02-20 19:58:48,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4637 transitions. [2022-02-20 19:58:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:48,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:48,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:48,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2082238937, now seen corresponding path program 1 times [2022-02-20 19:58:48,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836218633] [2022-02-20 19:58:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {66930#(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); {66890#true} is VALID [2022-02-20 19:58:48,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2025#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {66931#(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); {66890#true} is VALID [2022-02-20 19:58:48,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume !(0 == ~q_write_ev~0); {66890#true} is VALID [2022-02-20 19:58:48,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2027#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {66890#true} havoc ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume !(1 == ~p_dw_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} ~__retres1~0 := 0; {66890#true} is VALID [2022-02-20 19:58:48,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {66890#true} #res := ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,934 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66890#true} {66890#true} #2021#return; {66890#true} is VALID [2022-02-20 19:58:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {66890#true} havoc ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume !(1 == ~c_dr_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} ~__retres1~1 := 0; {66890#true} is VALID [2022-02-20 19:58:48,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {66890#true} #res := ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66890#true} {66890#true} #2023#return; {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {66932#(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; {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L272 TraceCheckUtils]: 1: Hoare triple {66890#true} call #t~ret8 := is_do_write_p_triggered(); {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} havoc ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {66890#true} assume !(1 == ~p_dw_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {66890#true} ~__retres1~0 := 0; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {66890#true} #res := ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66890#true} {66890#true} #2021#return; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {66890#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {66890#true} assume !(0 != ~tmp~1); {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {66890#true} call #t~ret9 := is_do_read_c_triggered(); {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {66890#true} havoc ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {66890#true} assume !(1 == ~c_dr_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {66890#true} ~__retres1~1 := 0; {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {66890#true} #res := ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66890#true} {66890#true} #2023#return; {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {66890#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {66890#true} assume !(0 != ~tmp___0~1); {66890#true} is VALID [2022-02-20 19:58:48,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,944 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2029#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {66931#(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); {66890#true} is VALID [2022-02-20 19:58:48,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume !(1 == ~q_write_ev~0); {66890#true} is VALID [2022-02-20 19:58:48,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2031#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {66890#true} havoc ~__retres1~2; {66890#true} is VALID [2022-02-20 19:58:48,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66890#true} is VALID [2022-02-20 19:58:48,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} #res := ~__retres1~2; {66890#true} is VALID [2022-02-20 19:58:48,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,962 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2033#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {66890#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {66890#true} is VALID [2022-02-20 19:58:48,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {66890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {66890#true} is VALID [2022-02-20 19:58:48,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {66890#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {66892#(= ~p_dw_pc~0 0)} call update_channels1(); {66930#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:48,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {66930#(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); {66890#true} is VALID [2022-02-20 19:58:48,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,964 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2025#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,966 INFO L272 TraceCheckUtils]: 12: Hoare triple {66892#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {66931#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {66931#(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); {66890#true} is VALID [2022-02-20 19:58:48,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {66890#true} assume !(0 == ~q_write_ev~0); {66890#true} is VALID [2022-02-20 19:58:48,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,967 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2027#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,967 INFO L272 TraceCheckUtils]: 17: Hoare triple {66892#(= ~p_dw_pc~0 0)} call activate_threads1(); {66932#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:48,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {66932#(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; {66890#true} is VALID [2022-02-20 19:58:48,967 INFO L272 TraceCheckUtils]: 19: Hoare triple {66890#true} call #t~ret8 := is_do_write_p_triggered(); {66890#true} is VALID [2022-02-20 19:58:48,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {66890#true} havoc ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {66890#true} assume !(1 == ~p_dw_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {66890#true} ~__retres1~0 := 0; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {66890#true} #res := ~__retres1~0; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {66890#true} {66890#true} #2021#return; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {66890#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {66890#true} assume !(0 != ~tmp~1); {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L272 TraceCheckUtils]: 28: Hoare triple {66890#true} call #t~ret9 := is_do_read_c_triggered(); {66890#true} is VALID [2022-02-20 19:58:48,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {66890#true} havoc ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {66890#true} assume !(1 == ~c_dr_pc~0); {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {66890#true} ~__retres1~1 := 0; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {66890#true} #res := ~__retres1~1; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {66890#true} {66890#true} #2023#return; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {66890#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {66890#true} assume !(0 != ~tmp___0~1); {66890#true} is VALID [2022-02-20 19:58:48,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,970 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2029#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,970 INFO L272 TraceCheckUtils]: 39: Hoare triple {66892#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {66931#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {66931#(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); {66890#true} is VALID [2022-02-20 19:58:48,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {66890#true} assume !(1 == ~q_write_ev~0); {66890#true} is VALID [2022-02-20 19:58:48,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,971 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2031#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume !false; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {66892#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume !false; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,972 INFO L272 TraceCheckUtils]: 47: Hoare triple {66892#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66890#true} is VALID [2022-02-20 19:58:48,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {66890#true} havoc ~__retres1~2; {66890#true} is VALID [2022-02-20 19:58:48,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {66890#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66890#true} is VALID [2022-02-20 19:58:48,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {66890#true} #res := ~__retres1~2; {66890#true} is VALID [2022-02-20 19:58:48,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {66890#true} assume true; {66890#true} is VALID [2022-02-20 19:58:48,973 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {66890#true} {66892#(= ~p_dw_pc~0 0)} #2033#return; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {66892#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {66892#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {66891#false} is VALID [2022-02-20 19:58:48,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {66891#false} assume 1 == ~p_dw_pc~0; {66891#false} is VALID [2022-02-20 19:58:48,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {66891#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; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {66891#false} assume !false; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {66891#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {66891#false} assume { :end_inline_do_write_p } true; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {66891#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; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {66891#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; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {66891#false} assume 0 == ~c_dr_pc~0; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {66891#false} assume !false; {66891#false} is VALID [2022-02-20 19:58:48,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {66891#false} assume !(1 == ~q_free~0); {66891#false} is VALID [2022-02-20 19:58:48,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {66891#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; {66891#false} is VALID [2022-02-20 19:58:48,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {66891#false} assume !(~p_last_write~0 == ~c_last_read~0); {66891#false} is VALID [2022-02-20 19:58:48,976 INFO L272 TraceCheckUtils]: 70: Hoare triple {66891#false} call error1(); {66891#false} is VALID [2022-02-20 19:58:48,976 INFO L290 TraceCheckUtils]: 71: Hoare triple {66891#false} assume !false; {66891#false} is VALID [2022-02-20 19:58:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:48,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:48,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836218633] [2022-02-20 19:58:48,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836218633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:48,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:48,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:48,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263564802] [2022-02-20 19:58:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:48,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:48,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:49,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:49,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:49,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:49,021 INFO L87 Difference]: Start difference. First operand 3624 states and 4637 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,290 INFO L93 Difference]: Finished difference Result 7635 states and 9611 transitions. [2022-02-20 19:58:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1042 transitions. [2022-02-20 19:58:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1042 transitions. [2022-02-20 19:58:53,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1042 transitions. [2022-02-20 19:58:53,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1042 edges. 1042 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:54,792 INFO L225 Difference]: With dead ends: 7635 [2022-02-20 19:58:54,793 INFO L226 Difference]: Without dead ends: 4435 [2022-02-20 19:58:54,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:54,797 INFO L933 BasicCegarLoop]: 787 mSDtfsCounter, 1467 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:54,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1923 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2022-02-20 19:58:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4187. [2022-02-20 19:58:55,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:55,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4435 states. Second operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:58:55,021 INFO L74 IsIncluded]: Start isIncluded. First operand 4435 states. Second operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:58:55,026 INFO L87 Difference]: Start difference. First operand 4435 states. Second operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:58:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,592 INFO L93 Difference]: Finished difference Result 4435 states and 5608 transitions. [2022-02-20 19:58:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 5608 transitions. [2022-02-20 19:58:55,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4435 states. [2022-02-20 19:58:55,607 INFO L87 Difference]: Start difference. First operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4435 states. [2022-02-20 19:58:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,186 INFO L93 Difference]: Finished difference Result 4435 states and 5608 transitions. [2022-02-20 19:58:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 5608 transitions. [2022-02-20 19:58:56,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:56,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 3321 states have (on average 1.2866606443842217) internal successors, (4273), 3380 states have internal predecessors, (4273), 434 states have call successors, (434), 350 states have call predecessors, (434), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:58:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 5317 transitions. [2022-02-20 19:58:56,924 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 5317 transitions. Word has length 72 [2022-02-20 19:58:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,925 INFO L470 AbstractCegarLoop]: Abstraction has 4187 states and 5317 transitions. [2022-02-20 19:58:56,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 5317 transitions. [2022-02-20 19:58:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:56,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,926 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:56,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:56,926 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -641928531, now seen corresponding path program 1 times [2022-02-20 19:58:56,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621104228] [2022-02-20 19:58:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {91732#(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); {91691#true} is VALID [2022-02-20 19:58:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:56,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91691#true} {91691#true} #2025#return; {91691#true} is VALID [2022-02-20 19:58:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {91733#(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); {91691#true} is VALID [2022-02-20 19:58:56,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume !(0 == ~q_write_ev~0); {91691#true} is VALID [2022-02-20 19:58:56,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:56,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91691#true} {91691#true} #2027#return; {91691#true} is VALID [2022-02-20 19:58:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {91691#true} havoc ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume !(1 == ~p_dw_pc~0); {91691#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} ~__retres1~0 := 0; {91691#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {91691#true} #res := ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:56,996 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91691#true} {91691#true} #2021#return; {91691#true} is VALID [2022-02-20 19:58:56,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {91691#true} havoc ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume !(1 == ~c_dr_pc~0); {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} ~__retres1~1 := 0; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {91691#true} #res := ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91691#true} {91691#true} #2023#return; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {91734#(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; {91691#true} is VALID [2022-02-20 19:58:57,004 INFO L272 TraceCheckUtils]: 1: Hoare triple {91691#true} call #t~ret8 := is_do_write_p_triggered(); {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} havoc ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {91691#true} assume !(1 == ~p_dw_pc~0); {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {91691#true} ~__retres1~0 := 0; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {91691#true} #res := ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91691#true} {91691#true} #2021#return; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {91691#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91691#true} is VALID [2022-02-20 19:58:57,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {91691#true} assume !(0 != ~tmp~1); {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L272 TraceCheckUtils]: 10: Hoare triple {91691#true} call #t~ret9 := is_do_read_c_triggered(); {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {91691#true} havoc ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {91691#true} assume !(1 == ~c_dr_pc~0); {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {91691#true} ~__retres1~1 := 0; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {91691#true} #res := ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91691#true} {91691#true} #2023#return; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {91691#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91691#true} is VALID [2022-02-20 19:58:57,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {91691#true} assume !(0 != ~tmp___0~1); {91691#true} is VALID [2022-02-20 19:58:57,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,007 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {91691#true} {91691#true} #2029#return; {91691#true} is VALID [2022-02-20 19:58:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {91733#(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); {91691#true} is VALID [2022-02-20 19:58:57,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume !(1 == ~q_write_ev~0); {91691#true} is VALID [2022-02-20 19:58:57,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91691#true} {91691#true} #2031#return; {91691#true} is VALID [2022-02-20 19:58:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {91691#true} havoc ~__retres1~2; {91691#true} is VALID [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91691#true} is VALID [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} #res := ~__retres1~2; {91691#true} is VALID [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,013 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91691#true} {91691#true} #2033#return; {91691#true} is VALID [2022-02-20 19:58:57,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {91691#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {91691#true} is VALID [2022-02-20 19:58:57,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {91691#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {91691#true} is VALID [2022-02-20 19:58:57,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {91691#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {91691#true} is VALID [2022-02-20 19:58:57,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {91691#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {91691#true} call update_channels1(); {91732#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {91732#(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); {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91691#true} {91691#true} #2025#return; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {91691#true} assume { :begin_inline_init_threads1 } true; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {91691#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {91691#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {91691#true} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {91691#true} assume { :end_inline_init_threads1 } true; {91691#true} is VALID [2022-02-20 19:58:57,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {91691#true} call fire_delta_events1(); {91733#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {91733#(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); {91691#true} is VALID [2022-02-20 19:58:57,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {91691#true} assume !(0 == ~q_write_ev~0); {91691#true} is VALID [2022-02-20 19:58:57,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91691#true} {91691#true} #2027#return; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {91691#true} call activate_threads1(); {91734#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {91734#(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; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {91691#true} call #t~ret8 := is_do_write_p_triggered(); {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {91691#true} havoc ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {91691#true} assume !(1 == ~p_dw_pc~0); {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {91691#true} ~__retres1~0 := 0; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {91691#true} #res := ~__retres1~0; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,016 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {91691#true} {91691#true} #2021#return; {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {91691#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {91691#true} assume !(0 != ~tmp~1); {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L272 TraceCheckUtils]: 28: Hoare triple {91691#true} call #t~ret9 := is_do_read_c_triggered(); {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {91691#true} havoc ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {91691#true} assume !(1 == ~c_dr_pc~0); {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {91691#true} ~__retres1~1 := 0; {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {91691#true} #res := ~__retres1~1; {91691#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {91691#true} {91691#true} #2023#return; {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {91691#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {91691#true} assume !(0 != ~tmp___0~1); {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {91691#true} {91691#true} #2029#return; {91691#true} is VALID [2022-02-20 19:58:57,018 INFO L272 TraceCheckUtils]: 39: Hoare triple {91691#true} call reset_delta_events1(); {91733#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {91733#(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); {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {91691#true} assume !(1 == ~q_write_ev~0); {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {91691#true} {91691#true} #2031#return; {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {91691#true} assume !false; {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {91691#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; {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {91691#true} assume !false; {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L272 TraceCheckUtils]: 47: Hoare triple {91691#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {91691#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {91691#true} havoc ~__retres1~2; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {91691#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {91691#true} #res := ~__retres1~2; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {91691#true} assume true; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {91691#true} {91691#true} #2033#return; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {91691#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; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {91691#true} assume 0 != eval1_~tmp___1~0#1; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {91691#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; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {91691#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; {91691#true} is VALID [2022-02-20 19:58:57,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {91691#true} assume 0 == ~p_dw_pc~0; {91691#true} is VALID [2022-02-20 19:58:57,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {91691#true} assume !false; {91691#true} is VALID [2022-02-20 19:58:57,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {91691#true} assume !(0 == ~q_free~0); {91691#true} is VALID [2022-02-20 19:58:57,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {91691#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,023 INFO L290 TraceCheckUtils]: 66: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {91730#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {91730#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {91731#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {91731#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {91692#false} is VALID [2022-02-20 19:58:57,024 INFO L272 TraceCheckUtils]: 71: Hoare triple {91692#false} call error1(); {91692#false} is VALID [2022-02-20 19:58:57,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {91692#false} assume !false; {91692#false} is VALID [2022-02-20 19:58:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:57,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:57,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621104228] [2022-02-20 19:58:57,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621104228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:57,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:57,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:57,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652097784] [2022-02-20 19:58:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:57,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:57,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:57,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:57,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:57,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:57,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:57,069 INFO L87 Difference]: Start difference. First operand 4187 states and 5317 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,585 INFO L93 Difference]: Finished difference Result 5256 states and 6601 transitions. [2022-02-20 19:59:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:59:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 925 transitions. [2022-02-20 19:59:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 925 transitions. [2022-02-20 19:59:00,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 925 transitions. [2022-02-20 19:59:01,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 925 edges. 925 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:02,254 INFO L225 Difference]: With dead ends: 5256 [2022-02-20 19:59:02,254 INFO L226 Difference]: Without dead ends: 5253 [2022-02-20 19:59:02,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:59:02,256 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 2206 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:02,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2216 Valid, 1899 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2022-02-20 19:59:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4944. [2022-02-20 19:59:02,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:02,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5253 states. Second operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:02,539 INFO L74 IsIncluded]: Start isIncluded. First operand 5253 states. Second operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:02,543 INFO L87 Difference]: Start difference. First operand 5253 states. Second operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:03,305 INFO L93 Difference]: Finished difference Result 5253 states and 6581 transitions. [2022-02-20 19:59:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 6581 transitions. [2022-02-20 19:59:03,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:03,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:03,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) Second operand 5253 states. [2022-02-20 19:59:03,322 INFO L87 Difference]: Start difference. First operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) Second operand 5253 states. [2022-02-20 19:59:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,095 INFO L93 Difference]: Finished difference Result 5253 states and 6581 transitions. [2022-02-20 19:59:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 6581 transitions. [2022-02-20 19:59:04,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:04,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4944 states, 3899 states have (on average 1.2744293408566298) internal successors, (4969), 3965 states have internal predecessors, (4969), 517 states have call successors, (517), 422 states have call predecessors, (517), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4944 states to 4944 states and 6224 transitions. [2022-02-20 19:59:05,196 INFO L78 Accepts]: Start accepts. Automaton has 4944 states and 6224 transitions. Word has length 73 [2022-02-20 19:59:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:05,196 INFO L470 AbstractCegarLoop]: Abstraction has 4944 states and 6224 transitions. [2022-02-20 19:59:05,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4944 states and 6224 transitions. [2022-02-20 19:59:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:59:05,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:05,197 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:05,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:59:05,198 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1573517105, now seen corresponding path program 1 times [2022-02-20 19:59:05,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:05,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619446465] [2022-02-20 19:59:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {115952#(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); {115910#true} is VALID [2022-02-20 19:59:05,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2025#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {115953#(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); {115910#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume !(0 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2027#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} havoc ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume !(1 == ~p_dw_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} ~__retres1~0 := 0; {115910#true} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {115910#true} #res := ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,282 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {115910#true} {115910#true} #2021#return; {115910#true} is VALID [2022-02-20 19:59:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} havoc ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume !(1 == ~c_dr_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} ~__retres1~1 := 0; {115910#true} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {115910#true} #res := ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {115910#true} {115910#true} #2023#return; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {115954#(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; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L272 TraceCheckUtils]: 1: Hoare triple {115910#true} call #t~ret8 := is_do_write_p_triggered(); {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} havoc ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {115910#true} assume !(1 == ~p_dw_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {115910#true} ~__retres1~0 := 0; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {115910#true} #res := ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115910#true} {115910#true} #2021#return; {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {115910#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {115910#true} assume !(0 != ~tmp~1); {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L272 TraceCheckUtils]: 10: Hoare triple {115910#true} call #t~ret9 := is_do_read_c_triggered(); {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {115910#true} havoc ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {115910#true} assume !(1 == ~c_dr_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {115910#true} ~__retres1~1 := 0; {115910#true} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {115910#true} #res := ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115910#true} {115910#true} #2023#return; {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {115910#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {115910#true} assume !(0 != ~tmp___0~1); {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,288 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2029#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {115953#(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); {115910#true} is VALID [2022-02-20 19:59:05,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume !(1 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:05,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2031#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} havoc ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115910#true} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} #res := ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,299 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2033#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115910#true} is VALID [2022-02-20 19:59:05,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {115910#true} is VALID [2022-02-20 19:59:05,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {115952#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {115952#(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); {115910#true} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,301 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2025#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {115953#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:05,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {115953#(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); {115910#true} is VALID [2022-02-20 19:59:05,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {115910#true} assume !(0 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:05,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,303 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2027#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,304 INFO L272 TraceCheckUtils]: 17: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {115954#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:05,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {115954#(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; {115910#true} is VALID [2022-02-20 19:59:05,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {115910#true} call #t~ret8 := is_do_write_p_triggered(); {115910#true} is VALID [2022-02-20 19:59:05,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {115910#true} havoc ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {115910#true} assume !(1 == ~p_dw_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {115910#true} ~__retres1~0 := 0; {115910#true} is VALID [2022-02-20 19:59:05,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {115910#true} #res := ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115910#true} {115910#true} #2021#return; {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {115910#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {115910#true} assume !(0 != ~tmp~1); {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {115910#true} call #t~ret9 := is_do_read_c_triggered(); {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {115910#true} havoc ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {115910#true} assume !(1 == ~c_dr_pc~0); {115910#true} is VALID [2022-02-20 19:59:05,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {115910#true} ~__retres1~1 := 0; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {115910#true} #res := ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115910#true} {115910#true} #2023#return; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {115910#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {115910#true} assume !(0 != ~tmp___0~1); {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,306 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2029#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,307 INFO L272 TraceCheckUtils]: 39: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {115953#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:05,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {115953#(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); {115910#true} is VALID [2022-02-20 19:59:05,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {115910#true} assume !(1 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:05,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,308 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2031#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,309 INFO L272 TraceCheckUtils]: 47: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115910#true} is VALID [2022-02-20 19:59:05,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {115910#true} havoc ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:05,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {115910#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115910#true} is VALID [2022-02-20 19:59:05,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {115910#true} #res := ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:05,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:05,309 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115910#true} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2033#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {115911#false} is VALID [2022-02-20 19:59:05,316 INFO L272 TraceCheckUtils]: 72: Hoare triple {115911#false} call error1(); {115911#false} is VALID [2022-02-20 19:59:05,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {115911#false} assume !false; {115911#false} is VALID [2022-02-20 19:59:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:05,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:05,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619446465] [2022-02-20 19:59:05,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619446465] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:59:05,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018488531] [2022-02-20 19:59:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:59:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:05,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:59:05,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:59:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:59:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:06,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115910#true} is VALID [2022-02-20 19:59:06,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {115910#true} is VALID [2022-02-20 19:59:06,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,026 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2025#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,028 INFO L272 TraceCheckUtils]: 12: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,029 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2027#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,030 INFO L272 TraceCheckUtils]: 19: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,032 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2021#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,033 INFO L272 TraceCheckUtils]: 28: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,036 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2023#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,037 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2029#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,037 INFO L272 TraceCheckUtils]: 39: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,038 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2031#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,040 INFO L272 TraceCheckUtils]: 47: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,041 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2033#return; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {115912#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {115950#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {116177#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {116177#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {116177#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:06,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {116177#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {115911#false} is VALID [2022-02-20 19:59:06,048 INFO L272 TraceCheckUtils]: 72: Hoare triple {115911#false} call error1(); {115911#false} is VALID [2022-02-20 19:59:06,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {115911#false} assume !false; {115911#false} is VALID [2022-02-20 19:59:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:59:06,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {115911#false} assume !false; {115911#false} is VALID [2022-02-20 19:59:06,401 INFO L272 TraceCheckUtils]: 72: Hoare triple {115911#false} call error1(); {115911#false} is VALID [2022-02-20 19:59:06,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {115911#false} is VALID [2022-02-20 19:59:06,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,404 INFO L290 TraceCheckUtils]: 66: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {116202#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:06,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,409 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115910#true} {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2033#return; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {115910#true} #res := ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:06,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {115910#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115910#true} is VALID [2022-02-20 19:59:06,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {115910#true} havoc ~__retres1~2; {115910#true} is VALID [2022-02-20 19:59:06,409 INFO L272 TraceCheckUtils]: 47: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115910#true} is VALID [2022-02-20 19:59:06,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,411 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115910#true} {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2031#return; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {115910#true} assume !(1 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:06,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {115910#true} assume !(1 == ~q_read_ev~0); {115910#true} is VALID [2022-02-20 19:59:06,411 INFO L272 TraceCheckUtils]: 39: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115910#true} {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2029#return; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {115910#true} assume !(0 != ~tmp___0~1); {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {115910#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115910#true} {115910#true} #2023#return; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {115910#true} #res := ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {115910#true} ~__retres1~1 := 0; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {115910#true} assume !(1 == ~c_dr_pc~0); {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {115910#true} havoc ~__retres1~1; {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {115910#true} call #t~ret9 := is_do_read_c_triggered(); {115910#true} is VALID [2022-02-20 19:59:06,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {115910#true} assume !(0 != ~tmp~1); {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {115910#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115910#true} {115910#true} #2021#return; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {115910#true} #res := ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {115910#true} ~__retres1~0 := 0; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {115910#true} assume !(1 == ~p_dw_pc~0); {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {115910#true} havoc ~__retres1~0; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {115910#true} call #t~ret8 := is_do_write_p_triggered(); {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {115910#true} havoc ~tmp~1;havoc ~tmp___0~1; {115910#true} is VALID [2022-02-20 19:59:06,413 INFO L272 TraceCheckUtils]: 17: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {115910#true} is VALID [2022-02-20 19:59:06,414 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115910#true} {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2027#return; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {115910#true} assume !(0 == ~q_write_ev~0); {115910#true} is VALID [2022-02-20 19:59:06,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {115910#true} assume !(0 == ~q_read_ev~0); {115910#true} is VALID [2022-02-20 19:59:06,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {115910#true} is VALID [2022-02-20 19:59:06,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,416 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115910#true} {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2025#return; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {115910#true} assume true; {115910#true} is VALID [2022-02-20 19:59:06,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {115910#true} assume !(1 == ~q_req_up~0); {115910#true} is VALID [2022-02-20 19:59:06,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {115910#true} is VALID [2022-02-20 19:59:06,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {115910#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115951#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:06,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {115910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {115910#true} is VALID [2022-02-20 19:59:06,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {115910#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115910#true} is VALID [2022-02-20 19:59:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018488531] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:59:06,417 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:59:06,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:59:06,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824145349] [2022-02-20 19:59:06,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:59:06,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:59:06,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:06,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:06,523 INFO L87 Difference]: Start difference. First operand 4944 states and 6224 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)