./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.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/systemc/pc_sfifo_2.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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:18:47,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:18:47,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:18:47,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:18:47,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:18:47,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:18:47,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:18:47,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:18:47,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:18:47,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:18:47,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:18:47,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:18:47,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:18:47,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:18:47,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:18:47,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:18:47,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:18:47,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:18:47,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:18:47,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:18:47,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:18:47,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:18:47,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:18:47,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:18:47,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:18:47,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:18:47,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:18:47,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:18:47,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:18:47,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:18:47,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:18:47,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:18:47,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:18:47,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:18:47,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:18:47,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:18:47,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:18:47,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:18:47,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:18:47,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:18:47,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:18:47,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:18:48,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:18:48,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:18:48,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:18:48,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:18:48,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:18:48,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:18:48,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:18:48,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:18:48,030 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:18:48,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:18:48,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:18:48,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:18:48,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:18:48,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:18:48,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:18:48,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:18:48,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:18:48,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:18:48,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:18:48,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:18:48,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:18:48,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:18:48,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:18:48,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:18:48,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:48,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:18:48,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:18:48,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:18:48,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:18:48,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:18:48,035 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:18:48,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:18:48,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:18:48,036 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2022-02-20 18:18:48,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:18:48,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:18:48,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:18:48,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:18:48,314 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:18:48,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-02-20 18:18:48,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd72cc4/c0acbbb9c0c548f3b29c6f14a0e26bb2/FLAG7aa41c01f [2022-02-20 18:18:48,781 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:18:48,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-02-20 18:18:48,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd72cc4/c0acbbb9c0c548f3b29c6f14a0e26bb2/FLAG7aa41c01f [2022-02-20 18:18:49,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd72cc4/c0acbbb9c0c548f3b29c6f14a0e26bb2 [2022-02-20 18:18:49,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:18:49,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:18:49,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:49,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:18:49,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:18:49,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc8df41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49, skipping insertion in model container [2022-02-20 18:18:49,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:18:49,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:18:49,331 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-02-20 18:18:49,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:49,416 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:18:49,427 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-02-20 18:18:49,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:49,494 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:18:49,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49 WrapperNode [2022-02-20 18:18:49,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:49,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:49,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:18:49,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:18:49,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,545 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2022-02-20 18:18:49,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:49,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:18:49,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:18:49,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:18:49,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:18:49,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:18:49,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:18:49,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:18:49,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (1/1) ... [2022-02-20 18:18:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:18:49,620 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 18:18:49,641 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 18:18:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:18:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 18:18:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 18:18:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 18:18:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 18:18:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 18:18:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 18:18:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 18:18:49,662 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 18:18:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 18:18:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 18:18:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 18:18:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 18:18:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:18:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 18:18:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 18:18:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:18:49,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:18:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 18:18:49,664 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 18:18:49,747 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:18:49,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:18:50,041 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:18:50,047 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:18:50,048 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 18:18:50,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:50 BoogieIcfgContainer [2022-02-20 18:18:50,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:18:50,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:18:50,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:18:50,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:18:50,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:18:49" (1/3) ... [2022-02-20 18:18:50,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:50, skipping insertion in model container [2022-02-20 18:18:50,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:49" (2/3) ... [2022-02-20 18:18:50,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:50, skipping insertion in model container [2022-02-20 18:18:50,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:50" (3/3) ... [2022-02-20 18:18:50,061 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2022-02-20 18:18:50,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:18:50,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:18:50,120 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:18:50,127 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 18:18:50,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:18:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 18:18:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:18:50,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:50,164 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] [2022-02-20 18:18:50,164 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2022-02-20 18:18:50,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:50,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239228778] [2022-02-20 18:18:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:18:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(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); {106#true} is VALID [2022-02-20 18:18:50,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106#true} {108#(= 1 ~c_dr_i~0)} #313#return; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:18:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(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; {106#true} is VALID [2022-02-20 18:18:50,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {106#true} is VALID [2022-02-20 18:18:50,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#true} {107#false} #315#return; {107#false} is VALID [2022-02-20 18:18:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:18:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#true} havoc ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume 1 == ~p_dw_pc~0; {106#true} is VALID [2022-02-20 18:18:50,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {106#true} is VALID [2022-02-20 18:18:50,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {106#true} #res := ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,516 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {106#true} {106#true} #309#return; {106#true} is VALID [2022-02-20 18:18:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:18:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#true} havoc ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume 1 == ~c_dr_pc~0; {106#true} is VALID [2022-02-20 18:18:50,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {106#true} is VALID [2022-02-20 18:18:50,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {106#true} #res := ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,529 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {106#true} {106#true} #311#return; {106#true} is VALID [2022-02-20 18:18:50,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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; {106#true} is VALID [2022-02-20 18:18:50,531 INFO L272 TraceCheckUtils]: 1: Hoare triple {106#true} call #t~ret7 := is_do_write_p_triggered(); {106#true} is VALID [2022-02-20 18:18:50,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} havoc ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {106#true} assume 1 == ~p_dw_pc~0; {106#true} is VALID [2022-02-20 18:18:50,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {106#true} is VALID [2022-02-20 18:18:50,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#true} #res := ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,533 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {106#true} {106#true} #309#return; {106#true} is VALID [2022-02-20 18:18:50,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {106#true} is VALID [2022-02-20 18:18:50,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {106#true} is VALID [2022-02-20 18:18:50,534 INFO L272 TraceCheckUtils]: 10: Hoare triple {106#true} call #t~ret8 := is_do_read_c_triggered(); {106#true} is VALID [2022-02-20 18:18:50,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {106#true} havoc ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {106#true} assume 1 == ~c_dr_pc~0; {106#true} is VALID [2022-02-20 18:18:50,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {106#true} is VALID [2022-02-20 18:18:50,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#true} #res := ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,537 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {106#true} {106#true} #311#return; {106#true} is VALID [2022-02-20 18:18:50,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {106#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {106#true} is VALID [2022-02-20 18:18:50,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {106#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {106#true} is VALID [2022-02-20 18:18:50,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,539 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {106#true} {107#false} #317#return; {107#false} is VALID [2022-02-20 18:18:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:18:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(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; {106#true} is VALID [2022-02-20 18:18:50,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {106#true} is VALID [2022-02-20 18:18:50,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#true} {107#false} #319#return; {107#false} is VALID [2022-02-20 18:18:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:18:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:50,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#true} havoc ~__retres1~2; {106#true} is VALID [2022-02-20 18:18:50,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {106#true} is VALID [2022-02-20 18:18:50,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} #res := ~__retres1~2; {106#true} is VALID [2022-02-20 18:18:50,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,576 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {106#true} {107#false} #321#return; {107#false} is VALID [2022-02-20 18:18:50,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#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; {106#true} is VALID [2022-02-20 18:18:50,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,582 INFO L272 TraceCheckUtils]: 3: Hoare triple {108#(= 1 ~c_dr_i~0)} call update_channels(); {146#(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 18:18:50,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#(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); {106#true} is VALID [2022-02-20 18:18:50,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,584 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {106#true} {108#(= 1 ~c_dr_i~0)} #313#return; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads } true; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {108#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {108#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:18:50,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {107#false} is VALID [2022-02-20 18:18:50,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#false} assume { :end_inline_init_threads } true; {107#false} is VALID [2022-02-20 18:18:50,588 INFO L272 TraceCheckUtils]: 11: Hoare triple {107#false} call fire_delta_events(); {147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:50,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {147#(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; {106#true} is VALID [2022-02-20 18:18:50,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {106#true} is VALID [2022-02-20 18:18:50,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,589 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106#true} {107#false} #315#return; {107#false} is VALID [2022-02-20 18:18:50,589 INFO L272 TraceCheckUtils]: 16: Hoare triple {107#false} call activate_threads(); {148#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:18:50,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(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; {106#true} is VALID [2022-02-20 18:18:50,590 INFO L272 TraceCheckUtils]: 18: Hoare triple {106#true} call #t~ret7 := is_do_write_p_triggered(); {106#true} is VALID [2022-02-20 18:18:50,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {106#true} havoc ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {106#true} assume 1 == ~p_dw_pc~0; {106#true} is VALID [2022-02-20 18:18:50,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {106#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {106#true} is VALID [2022-02-20 18:18:50,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {106#true} #res := ~__retres1~0; {106#true} is VALID [2022-02-20 18:18:50,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,592 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {106#true} {106#true} #309#return; {106#true} is VALID [2022-02-20 18:18:50,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {106#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {106#true} is VALID [2022-02-20 18:18:50,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {106#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {106#true} is VALID [2022-02-20 18:18:50,592 INFO L272 TraceCheckUtils]: 27: Hoare triple {106#true} call #t~ret8 := is_do_read_c_triggered(); {106#true} is VALID [2022-02-20 18:18:50,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {106#true} havoc ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {106#true} assume 1 == ~c_dr_pc~0; {106#true} is VALID [2022-02-20 18:18:50,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {106#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {106#true} is VALID [2022-02-20 18:18:50,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {106#true} #res := ~__retres1~1; {106#true} is VALID [2022-02-20 18:18:50,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,594 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {106#true} {106#true} #311#return; {106#true} is VALID [2022-02-20 18:18:50,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {106#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {106#true} is VALID [2022-02-20 18:18:50,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {106#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {106#true} is VALID [2022-02-20 18:18:50,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,595 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {106#true} {107#false} #317#return; {107#false} is VALID [2022-02-20 18:18:50,595 INFO L272 TraceCheckUtils]: 38: Hoare triple {107#false} call reset_delta_events(); {147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:50,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {147#(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; {106#true} is VALID [2022-02-20 18:18:50,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {106#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {106#true} is VALID [2022-02-20 18:18:50,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,596 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {106#true} {107#false} #319#return; {107#false} is VALID [2022-02-20 18:18:50,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {107#false} assume !false; {107#false} is VALID [2022-02-20 18:18:50,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {107#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {107#false} is VALID [2022-02-20 18:18:50,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {107#false} assume !false; {107#false} is VALID [2022-02-20 18:18:50,597 INFO L272 TraceCheckUtils]: 46: Hoare triple {107#false} call eval_#t~ret9#1 := exists_runnable_thread(); {106#true} is VALID [2022-02-20 18:18:50,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {106#true} havoc ~__retres1~2; {106#true} is VALID [2022-02-20 18:18:50,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {106#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {106#true} is VALID [2022-02-20 18:18:50,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {106#true} #res := ~__retres1~2; {106#true} is VALID [2022-02-20 18:18:50,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {106#true} assume true; {106#true} is VALID [2022-02-20 18:18:50,599 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {106#true} {107#false} #321#return; {107#false} is VALID [2022-02-20 18:18:50,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {107#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {107#false} is VALID [2022-02-20 18:18:50,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {107#false} assume 0 != eval_~tmp___1~0#1; {107#false} is VALID [2022-02-20 18:18:50,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {107#false} assume !(0 == ~p_dw_st~0); {107#false} is VALID [2022-02-20 18:18:50,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {107#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {107#false} is VALID [2022-02-20 18:18:50,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {107#false} assume 0 != eval_~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; {107#false} is VALID [2022-02-20 18:18:50,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {107#false} assume 0 == ~c_dr_pc~0; {107#false} is VALID [2022-02-20 18:18:50,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {107#false} assume !false; {107#false} is VALID [2022-02-20 18:18:50,601 INFO L290 TraceCheckUtils]: 59: Hoare triple {107#false} assume !(1 == ~q_free~0); {107#false} is VALID [2022-02-20 18:18:50,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {107#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; {107#false} is VALID [2022-02-20 18:18:50,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {107#false} assume !(~p_last_write~0 == ~c_last_read~0); {107#false} is VALID [2022-02-20 18:18:50,602 INFO L272 TraceCheckUtils]: 62: Hoare triple {107#false} call error(); {107#false} is VALID [2022-02-20 18:18:50,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {107#false} assume !false; {107#false} is VALID [2022-02-20 18:18:50,603 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 18:18:50,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:50,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239228778] [2022-02-20 18:18:50,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239228778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:50,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:50,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:18:50,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726320711] [2022-02-20 18:18:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-02-20 18:18:50,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:50,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:18:50,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:50,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:18:50,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:18:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:18:50,722 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:18:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:51,513 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2022-02-20 18:18:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:18:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-02-20 18:18:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:18:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2022-02-20 18:18:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:18:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2022-02-20 18:18:51,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 313 transitions. [2022-02-20 18:18:51,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:51,897 INFO L225 Difference]: With dead ends: 215 [2022-02-20 18:18:51,898 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 18:18:51,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:18:51,919 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:51,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 289 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:18:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 18:18:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2022-02-20 18:18:51,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:51,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:18:51,979 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:18:51,979 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:18:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:51,990 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2022-02-20 18:18:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2022-02-20 18:18:51,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:51,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:51,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-02-20 18:18:51,999 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-02-20 18:18:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:52,011 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2022-02-20 18:18:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2022-02-20 18:18:52,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:52,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:52,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:52,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:18:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-02-20 18:18:52,038 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2022-02-20 18:18:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:52,038 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-02-20 18:18:52,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:18:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-02-20 18:18:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:18:52,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:52,044 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] [2022-02-20 18:18:52,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:18:52,044 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2022-02-20 18:18:52,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:52,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171811884] [2022-02-20 18:18:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:18:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {878#(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); {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:18:52,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:18:52,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {840#(= ~q_read_ev~0 2)} #313#return; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:18:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#(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; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#(= |old(~q_read_ev~0)| 0)} assume true; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#(= |old(~q_read_ev~0)| 0)} {840#(= ~q_read_ev~0 2)} #315#return; {839#false} is VALID [2022-02-20 18:18:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:18:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#true} havoc ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} assume 1 == ~p_dw_pc~0; {838#true} is VALID [2022-02-20 18:18:52,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {838#true} is VALID [2022-02-20 18:18:52,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#true} #res := ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,186 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {838#true} {838#true} #309#return; {838#true} is VALID [2022-02-20 18:18:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:18:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#true} havoc ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} assume 1 == ~c_dr_pc~0; {838#true} is VALID [2022-02-20 18:18:52,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {838#true} is VALID [2022-02-20 18:18:52,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#true} #res := ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,192 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {838#true} {838#true} #311#return; {838#true} is VALID [2022-02-20 18:18:52,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#(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; {838#true} is VALID [2022-02-20 18:18:52,192 INFO L272 TraceCheckUtils]: 1: Hoare triple {838#true} call #t~ret7 := is_do_write_p_triggered(); {838#true} is VALID [2022-02-20 18:18:52,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} havoc ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#true} assume 1 == ~p_dw_pc~0; {838#true} is VALID [2022-02-20 18:18:52,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {838#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {838#true} is VALID [2022-02-20 18:18:52,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#true} #res := ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,194 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {838#true} {838#true} #309#return; {838#true} is VALID [2022-02-20 18:18:52,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {838#true} is VALID [2022-02-20 18:18:52,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {838#true} is VALID [2022-02-20 18:18:52,194 INFO L272 TraceCheckUtils]: 10: Hoare triple {838#true} call #t~ret8 := is_do_read_c_triggered(); {838#true} is VALID [2022-02-20 18:18:52,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#true} havoc ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#true} assume 1 == ~c_dr_pc~0; {838#true} is VALID [2022-02-20 18:18:52,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {838#true} is VALID [2022-02-20 18:18:52,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#true} #res := ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {838#true} {838#true} #311#return; {838#true} is VALID [2022-02-20 18:18:52,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {838#true} is VALID [2022-02-20 18:18:52,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {838#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {838#true} is VALID [2022-02-20 18:18:52,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,196 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {838#true} {839#false} #317#return; {839#false} is VALID [2022-02-20 18:18:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:18:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#(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; {838#true} is VALID [2022-02-20 18:18:52,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {838#true} is VALID [2022-02-20 18:18:52,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {838#true} {839#false} #319#return; {839#false} is VALID [2022-02-20 18:18:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:18:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:52,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#true} havoc ~__retres1~2; {838#true} is VALID [2022-02-20 18:18:52,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {838#true} is VALID [2022-02-20 18:18:52,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} #res := ~__retres1~2; {838#true} is VALID [2022-02-20 18:18:52,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,210 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {838#true} {839#false} #321#return; {839#false} is VALID [2022-02-20 18:18:52,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#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; {838#true} is VALID [2022-02-20 18:18:52,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#(= ~q_read_ev~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,212 INFO L272 TraceCheckUtils]: 3: Hoare triple {840#(= ~q_read_ev~0 2)} call update_channels(); {878#(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 18:18:52,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {878#(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); {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:18:52,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:18:52,213 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {879#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {840#(= ~q_read_ev~0 2)} #313#return; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads } true; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {840#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads } true; {840#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:18:52,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {840#(= ~q_read_ev~0 2)} call fire_delta_events(); {880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:52,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#(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; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#(= |old(~q_read_ev~0)| 0)} assume true; {881#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:18:52,218 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {881#(= |old(~q_read_ev~0)| 0)} {840#(= ~q_read_ev~0 2)} #315#return; {839#false} is VALID [2022-02-20 18:18:52,218 INFO L272 TraceCheckUtils]: 16: Hoare triple {839#false} call activate_threads(); {882#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:18:52,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#(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; {838#true} is VALID [2022-02-20 18:18:52,218 INFO L272 TraceCheckUtils]: 18: Hoare triple {838#true} call #t~ret7 := is_do_write_p_triggered(); {838#true} is VALID [2022-02-20 18:18:52,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} havoc ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#true} assume 1 == ~p_dw_pc~0; {838#true} is VALID [2022-02-20 18:18:52,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {838#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {838#true} is VALID [2022-02-20 18:18:52,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {838#true} #res := ~__retres1~0; {838#true} is VALID [2022-02-20 18:18:52,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,220 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {838#true} {838#true} #309#return; {838#true} is VALID [2022-02-20 18:18:52,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {838#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {838#true} is VALID [2022-02-20 18:18:52,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {838#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {838#true} is VALID [2022-02-20 18:18:52,220 INFO L272 TraceCheckUtils]: 27: Hoare triple {838#true} call #t~ret8 := is_do_read_c_triggered(); {838#true} is VALID [2022-02-20 18:18:52,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#true} havoc ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#true} assume 1 == ~c_dr_pc~0; {838#true} is VALID [2022-02-20 18:18:52,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {838#true} is VALID [2022-02-20 18:18:52,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#true} #res := ~__retres1~1; {838#true} is VALID [2022-02-20 18:18:52,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,221 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {838#true} {838#true} #311#return; {838#true} is VALID [2022-02-20 18:18:52,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {838#true} is VALID [2022-02-20 18:18:52,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {838#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {838#true} is VALID [2022-02-20 18:18:52,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,222 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {838#true} {839#false} #317#return; {839#false} is VALID [2022-02-20 18:18:52,223 INFO L272 TraceCheckUtils]: 38: Hoare triple {839#false} call reset_delta_events(); {880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:52,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {880#(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; {838#true} is VALID [2022-02-20 18:18:52,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {838#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {838#true} is VALID [2022-02-20 18:18:52,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,223 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {838#true} {839#false} #319#return; {839#false} is VALID [2022-02-20 18:18:52,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-02-20 18:18:52,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {839#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {839#false} is VALID [2022-02-20 18:18:52,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-02-20 18:18:52,224 INFO L272 TraceCheckUtils]: 46: Hoare triple {839#false} call eval_#t~ret9#1 := exists_runnable_thread(); {838#true} is VALID [2022-02-20 18:18:52,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {838#true} havoc ~__retres1~2; {838#true} is VALID [2022-02-20 18:18:52,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {838#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {838#true} is VALID [2022-02-20 18:18:52,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {838#true} #res := ~__retres1~2; {838#true} is VALID [2022-02-20 18:18:52,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {838#true} assume true; {838#true} is VALID [2022-02-20 18:18:52,225 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {838#true} {839#false} #321#return; {839#false} is VALID [2022-02-20 18:18:52,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {839#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {839#false} is VALID [2022-02-20 18:18:52,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {839#false} assume 0 != eval_~tmp___1~0#1; {839#false} is VALID [2022-02-20 18:18:52,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {839#false} assume !(0 == ~p_dw_st~0); {839#false} is VALID [2022-02-20 18:18:52,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {839#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {839#false} is VALID [2022-02-20 18:18:52,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {839#false} assume 0 != eval_~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; {839#false} is VALID [2022-02-20 18:18:52,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {839#false} assume 0 == ~c_dr_pc~0; {839#false} is VALID [2022-02-20 18:18:52,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-02-20 18:18:52,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {839#false} assume !(1 == ~q_free~0); {839#false} is VALID [2022-02-20 18:18:52,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {839#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; {839#false} is VALID [2022-02-20 18:18:52,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {839#false} assume !(~p_last_write~0 == ~c_last_read~0); {839#false} is VALID [2022-02-20 18:18:52,228 INFO L272 TraceCheckUtils]: 62: Hoare triple {839#false} call error(); {839#false} is VALID [2022-02-20 18:18:52,228 INFO L290 TraceCheckUtils]: 63: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-02-20 18:18:52,228 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 18:18:52,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:52,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171811884] [2022-02-20 18:18:52,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171811884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:52,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:52,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:18:52,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640441211] [2022-02-20 18:18:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:52,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:52,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:52,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:52,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:18:52,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:52,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:18:52,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:18:52,275 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:53,606 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2022-02-20 18:18:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:18:53,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 445 transitions. [2022-02-20 18:18:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 445 transitions. [2022-02-20 18:18:53,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 445 transitions. [2022-02-20 18:18:54,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:54,029 INFO L225 Difference]: With dead ends: 320 [2022-02-20 18:18:54,033 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 18:18:54,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:18:54,041 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 395 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:54,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 350 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:18:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 18:18:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2022-02-20 18:18:54,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:54,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:18:54,084 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:18:54,085 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:18:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:54,097 INFO L93 Difference]: Finished difference Result 232 states and 316 transitions. [2022-02-20 18:18:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2022-02-20 18:18:54,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:54,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:54,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 232 states. [2022-02-20 18:18:54,102 INFO L87 Difference]: Start difference. First operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 232 states. [2022-02-20 18:18:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:54,114 INFO L93 Difference]: Finished difference Result 232 states and 316 transitions. [2022-02-20 18:18:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2022-02-20 18:18:54,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:54,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:54,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:54,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:18:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2022-02-20 18:18:54,126 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2022-02-20 18:18:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:54,128 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2022-02-20 18:18:54,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2022-02-20 18:18:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:18:54,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:54,131 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] [2022-02-20 18:18:54,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:18:54,132 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2022-02-20 18:18:54,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:54,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616884358] [2022-02-20 18:18:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:18:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2128#(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); {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2090#(= ~q_write_ev~0 ~q_read_ev~0)} #313#return; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:18:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {2129#(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); {2130#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2090#(= ~q_write_ev~0 ~q_read_ev~0)} #315#return; {2089#false} is VALID [2022-02-20 18:18:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:18:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#true} havoc ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#true} assume !(1 == ~p_dw_pc~0); {2088#true} is VALID [2022-02-20 18:18:54,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {2088#true} ~__retres1~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {2088#true} #res := ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,296 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2088#true} {2088#true} #309#return; {2088#true} is VALID [2022-02-20 18:18:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:18:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#true} havoc ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#true} assume 1 == ~c_dr_pc~0; {2088#true} is VALID [2022-02-20 18:18:54,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {2088#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2088#true} is VALID [2022-02-20 18:18:54,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {2088#true} #res := ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,301 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2088#true} {2088#true} #311#return; {2088#true} is VALID [2022-02-20 18:18:54,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {2132#(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; {2088#true} is VALID [2022-02-20 18:18:54,301 INFO L272 TraceCheckUtils]: 1: Hoare triple {2088#true} call #t~ret7 := is_do_write_p_triggered(); {2088#true} is VALID [2022-02-20 18:18:54,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2088#true} havoc ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {2088#true} assume !(1 == ~p_dw_pc~0); {2088#true} is VALID [2022-02-20 18:18:54,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {2088#true} ~__retres1~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {2088#true} #res := ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,303 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2088#true} {2088#true} #309#return; {2088#true} is VALID [2022-02-20 18:18:54,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {2088#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {2088#true} is VALID [2022-02-20 18:18:54,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {2088#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,303 INFO L272 TraceCheckUtils]: 10: Hoare triple {2088#true} call #t~ret8 := is_do_read_c_triggered(); {2088#true} is VALID [2022-02-20 18:18:54,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {2088#true} havoc ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {2088#true} assume 1 == ~c_dr_pc~0; {2088#true} is VALID [2022-02-20 18:18:54,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {2088#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2088#true} is VALID [2022-02-20 18:18:54,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {2088#true} #res := ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,305 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2088#true} {2088#true} #311#return; {2088#true} is VALID [2022-02-20 18:18:54,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {2088#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {2088#true} is VALID [2022-02-20 18:18:54,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,305 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2088#true} {2089#false} #317#return; {2089#false} is VALID [2022-02-20 18:18:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:18:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {2129#(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); {2088#true} is VALID [2022-02-20 18:18:54,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2088#true} is VALID [2022-02-20 18:18:54,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2088#true} {2089#false} #319#return; {2089#false} is VALID [2022-02-20 18:18:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:18:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:54,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#true} havoc ~__retres1~2; {2088#true} is VALID [2022-02-20 18:18:54,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2088#true} is VALID [2022-02-20 18:18:54,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2088#true} #res := ~__retres1~2; {2088#true} is VALID [2022-02-20 18:18:54,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,316 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2088#true} {2089#false} #321#return; {2089#false} is VALID [2022-02-20 18:18:54,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {2088#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; {2088#true} is VALID [2022-02-20 18:18:54,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {2088#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,318 INFO L272 TraceCheckUtils]: 3: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels(); {2128#(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 18:18:54,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {2128#(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); {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,320 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2090#(= ~q_write_ev~0 ~q_read_ev~0)} #313#return; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads } true; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads } true; {2090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:18:54,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {2090#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events(); {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(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); {2130#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {2130#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:18:54,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2131#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2090#(= ~q_write_ev~0 ~q_read_ev~0)} #315#return; {2089#false} is VALID [2022-02-20 18:18:54,324 INFO L272 TraceCheckUtils]: 16: Hoare triple {2089#false} call activate_threads(); {2132#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:18:54,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {2132#(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; {2088#true} is VALID [2022-02-20 18:18:54,325 INFO L272 TraceCheckUtils]: 18: Hoare triple {2088#true} call #t~ret7 := is_do_write_p_triggered(); {2088#true} is VALID [2022-02-20 18:18:54,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#true} havoc ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {2088#true} assume !(1 == ~p_dw_pc~0); {2088#true} is VALID [2022-02-20 18:18:54,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {2088#true} ~__retres1~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {2088#true} #res := ~__retres1~0; {2088#true} is VALID [2022-02-20 18:18:54,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,326 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2088#true} {2088#true} #309#return; {2088#true} is VALID [2022-02-20 18:18:54,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {2088#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {2088#true} is VALID [2022-02-20 18:18:54,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {2088#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,326 INFO L272 TraceCheckUtils]: 27: Hoare triple {2088#true} call #t~ret8 := is_do_read_c_triggered(); {2088#true} is VALID [2022-02-20 18:18:54,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {2088#true} havoc ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {2088#true} assume 1 == ~c_dr_pc~0; {2088#true} is VALID [2022-02-20 18:18:54,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {2088#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2088#true} is VALID [2022-02-20 18:18:54,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {2088#true} #res := ~__retres1~1; {2088#true} is VALID [2022-02-20 18:18:54,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,328 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2088#true} {2088#true} #311#return; {2088#true} is VALID [2022-02-20 18:18:54,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {2088#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {2088#true} is VALID [2022-02-20 18:18:54,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {2088#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2088#true} is VALID [2022-02-20 18:18:54,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,328 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2088#true} {2089#false} #317#return; {2089#false} is VALID [2022-02-20 18:18:54,329 INFO L272 TraceCheckUtils]: 38: Hoare triple {2089#false} call reset_delta_events(); {2129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:54,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(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); {2088#true} is VALID [2022-02-20 18:18:54,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {2088#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2088#true} is VALID [2022-02-20 18:18:54,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,329 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2088#true} {2089#false} #319#return; {2089#false} is VALID [2022-02-20 18:18:54,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2022-02-20 18:18:54,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {2089#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {2089#false} is VALID [2022-02-20 18:18:54,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2022-02-20 18:18:54,330 INFO L272 TraceCheckUtils]: 46: Hoare triple {2089#false} call eval_#t~ret9#1 := exists_runnable_thread(); {2088#true} is VALID [2022-02-20 18:18:54,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {2088#true} havoc ~__retres1~2; {2088#true} is VALID [2022-02-20 18:18:54,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {2088#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2088#true} is VALID [2022-02-20 18:18:54,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {2088#true} #res := ~__retres1~2; {2088#true} is VALID [2022-02-20 18:18:54,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {2088#true} assume true; {2088#true} is VALID [2022-02-20 18:18:54,331 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2088#true} {2089#false} #321#return; {2089#false} is VALID [2022-02-20 18:18:54,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {2089#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {2089#false} is VALID [2022-02-20 18:18:54,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {2089#false} assume 0 != eval_~tmp___1~0#1; {2089#false} is VALID [2022-02-20 18:18:54,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {2089#false} assume !(0 == ~p_dw_st~0); {2089#false} is VALID [2022-02-20 18:18:54,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {2089#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {2089#false} is VALID [2022-02-20 18:18:54,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {2089#false} assume 0 != eval_~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; {2089#false} is VALID [2022-02-20 18:18:54,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {2089#false} assume 0 == ~c_dr_pc~0; {2089#false} is VALID [2022-02-20 18:18:54,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2022-02-20 18:18:54,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {2089#false} assume !(1 == ~q_free~0); {2089#false} is VALID [2022-02-20 18:18:54,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {2089#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; {2089#false} is VALID [2022-02-20 18:18:54,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {2089#false} assume !(~p_last_write~0 == ~c_last_read~0); {2089#false} is VALID [2022-02-20 18:18:54,334 INFO L272 TraceCheckUtils]: 62: Hoare triple {2089#false} call error(); {2089#false} is VALID [2022-02-20 18:18:54,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2022-02-20 18:18:54,334 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 18:18:54,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:54,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616884358] [2022-02-20 18:18:54,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616884358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:54,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:54,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:18:54,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299354650] [2022-02-20 18:18:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:54,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:54,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:54,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:18:54,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:54,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:18:54,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:54,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:18:54,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:18:54,386 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:18:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:56,264 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2022-02-20 18:18:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:18:56,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:18:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 468 transitions. [2022-02-20 18:18:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:18:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 468 transitions. [2022-02-20 18:18:56,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 468 transitions. [2022-02-20 18:18:56,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:56,666 INFO L225 Difference]: With dead ends: 540 [2022-02-20 18:18:56,666 INFO L226 Difference]: Without dead ends: 363 [2022-02-20 18:18:56,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:18:56,668 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 344 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:56,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 737 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 18:18:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-02-20 18:18:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2022-02-20 18:18:56,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:56,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:18:56,697 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:18:56,698 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:18:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:56,713 INFO L93 Difference]: Finished difference Result 363 states and 498 transitions. [2022-02-20 18:18:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 498 transitions. [2022-02-20 18:18:56,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:56,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:56,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) Second operand 363 states. [2022-02-20 18:18:56,716 INFO L87 Difference]: Start difference. First operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) Second operand 363 states. [2022-02-20 18:18:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:56,731 INFO L93 Difference]: Finished difference Result 363 states and 498 transitions. [2022-02-20 18:18:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 498 transitions. [2022-02-20 18:18:56,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:56,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:56,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:56,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:18:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2022-02-20 18:18:56,746 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2022-02-20 18:18:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:56,746 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2022-02-20 18:18:56,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:18:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2022-02-20 18:18:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:18:56,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:56,748 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] [2022-02-20 18:18:56,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:18:56,748 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2022-02-20 18:18:56,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:56,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276483382] [2022-02-20 18:18:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:56,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:18:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {4068#(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); {4029#true} is VALID [2022-02-20 18:18:56,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4029#true} {4029#true} #313#return; {4029#true} is VALID [2022-02-20 18:18:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:18:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {4069#(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); {4029#true} is VALID [2022-02-20 18:18:56,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume !(0 == ~q_write_ev~0); {4029#true} is VALID [2022-02-20 18:18:56,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #315#return; {4029#true} is VALID [2022-02-20 18:18:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:18:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#true} havoc ~__retres1~0; {4029#true} is VALID [2022-02-20 18:18:56,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume !(1 == ~p_dw_pc~0); {4029#true} is VALID [2022-02-20 18:18:56,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} ~__retres1~0 := 0; {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:18:56,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,902 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4029#true} #309#return; {4077#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:18:56,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:18:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#true} havoc ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume 1 == ~c_dr_pc~0; {4029#true} is VALID [2022-02-20 18:18:56,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4029#true} is VALID [2022-02-20 18:18:56,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {4029#true} #res := ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,907 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4029#true} {4030#false} #311#return; {4030#false} is VALID [2022-02-20 18:18:56,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {4070#(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; {4029#true} is VALID [2022-02-20 18:18:56,908 INFO L272 TraceCheckUtils]: 1: Hoare triple {4029#true} call #t~ret7 := is_do_write_p_triggered(); {4029#true} is VALID [2022-02-20 18:18:56,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} havoc ~__retres1~0; {4029#true} is VALID [2022-02-20 18:18:56,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {4029#true} assume !(1 == ~p_dw_pc~0); {4029#true} is VALID [2022-02-20 18:18:56,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {4029#true} ~__retres1~0 := 0; {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:18:56,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,910 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4029#true} #309#return; {4077#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:18:56,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {4077#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {4078#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} is VALID [2022-02-20 18:18:56,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {4078#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4030#false} is VALID [2022-02-20 18:18:56,911 INFO L272 TraceCheckUtils]: 10: Hoare triple {4030#false} call #t~ret8 := is_do_read_c_triggered(); {4029#true} is VALID [2022-02-20 18:18:56,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#true} havoc ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#true} assume 1 == ~c_dr_pc~0; {4029#true} is VALID [2022-02-20 18:18:56,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4029#true} is VALID [2022-02-20 18:18:56,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} #res := ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,912 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4029#true} {4030#false} #311#return; {4030#false} is VALID [2022-02-20 18:18:56,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {4030#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {4030#false} is VALID [2022-02-20 18:18:56,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {4030#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4030#false} is VALID [2022-02-20 18:18:56,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {4030#false} assume true; {4030#false} is VALID [2022-02-20 18:18:56,913 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4030#false} {4029#true} #317#return; {4030#false} is VALID [2022-02-20 18:18:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:18:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {4069#(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); {4029#true} is VALID [2022-02-20 18:18:56,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4029#true} is VALID [2022-02-20 18:18:56,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4030#false} #319#return; {4030#false} is VALID [2022-02-20 18:18:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:18:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:56,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#true} havoc ~__retres1~2; {4029#true} is VALID [2022-02-20 18:18:56,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4029#true} is VALID [2022-02-20 18:18:56,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} #res := ~__retres1~2; {4029#true} is VALID [2022-02-20 18:18:56,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,922 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4029#true} {4030#false} #321#return; {4030#false} is VALID [2022-02-20 18:18:56,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#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; {4029#true} is VALID [2022-02-20 18:18:56,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {4029#true} is VALID [2022-02-20 18:18:56,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {4029#true} is VALID [2022-02-20 18:18:56,923 INFO L272 TraceCheckUtils]: 3: Hoare triple {4029#true} call update_channels(); {4068#(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 18:18:56,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {4068#(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); {4029#true} is VALID [2022-02-20 18:18:56,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,924 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4029#true} {4029#true} #313#return; {4029#true} is VALID [2022-02-20 18:18:56,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {4029#true} assume { :begin_inline_init_threads } true; {4029#true} is VALID [2022-02-20 18:18:56,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {4029#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4029#true} is VALID [2022-02-20 18:18:56,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {4029#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4029#true} is VALID [2022-02-20 18:18:56,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {4029#true} assume { :end_inline_init_threads } true; {4029#true} is VALID [2022-02-20 18:18:56,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {4029#true} call fire_delta_events(); {4069#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:56,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {4069#(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); {4029#true} is VALID [2022-02-20 18:18:56,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#true} assume !(0 == ~q_write_ev~0); {4029#true} is VALID [2022-02-20 18:18:56,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,926 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4029#true} {4029#true} #315#return; {4029#true} is VALID [2022-02-20 18:18:56,926 INFO L272 TraceCheckUtils]: 16: Hoare triple {4029#true} call activate_threads(); {4070#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:18:56,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {4070#(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; {4029#true} is VALID [2022-02-20 18:18:56,927 INFO L272 TraceCheckUtils]: 18: Hoare triple {4029#true} call #t~ret7 := is_do_write_p_triggered(); {4029#true} is VALID [2022-02-20 18:18:56,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#true} havoc ~__retres1~0; {4029#true} is VALID [2022-02-20 18:18:56,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {4029#true} assume !(1 == ~p_dw_pc~0); {4029#true} is VALID [2022-02-20 18:18:56,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {4029#true} ~__retres1~0 := 0; {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:18:56,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {4085#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:18:56,929 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4086#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4029#true} #309#return; {4077#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:18:56,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {4077#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {4078#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} is VALID [2022-02-20 18:18:56,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {4078#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4030#false} is VALID [2022-02-20 18:18:56,930 INFO L272 TraceCheckUtils]: 27: Hoare triple {4030#false} call #t~ret8 := is_do_read_c_triggered(); {4029#true} is VALID [2022-02-20 18:18:56,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {4029#true} havoc ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {4029#true} assume 1 == ~c_dr_pc~0; {4029#true} is VALID [2022-02-20 18:18:56,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {4029#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4029#true} is VALID [2022-02-20 18:18:56,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {4029#true} #res := ~__retres1~1; {4029#true} is VALID [2022-02-20 18:18:56,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,932 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4029#true} {4030#false} #311#return; {4030#false} is VALID [2022-02-20 18:18:56,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {4030#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {4030#false} is VALID [2022-02-20 18:18:56,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {4030#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4030#false} is VALID [2022-02-20 18:18:56,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {4030#false} assume true; {4030#false} is VALID [2022-02-20 18:18:56,932 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4030#false} {4029#true} #317#return; {4030#false} is VALID [2022-02-20 18:18:56,932 INFO L272 TraceCheckUtils]: 38: Hoare triple {4030#false} call reset_delta_events(); {4069#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:56,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {4069#(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); {4029#true} is VALID [2022-02-20 18:18:56,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {4029#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4029#true} is VALID [2022-02-20 18:18:56,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,933 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4029#true} {4030#false} #319#return; {4030#false} is VALID [2022-02-20 18:18:56,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-02-20 18:18:56,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {4030#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {4030#false} is VALID [2022-02-20 18:18:56,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-02-20 18:18:56,934 INFO L272 TraceCheckUtils]: 46: Hoare triple {4030#false} call eval_#t~ret9#1 := exists_runnable_thread(); {4029#true} is VALID [2022-02-20 18:18:56,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {4029#true} havoc ~__retres1~2; {4029#true} is VALID [2022-02-20 18:18:56,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {4029#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4029#true} is VALID [2022-02-20 18:18:56,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {4029#true} #res := ~__retres1~2; {4029#true} is VALID [2022-02-20 18:18:56,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-02-20 18:18:56,935 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4029#true} {4030#false} #321#return; {4030#false} is VALID [2022-02-20 18:18:56,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {4030#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {4030#false} is VALID [2022-02-20 18:18:56,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {4030#false} assume 0 != eval_~tmp___1~0#1; {4030#false} is VALID [2022-02-20 18:18:56,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {4030#false} assume !(0 == ~p_dw_st~0); {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {4030#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {4030#false} assume 0 != eval_~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; {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {4030#false} assume 0 == ~c_dr_pc~0; {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {4030#false} assume !(1 == ~q_free~0); {4030#false} is VALID [2022-02-20 18:18:56,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {4030#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; {4030#false} is VALID [2022-02-20 18:18:56,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {4030#false} assume !(~p_last_write~0 == ~c_last_read~0); {4030#false} is VALID [2022-02-20 18:18:56,937 INFO L272 TraceCheckUtils]: 62: Hoare triple {4030#false} call error(); {4030#false} is VALID [2022-02-20 18:18:56,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-02-20 18:18:56,937 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 18:18:56,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:56,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276483382] [2022-02-20 18:18:56,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276483382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:56,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:56,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:18:56,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117484051] [2022-02-20 18:18:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:56,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:56,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:56,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:56,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:18:56,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:18:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:18:56,994 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:58,136 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2022-02-20 18:18:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:18:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:18:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 287 transitions. [2022-02-20 18:18:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 287 transitions. [2022-02-20 18:18:58,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 287 transitions. [2022-02-20 18:18:58,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:58,356 INFO L225 Difference]: With dead ends: 590 [2022-02-20 18:18:58,356 INFO L226 Difference]: Without dead ends: 323 [2022-02-20 18:18:58,357 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 18:18:58,358 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:58,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 528 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:18:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-02-20 18:18:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2022-02-20 18:18:58,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:58,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:18:58,389 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:18:58,390 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:18:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:58,402 INFO L93 Difference]: Finished difference Result 323 states and 439 transitions. [2022-02-20 18:18:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 439 transitions. [2022-02-20 18:18:58,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:58,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:58,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) Second operand 323 states. [2022-02-20 18:18:58,405 INFO L87 Difference]: Start difference. First operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) Second operand 323 states. [2022-02-20 18:18:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:58,417 INFO L93 Difference]: Finished difference Result 323 states and 439 transitions. [2022-02-20 18:18:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 439 transitions. [2022-02-20 18:18:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:58,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:58,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:58,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:18:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2022-02-20 18:18:58,430 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2022-02-20 18:18:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:58,430 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2022-02-20 18:18:58,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:18:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2022-02-20 18:18:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:18:58,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:58,432 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] [2022-02-20 18:18:58,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:18:58,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2022-02-20 18:18:58,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:58,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773111428] [2022-02-20 18:18:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:18:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {5995#(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); {5955#true} is VALID [2022-02-20 18:18:58,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5955#true} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #313#return; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:18:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#(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); {5955#true} is VALID [2022-02-20 18:18:58,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume !(0 == ~q_write_ev~0); {5955#true} is VALID [2022-02-20 18:18:58,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5955#true} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #315#return; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:18:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {5955#true} havoc ~__retres1~0; {5955#true} is VALID [2022-02-20 18:18:58,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume !(1 == ~p_dw_pc~0); {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,561 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5955#true} #309#return; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:18:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {5955#true} havoc ~__retres1~1; {5955#true} is VALID [2022-02-20 18:18:58,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume 1 == ~c_dr_pc~0; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,590 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #311#return; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {5997#(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; {5955#true} is VALID [2022-02-20 18:18:58,591 INFO L272 TraceCheckUtils]: 1: Hoare triple {5955#true} call #t~ret7 := is_do_write_p_triggered(); {5955#true} is VALID [2022-02-20 18:18:58,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} havoc ~__retres1~0; {5955#true} is VALID [2022-02-20 18:18:58,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {5955#true} assume !(1 == ~p_dw_pc~0); {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5955#true} #309#return; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,594 INFO L272 TraceCheckUtils]: 10: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret8 := is_do_read_c_triggered(); {5955#true} is VALID [2022-02-20 18:18:58,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {5955#true} havoc ~__retres1~1; {5955#true} is VALID [2022-02-20 18:18:58,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {5955#true} assume 1 == ~c_dr_pc~0; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #311#return; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,600 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #317#return; {5956#false} is VALID [2022-02-20 18:18:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:18:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#(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); {5955#true} is VALID [2022-02-20 18:18:58,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5955#true} is VALID [2022-02-20 18:18:58,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5955#true} {5956#false} #319#return; {5956#false} is VALID [2022-02-20 18:18:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:18:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:58,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {5955#true} havoc ~__retres1~2; {5955#true} is VALID [2022-02-20 18:18:58,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5955#true} is VALID [2022-02-20 18:18:58,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} #res := ~__retres1~2; {5955#true} is VALID [2022-02-20 18:18:58,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,612 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5955#true} {5956#false} #321#return; {5956#false} is VALID [2022-02-20 18:18:58,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {5955#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; {5955#true} is VALID [2022-02-20 18:18:58,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,615 INFO L272 TraceCheckUtils]: 3: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels(); {5995#(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 18:18:58,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {5995#(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); {5955#true} is VALID [2022-02-20 18:18:58,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,620 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5955#true} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #313#return; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads } true; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads } true; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events(); {5996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:58,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5996#(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); {5955#true} is VALID [2022-02-20 18:18:58,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5955#true} assume !(0 == ~q_write_ev~0); {5955#true} is VALID [2022-02-20 18:18:58,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,624 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5955#true} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #315#return; {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:18:58,624 INFO L272 TraceCheckUtils]: 16: Hoare triple {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads(); {5997#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:18:58,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {5997#(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; {5955#true} is VALID [2022-02-20 18:18:58,625 INFO L272 TraceCheckUtils]: 18: Hoare triple {5955#true} call #t~ret7 := is_do_write_p_triggered(); {5955#true} is VALID [2022-02-20 18:18:58,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#true} havoc ~__retres1~0; {5955#true} is VALID [2022-02-20 18:18:58,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {5955#true} assume !(1 == ~p_dw_pc~0); {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,627 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5955#true} #309#return; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:18:58,628 INFO L272 TraceCheckUtils]: 27: Hoare triple {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret8 := is_do_read_c_triggered(); {5955#true} is VALID [2022-02-20 18:18:58,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {5955#true} havoc ~__retres1~1; {5955#true} is VALID [2022-02-20 18:18:58,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {5955#true} assume 1 == ~c_dr_pc~0; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:18:58,630 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6012#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6004#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #311#return; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 18:18:58,633 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6011#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {5957#(= ~c_dr_pc~0 ~p_dw_pc~0)} #317#return; {5956#false} is VALID [2022-02-20 18:18:58,633 INFO L272 TraceCheckUtils]: 38: Hoare triple {5956#false} call reset_delta_events(); {5996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:18:58,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {5996#(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); {5955#true} is VALID [2022-02-20 18:18:58,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {5955#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5955#true} is VALID [2022-02-20 18:18:58,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,633 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5955#true} {5956#false} #319#return; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L272 TraceCheckUtils]: 46: Hoare triple {5956#false} call eval_#t~ret9#1 := exists_runnable_thread(); {5955#true} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {5955#true} havoc ~__retres1~2; {5955#true} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {5955#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5955#true} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {5955#true} #res := ~__retres1~2; {5955#true} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-02-20 18:18:58,634 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5955#true} {5956#false} #321#return; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {5956#false} is VALID [2022-02-20 18:18:58,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {5956#false} assume 0 != eval_~tmp___1~0#1; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {5956#false} assume !(0 == ~p_dw_st~0); {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {5956#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {5956#false} assume 0 != eval_~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; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#false} assume 0 == ~c_dr_pc~0; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#false} assume !(1 == ~q_free~0); {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {5956#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; {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {5956#false} assume !(~p_last_write~0 == ~c_last_read~0); {5956#false} is VALID [2022-02-20 18:18:58,635 INFO L272 TraceCheckUtils]: 62: Hoare triple {5956#false} call error(); {5956#false} is VALID [2022-02-20 18:18:58,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-02-20 18:18:58,637 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 18:18:58,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:58,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773111428] [2022-02-20 18:18:58,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773111428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:58,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:58,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:18:58,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500005038] [2022-02-20 18:18:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-02-20 18:18:58,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:58,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:18:58,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:58,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:18:58,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:18:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:18:58,681 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:19:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:03,117 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2022-02-20 18:19:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 18:19:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-02-20 18:19:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:19:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 936 transitions. [2022-02-20 18:19:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:19:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 936 transitions. [2022-02-20 18:19:03,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 936 transitions. [2022-02-20 18:19:03,940 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 18:19:04,114 INFO L225 Difference]: With dead ends: 1956 [2022-02-20 18:19:04,115 INFO L226 Difference]: Without dead ends: 1684 [2022-02-20 18:19:04,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:19:04,118 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1150 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:04,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1168 Valid, 862 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 18:19:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-02-20 18:19:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2022-02-20 18:19:04,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:04,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1684 states. Second operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:04,695 INFO L74 IsIncluded]: Start isIncluded. First operand 1684 states. Second operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:04,698 INFO L87 Difference]: Start difference. First operand 1684 states. Second operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:04,850 INFO L93 Difference]: Finished difference Result 1684 states and 2206 transitions. [2022-02-20 18:19:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2206 transitions. [2022-02-20 18:19:04,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:04,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:04,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) Second operand 1684 states. [2022-02-20 18:19:04,861 INFO L87 Difference]: Start difference. First operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) Second operand 1684 states. [2022-02-20 18:19:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:05,003 INFO L93 Difference]: Finished difference Result 1684 states and 2206 transitions. [2022-02-20 18:19:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2206 transitions. [2022-02-20 18:19:05,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:05,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:05,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:05,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2022-02-20 18:19:05,137 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2022-02-20 18:19:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:05,137 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2022-02-20 18:19:05,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:19:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2022-02-20 18:19:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:19:05,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:05,139 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] [2022-02-20 18:19:05,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:19:05,140 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2022-02-20 18:19:05,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:05,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001974632] [2022-02-20 18:19:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {14027#(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); {13988#true} is VALID [2022-02-20 18:19:05,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13988#true} {13988#true} #313#return; {13988#true} is VALID [2022-02-20 18:19:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {14028#(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); {13988#true} is VALID [2022-02-20 18:19:05,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume !(0 == ~q_write_ev~0); {13988#true} is VALID [2022-02-20 18:19:05,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13988#true} {13988#true} #315#return; {13988#true} is VALID [2022-02-20 18:19:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {13988#true} havoc ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume !(1 == ~p_dw_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} ~__retres1~0 := 0; {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {13988#true} #res := ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13988#true} {13988#true} #309#return; {13988#true} is VALID [2022-02-20 18:19:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {13988#true} havoc ~__retres1~1; {13988#true} is VALID [2022-02-20 18:19:05,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume !(1 == ~c_dr_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} ~__retres1~1 := 0; {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:05,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,294 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13988#true} #311#return; {14042#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:05,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {14029#(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; {13988#true} is VALID [2022-02-20 18:19:05,294 INFO L272 TraceCheckUtils]: 1: Hoare triple {13988#true} call #t~ret7 := is_do_write_p_triggered(); {13988#true} is VALID [2022-02-20 18:19:05,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} havoc ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {13988#true} assume !(1 == ~p_dw_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {13988#true} ~__retres1~0 := 0; {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {13988#true} #res := ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13988#true} {13988#true} #309#return; {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {13988#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {13988#true} is VALID [2022-02-20 18:19:05,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {13988#true} assume !(0 != ~tmp~1); {13988#true} is VALID [2022-02-20 18:19:05,296 INFO L272 TraceCheckUtils]: 10: Hoare triple {13988#true} call #t~ret8 := is_do_read_c_triggered(); {13988#true} is VALID [2022-02-20 18:19:05,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {13988#true} havoc ~__retres1~1; {13988#true} is VALID [2022-02-20 18:19:05,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {13988#true} assume !(1 == ~c_dr_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {13988#true} ~__retres1~1 := 0; {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:05,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,298 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13988#true} #311#return; {14042#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:05,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {14042#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {14043#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} is VALID [2022-02-20 18:19:05,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {14043#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13989#false} is VALID [2022-02-20 18:19:05,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {13989#false} assume true; {13989#false} is VALID [2022-02-20 18:19:05,300 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13989#false} {13988#true} #317#return; {13989#false} is VALID [2022-02-20 18:19:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {14028#(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); {13988#true} is VALID [2022-02-20 18:19:05,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13988#true} is VALID [2022-02-20 18:19:05,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13988#true} {13989#false} #319#return; {13989#false} is VALID [2022-02-20 18:19:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {13988#true} havoc ~__retres1~2; {13988#true} is VALID [2022-02-20 18:19:05,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13988#true} is VALID [2022-02-20 18:19:05,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} #res := ~__retres1~2; {13988#true} is VALID [2022-02-20 18:19:05,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13988#true} {13989#false} #321#return; {13989#false} is VALID [2022-02-20 18:19:05,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {13988#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; {13988#true} is VALID [2022-02-20 18:19:05,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {13988#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {13988#true} is VALID [2022-02-20 18:19:05,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {13988#true} is VALID [2022-02-20 18:19:05,314 INFO L272 TraceCheckUtils]: 3: Hoare triple {13988#true} call update_channels(); {14027#(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 18:19:05,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {14027#(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); {13988#true} is VALID [2022-02-20 18:19:05,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,314 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13988#true} {13988#true} #313#return; {13988#true} is VALID [2022-02-20 18:19:05,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {13988#true} assume { :begin_inline_init_threads } true; {13988#true} is VALID [2022-02-20 18:19:05,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {13988#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13988#true} is VALID [2022-02-20 18:19:05,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {13988#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13988#true} is VALID [2022-02-20 18:19:05,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {13988#true} assume { :end_inline_init_threads } true; {13988#true} is VALID [2022-02-20 18:19:05,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {13988#true} call fire_delta_events(); {14028#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:05,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {14028#(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); {13988#true} is VALID [2022-02-20 18:19:05,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {13988#true} assume !(0 == ~q_write_ev~0); {13988#true} is VALID [2022-02-20 18:19:05,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,316 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13988#true} {13988#true} #315#return; {13988#true} is VALID [2022-02-20 18:19:05,317 INFO L272 TraceCheckUtils]: 16: Hoare triple {13988#true} call activate_threads(); {14029#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:19:05,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {14029#(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; {13988#true} is VALID [2022-02-20 18:19:05,317 INFO L272 TraceCheckUtils]: 18: Hoare triple {13988#true} call #t~ret7 := is_do_write_p_triggered(); {13988#true} is VALID [2022-02-20 18:19:05,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {13988#true} havoc ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {13988#true} assume !(1 == ~p_dw_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {13988#true} ~__retres1~0 := 0; {13988#true} is VALID [2022-02-20 18:19:05,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {13988#true} #res := ~__retres1~0; {13988#true} is VALID [2022-02-20 18:19:05,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,318 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13988#true} {13988#true} #309#return; {13988#true} is VALID [2022-02-20 18:19:05,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {13988#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {13988#true} is VALID [2022-02-20 18:19:05,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {13988#true} assume !(0 != ~tmp~1); {13988#true} is VALID [2022-02-20 18:19:05,319 INFO L272 TraceCheckUtils]: 27: Hoare triple {13988#true} call #t~ret8 := is_do_read_c_triggered(); {13988#true} is VALID [2022-02-20 18:19:05,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {13988#true} havoc ~__retres1~1; {13988#true} is VALID [2022-02-20 18:19:05,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {13988#true} assume !(1 == ~c_dr_pc~0); {13988#true} is VALID [2022-02-20 18:19:05,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {13988#true} ~__retres1~1 := 0; {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:05,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {14044#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:05,321 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14045#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13988#true} #311#return; {14042#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:05,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {14042#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {14043#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} is VALID [2022-02-20 18:19:05,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {14043#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13989#false} is VALID [2022-02-20 18:19:05,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#false} assume true; {13989#false} is VALID [2022-02-20 18:19:05,323 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13989#false} {13988#true} #317#return; {13989#false} is VALID [2022-02-20 18:19:05,323 INFO L272 TraceCheckUtils]: 38: Hoare triple {13989#false} call reset_delta_events(); {14028#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:05,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {14028#(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); {13988#true} is VALID [2022-02-20 18:19:05,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {13988#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13988#true} is VALID [2022-02-20 18:19:05,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,323 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13988#true} {13989#false} #319#return; {13989#false} is VALID [2022-02-20 18:19:05,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {13989#false} assume !false; {13989#false} is VALID [2022-02-20 18:19:05,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {13989#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {13989#false} is VALID [2022-02-20 18:19:05,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {13989#false} assume !false; {13989#false} is VALID [2022-02-20 18:19:05,324 INFO L272 TraceCheckUtils]: 46: Hoare triple {13989#false} call eval_#t~ret9#1 := exists_runnable_thread(); {13988#true} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {13988#true} havoc ~__retres1~2; {13988#true} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {13988#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13988#true} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {13988#true} #res := ~__retres1~2; {13988#true} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {13988#true} assume true; {13988#true} is VALID [2022-02-20 18:19:05,327 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13988#true} {13989#false} #321#return; {13989#false} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {13989#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {13989#false} assume 0 != eval_~tmp___1~0#1; {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {13989#false} assume !(0 == ~p_dw_st~0); {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {13989#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {13989#false} assume 0 != eval_~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; {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {13989#false} assume 0 == ~c_dr_pc~0; {13989#false} is VALID [2022-02-20 18:19:05,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {13989#false} assume !false; {13989#false} is VALID [2022-02-20 18:19:05,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {13989#false} assume !(1 == ~q_free~0); {13989#false} is VALID [2022-02-20 18:19:05,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {13989#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; {13989#false} is VALID [2022-02-20 18:19:05,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {13989#false} assume !(~p_last_write~0 == ~c_last_read~0); {13989#false} is VALID [2022-02-20 18:19:05,329 INFO L272 TraceCheckUtils]: 62: Hoare triple {13989#false} call error(); {13989#false} is VALID [2022-02-20 18:19:05,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {13989#false} assume !false; {13989#false} is VALID [2022-02-20 18:19:05,330 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 18:19:05,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:05,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001974632] [2022-02-20 18:19:05,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001974632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:05,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:05,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:19:05,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470780957] [2022-02-20 18:19:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:05,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:05,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:19:05,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:05,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:19:05,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:19:05,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:19:05,373 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:19:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:07,630 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2022-02-20 18:19:07,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:19:07,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:19:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2022-02-20 18:19:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:19:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2022-02-20 18:19:07,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 289 transitions. [2022-02-20 18:19:07,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:08,040 INFO L225 Difference]: With dead ends: 3035 [2022-02-20 18:19:08,040 INFO L226 Difference]: Without dead ends: 1623 [2022-02-20 18:19:08,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:19:08,045 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 112 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:08,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 526 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:19:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-02-20 18:19:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2022-02-20 18:19:08,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:08,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1623 states. Second operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:08,711 INFO L74 IsIncluded]: Start isIncluded. First operand 1623 states. Second operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:08,715 INFO L87 Difference]: Start difference. First operand 1623 states. Second operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:08,852 INFO L93 Difference]: Finished difference Result 1623 states and 2101 transitions. [2022-02-20 18:19:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2101 transitions. [2022-02-20 18:19:08,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:08,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:08,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) Second operand 1623 states. [2022-02-20 18:19:08,877 INFO L87 Difference]: Start difference. First operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) Second operand 1623 states. [2022-02-20 18:19:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:09,008 INFO L93 Difference]: Finished difference Result 1623 states and 2101 transitions. [2022-02-20 18:19:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2101 transitions. [2022-02-20 18:19:09,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:09,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:09,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:09,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2022-02-20 18:19:09,148 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2022-02-20 18:19:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:09,148 INFO L470 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2022-02-20 18:19:09,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 18:19:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2022-02-20 18:19:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:19:09,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:09,151 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] [2022-02-20 18:19:09,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:19:09,151 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:09,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2022-02-20 18:19:09,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:09,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539052056] [2022-02-20 18:19:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {23378#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #313#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {23379#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {23379#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #315#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {23338#true} havoc ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {23338#true} assume !(1 == ~p_dw_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {23338#true} ~__retres1~0 := 0; {23338#true} is VALID [2022-02-20 18:19:09,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {23338#true} #res := ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,251 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23338#true} {23338#true} #309#return; {23338#true} is VALID [2022-02-20 18:19:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {23338#true} havoc ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {23338#true} assume !(1 == ~c_dr_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {23338#true} ~__retres1~1 := 0; {23338#true} is VALID [2022-02-20 18:19:09,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {23338#true} #res := ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,254 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23338#true} {23338#true} #311#return; {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {23380#(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; {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L272 TraceCheckUtils]: 1: Hoare triple {23338#true} call #t~ret7 := is_do_write_p_triggered(); {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {23338#true} havoc ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {23338#true} assume !(1 == ~p_dw_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {23338#true} ~__retres1~0 := 0; {23338#true} is VALID [2022-02-20 18:19:09,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {23338#true} #res := ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23338#true} {23338#true} #309#return; {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {23338#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {23338#true} assume !(0 != ~tmp~1); {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {23338#true} call #t~ret8 := is_do_read_c_triggered(); {23338#true} is VALID [2022-02-20 18:19:09,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {23338#true} havoc ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {23338#true} assume !(1 == ~c_dr_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {23338#true} ~__retres1~1 := 0; {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {23338#true} #res := ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23338#true} {23338#true} #311#return; {23338#true} is VALID [2022-02-20 18:19:09,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {23338#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {23338#true} is VALID [2022-02-20 18:19:09,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {23338#true} assume !(0 != ~tmp___0~1); {23338#true} is VALID [2022-02-20 18:19:09,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,258 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23338#true} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #317#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {23379#(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); {23393#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 18:19:09,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {23393#(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; {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #319#return; {23339#false} is VALID [2022-02-20 18:19:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {23338#true} havoc ~__retres1~2; {23338#true} is VALID [2022-02-20 18:19:09,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {23338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23338#true} is VALID [2022-02-20 18:19:09,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {23338#true} #res := ~__retres1~2; {23338#true} is VALID [2022-02-20 18:19:09,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,283 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23338#true} {23339#false} #321#return; {23339#false} is VALID [2022-02-20 18:19:09,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {23338#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; {23338#true} is VALID [2022-02-20 18:19:09,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {23338#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,285 INFO L272 TraceCheckUtils]: 3: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels(); {23378#(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 18:19:09,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {23378#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,286 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #313#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads } true; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads } true; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,288 INFO L272 TraceCheckUtils]: 11: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events(); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {23379#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {23379#(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); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #315#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,291 INFO L272 TraceCheckUtils]: 16: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads(); {23380#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:19:09,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {23380#(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; {23338#true} is VALID [2022-02-20 18:19:09,291 INFO L272 TraceCheckUtils]: 18: Hoare triple {23338#true} call #t~ret7 := is_do_write_p_triggered(); {23338#true} is VALID [2022-02-20 18:19:09,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {23338#true} havoc ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {23338#true} assume !(1 == ~p_dw_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {23338#true} ~__retres1~0 := 0; {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {23338#true} #res := ~__retres1~0; {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23338#true} {23338#true} #309#return; {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {23338#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {23338#true} is VALID [2022-02-20 18:19:09,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {23338#true} assume !(0 != ~tmp~1); {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L272 TraceCheckUtils]: 27: Hoare triple {23338#true} call #t~ret8 := is_do_read_c_triggered(); {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {23338#true} havoc ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {23338#true} assume !(1 == ~c_dr_pc~0); {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {23338#true} ~__retres1~1 := 0; {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {23338#true} #res := ~__retres1~1; {23338#true} is VALID [2022-02-20 18:19:09,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,294 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23338#true} {23338#true} #311#return; {23338#true} is VALID [2022-02-20 18:19:09,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {23338#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {23338#true} is VALID [2022-02-20 18:19:09,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {23338#true} assume !(0 != ~tmp___0~1); {23338#true} is VALID [2022-02-20 18:19:09,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,294 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23338#true} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #317#return; {23340#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,295 INFO L272 TraceCheckUtils]: 38: Hoare triple {23340#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events(); {23379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:09,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {23379#(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); {23393#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 18:19:09,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {23393#(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; {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,297 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23394#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {23340#(= ~q_write_ev~0 ~q_read_ev~0)} #319#return; {23339#false} is VALID [2022-02-20 18:19:09,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {23339#false} assume !false; {23339#false} is VALID [2022-02-20 18:19:09,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {23339#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {23339#false} is VALID [2022-02-20 18:19:09,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {23339#false} assume !false; {23339#false} is VALID [2022-02-20 18:19:09,297 INFO L272 TraceCheckUtils]: 46: Hoare triple {23339#false} call eval_#t~ret9#1 := exists_runnable_thread(); {23338#true} is VALID [2022-02-20 18:19:09,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {23338#true} havoc ~__retres1~2; {23338#true} is VALID [2022-02-20 18:19:09,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {23338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23338#true} is VALID [2022-02-20 18:19:09,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {23338#true} #res := ~__retres1~2; {23338#true} is VALID [2022-02-20 18:19:09,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {23338#true} assume true; {23338#true} is VALID [2022-02-20 18:19:09,298 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {23338#true} {23339#false} #321#return; {23339#false} is VALID [2022-02-20 18:19:09,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {23339#false} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {23339#false} is VALID [2022-02-20 18:19:09,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {23339#false} assume 0 != eval_~tmp___1~0#1; {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {23339#false} assume !(0 == ~p_dw_st~0); {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {23339#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {23339#false} assume 0 != eval_~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; {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {23339#false} assume 0 == ~c_dr_pc~0; {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {23339#false} assume !false; {23339#false} is VALID [2022-02-20 18:19:09,299 INFO L290 TraceCheckUtils]: 59: Hoare triple {23339#false} assume !(1 == ~q_free~0); {23339#false} is VALID [2022-02-20 18:19:09,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {23339#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; {23339#false} is VALID [2022-02-20 18:19:09,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {23339#false} assume !(~p_last_write~0 == ~c_last_read~0); {23339#false} is VALID [2022-02-20 18:19:09,300 INFO L272 TraceCheckUtils]: 62: Hoare triple {23339#false} call error(); {23339#false} is VALID [2022-02-20 18:19:09,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {23339#false} assume !false; {23339#false} is VALID [2022-02-20 18:19:09,300 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 18:19:09,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:09,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539052056] [2022-02-20 18:19:09,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539052056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:09,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:09,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:19:09,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436950571] [2022-02-20 18:19:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:09,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:09,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:19:09,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:09,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:19:09,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:09,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:19:09,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:19:09,346 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:19:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:11,975 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2022-02-20 18:19:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:19:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:19:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 460 transitions. [2022-02-20 18:19:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:19:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 460 transitions. [2022-02-20 18:19:11,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 460 transitions. [2022-02-20 18:19:12,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:12,482 INFO L225 Difference]: With dead ends: 2914 [2022-02-20 18:19:12,482 INFO L226 Difference]: Without dead ends: 1677 [2022-02-20 18:19:12,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:19:12,485 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 332 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:12,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 469 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:19:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-02-20 18:19:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2022-02-20 18:19:13,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:13,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1677 states. Second operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:13,115 INFO L74 IsIncluded]: Start isIncluded. First operand 1677 states. Second operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:13,117 INFO L87 Difference]: Start difference. First operand 1677 states. Second operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:13,250 INFO L93 Difference]: Finished difference Result 1677 states and 2148 transitions. [2022-02-20 18:19:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2148 transitions. [2022-02-20 18:19:13,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:13,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:13,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) Second operand 1677 states. [2022-02-20 18:19:13,259 INFO L87 Difference]: Start difference. First operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) Second operand 1677 states. [2022-02-20 18:19:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:13,377 INFO L93 Difference]: Finished difference Result 1677 states and 2148 transitions. [2022-02-20 18:19:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2148 transitions. [2022-02-20 18:19:13,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:13,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:13,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:13,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2022-02-20 18:19:13,540 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2022-02-20 18:19:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:13,540 INFO L470 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2022-02-20 18:19:13,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 18:19:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2022-02-20 18:19:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:19:13,542 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:13,542 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] [2022-02-20 18:19:13,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:19:13,542 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2022-02-20 18:19:13,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:13,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102352990] [2022-02-20 18:19:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {32641#(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); {32601#true} is VALID [2022-02-20 18:19:13,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32601#true} {32601#true} #313#return; {32601#true} is VALID [2022-02-20 18:19:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {32642#(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); {32601#true} is VALID [2022-02-20 18:19:13,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume !(0 == ~q_write_ev~0); {32601#true} is VALID [2022-02-20 18:19:13,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32601#true} {32606#(= ~p_dw_st~0 0)} #315#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#true} havoc ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume !(1 == ~p_dw_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} ~__retres1~0 := 0; {32601#true} is VALID [2022-02-20 18:19:13,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {32601#true} #res := ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,642 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #309#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#true} havoc ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume !(1 == ~c_dr_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} ~__retres1~1 := 0; {32601#true} is VALID [2022-02-20 18:19:13,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {32601#true} #res := ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,650 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #311#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {32643#(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; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,650 INFO L272 TraceCheckUtils]: 1: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret7 := is_do_write_p_triggered(); {32601#true} is VALID [2022-02-20 18:19:13,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} havoc ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {32601#true} assume !(1 == ~p_dw_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {32601#true} ~__retres1~0 := 0; {32601#true} is VALID [2022-02-20 18:19:13,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {32601#true} #res := ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,652 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #309#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,653 INFO L272 TraceCheckUtils]: 10: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_read_c_triggered(); {32601#true} is VALID [2022-02-20 18:19:13,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {32601#true} havoc ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {32601#true} assume !(1 == ~c_dr_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {32601#true} ~__retres1~1 := 0; {32601#true} is VALID [2022-02-20 18:19:13,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {32601#true} #res := ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,654 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #311#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,656 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {32606#(= ~p_dw_st~0 0)} #317#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {32642#(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); {32601#true} is VALID [2022-02-20 18:19:13,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume !(1 == ~q_write_ev~0); {32601#true} is VALID [2022-02-20 18:19:13,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32601#true} {32606#(= ~p_dw_st~0 0)} #319#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#true} havoc ~__retres1~2; {32601#true} is VALID [2022-02-20 18:19:13,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {32606#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {32606#(= ~p_dw_st~0 0)} assume true; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,673 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32606#(= ~p_dw_st~0 0)} {32606#(= ~p_dw_st~0 0)} #321#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#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; {32601#true} is VALID [2022-02-20 18:19:13,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {32601#true} is VALID [2022-02-20 18:19:13,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {32601#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {32601#true} is VALID [2022-02-20 18:19:13,674 INFO L272 TraceCheckUtils]: 3: Hoare triple {32601#true} call update_channels(); {32641#(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 18:19:13,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {32641#(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); {32601#true} is VALID [2022-02-20 18:19:13,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,674 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32601#true} {32601#true} #313#return; {32601#true} is VALID [2022-02-20 18:19:13,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {32601#true} assume { :begin_inline_init_threads } true; {32601#true} is VALID [2022-02-20 18:19:13,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {32601#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {32606#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {32606#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads } true; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {32606#(= ~p_dw_st~0 0)} call fire_delta_events(); {32642#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:13,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {32642#(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); {32601#true} is VALID [2022-02-20 18:19:13,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {32601#true} assume !(0 == ~q_write_ev~0); {32601#true} is VALID [2022-02-20 18:19:13,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32601#true} {32606#(= ~p_dw_st~0 0)} #315#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,678 INFO L272 TraceCheckUtils]: 16: Hoare triple {32606#(= ~p_dw_st~0 0)} call activate_threads(); {32643#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:19:13,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {32643#(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; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,678 INFO L272 TraceCheckUtils]: 18: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret7 := is_do_write_p_triggered(); {32601#true} is VALID [2022-02-20 18:19:13,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {32601#true} havoc ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {32601#true} assume !(1 == ~p_dw_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {32601#true} ~__retres1~0 := 0; {32601#true} is VALID [2022-02-20 18:19:13,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {32601#true} #res := ~__retres1~0; {32601#true} is VALID [2022-02-20 18:19:13,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,679 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #309#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,680 INFO L272 TraceCheckUtils]: 27: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_read_c_triggered(); {32601#true} is VALID [2022-02-20 18:19:13,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {32601#true} havoc ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {32601#true} assume !(1 == ~c_dr_pc~0); {32601#true} is VALID [2022-02-20 18:19:13,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {32601#true} ~__retres1~1 := 0; {32601#true} is VALID [2022-02-20 18:19:13,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {32601#true} #res := ~__retres1~1; {32601#true} is VALID [2022-02-20 18:19:13,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,682 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {32601#true} {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #311#return; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 18:19:13,683 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32644#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {32606#(= ~p_dw_st~0 0)} #317#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,684 INFO L272 TraceCheckUtils]: 38: Hoare triple {32606#(= ~p_dw_st~0 0)} call reset_delta_events(); {32642#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:13,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {32642#(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); {32601#true} is VALID [2022-02-20 18:19:13,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {32601#true} assume !(1 == ~q_write_ev~0); {32601#true} is VALID [2022-02-20 18:19:13,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {32601#true} assume true; {32601#true} is VALID [2022-02-20 18:19:13,685 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32601#true} {32606#(= ~p_dw_st~0 0)} #319#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {32606#(= ~p_dw_st~0 0)} assume !false; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {32606#(= ~p_dw_st~0 0)} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {32606#(= ~p_dw_st~0 0)} assume !false; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,686 INFO L272 TraceCheckUtils]: 46: Hoare triple {32606#(= ~p_dw_st~0 0)} call eval_#t~ret9#1 := exists_runnable_thread(); {32601#true} is VALID [2022-02-20 18:19:13,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {32601#true} havoc ~__retres1~2; {32601#true} is VALID [2022-02-20 18:19:13,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {32601#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {32606#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {32606#(= ~p_dw_st~0 0)} assume true; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,688 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32606#(= ~p_dw_st~0 0)} {32606#(= ~p_dw_st~0 0)} #321#return; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {32606#(= ~p_dw_st~0 0)} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {32606#(= ~p_dw_st~0 0)} assume 0 != eval_~tmp___1~0#1; {32606#(= ~p_dw_st~0 0)} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {32606#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {32602#false} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {32602#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {32602#false} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {32602#false} assume 0 != eval_~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; {32602#false} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {32602#false} assume 0 == ~c_dr_pc~0; {32602#false} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {32602#false} assume !false; {32602#false} is VALID [2022-02-20 18:19:13,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {32602#false} assume !(1 == ~q_free~0); {32602#false} is VALID [2022-02-20 18:19:13,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {32602#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; {32602#false} is VALID [2022-02-20 18:19:13,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {32602#false} assume !(~p_last_write~0 == ~c_last_read~0); {32602#false} is VALID [2022-02-20 18:19:13,690 INFO L272 TraceCheckUtils]: 62: Hoare triple {32602#false} call error(); {32602#false} is VALID [2022-02-20 18:19:13,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {32602#false} assume !false; {32602#false} is VALID [2022-02-20 18:19:13,690 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 18:19:13,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:13,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102352990] [2022-02-20 18:19:13,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102352990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:13,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:13,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:19:13,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777112130] [2022-02-20 18:19:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:13,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:13,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 18:19:13,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:13,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:19:13,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:13,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:19:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:19:13,740 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 18:19:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:16,630 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2022-02-20 18:19:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:19:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 64 [2022-02-20 18:19:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 18:19:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 409 transitions. [2022-02-20 18:19:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 18:19:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 409 transitions. [2022-02-20 18:19:16,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 409 transitions. [2022-02-20 18:19:16,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:17,427 INFO L225 Difference]: With dead ends: 4532 [2022-02-20 18:19:17,427 INFO L226 Difference]: Without dead ends: 3100 [2022-02-20 18:19:17,430 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 18:19:17,430 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 295 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:17,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 377 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:19:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-02-20 18:19:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2022-02-20 18:19:18,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:18,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3100 states. Second operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-02-20 18:19:18,494 INFO L74 IsIncluded]: Start isIncluded. First operand 3100 states. Second operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-02-20 18:19:18,500 INFO L87 Difference]: Start difference. First operand 3100 states. Second operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-02-20 18:19:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:18,922 INFO L93 Difference]: Finished difference Result 3100 states and 3945 transitions. [2022-02-20 18:19:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 3945 transitions. [2022-02-20 18:19:18,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:18,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:18,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) Second operand 3100 states. [2022-02-20 18:19:18,938 INFO L87 Difference]: Start difference. First operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) Second operand 3100 states. [2022-02-20 18:19:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:19,356 INFO L93 Difference]: Finished difference Result 3100 states and 3945 transitions. [2022-02-20 18:19:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 3945 transitions. [2022-02-20 18:19:19,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:19,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:19,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:19,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-02-20 18:19:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2022-02-20 18:19:19,824 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2022-02-20 18:19:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:19,824 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2022-02-20 18:19:19,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 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 18:19:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2022-02-20 18:19:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:19:19,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:19,826 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 18:19:19,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:19:19,827 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2022-02-20 18:19:19,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:19,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702848797] [2022-02-20 18:19:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {48769#(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); {48729#true} is VALID [2022-02-20 18:19:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #313#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {48770#(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); {48729#true} is VALID [2022-02-20 18:19:19,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume !(0 == ~q_write_ev~0); {48729#true} is VALID [2022-02-20 18:19:19,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #315#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {48729#true} havoc ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume !(1 == ~p_dw_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} ~__retres1~0 := 0; {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {48729#true} #res := ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {48729#true} {48729#true} #309#return; {48729#true} is VALID [2022-02-20 18:19:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {48729#true} havoc ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume !(1 == ~c_dr_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} ~__retres1~1 := 0; {48729#true} is VALID [2022-02-20 18:19:19,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {48729#true} #res := ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {48729#true} {48729#true} #311#return; {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {48771#(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; {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L272 TraceCheckUtils]: 1: Hoare triple {48729#true} call #t~ret7 := is_do_write_p_triggered(); {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} havoc ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {48729#true} assume !(1 == ~p_dw_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {48729#true} ~__retres1~0 := 0; {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {48729#true} #res := ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {48729#true} {48729#true} #309#return; {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {48729#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {48729#true} is VALID [2022-02-20 18:19:19,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {48729#true} assume !(0 != ~tmp~1); {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L272 TraceCheckUtils]: 10: Hoare triple {48729#true} call #t~ret8 := is_do_read_c_triggered(); {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {48729#true} havoc ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {48729#true} assume !(1 == ~c_dr_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {48729#true} ~__retres1~1 := 0; {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {48729#true} #res := ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,891 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {48729#true} {48729#true} #311#return; {48729#true} is VALID [2022-02-20 18:19:19,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {48729#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {48729#true} is VALID [2022-02-20 18:19:19,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {48729#true} assume !(0 != ~tmp___0~1); {48729#true} is VALID [2022-02-20 18:19:19,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,892 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #317#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {48770#(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); {48729#true} is VALID [2022-02-20 18:19:19,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume !(1 == ~q_write_ev~0); {48729#true} is VALID [2022-02-20 18:19:19,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #319#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:19,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {48729#true} havoc ~__retres1~2; {48729#true} is VALID [2022-02-20 18:19:19,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {48729#true} is VALID [2022-02-20 18:19:19,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {48729#true} #res := ~__retres1~2; {48729#true} is VALID [2022-02-20 18:19:19,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,902 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #321#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {48729#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; {48729#true} is VALID [2022-02-20 18:19:19,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {48729#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {48731#(= ~q_free~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,904 INFO L272 TraceCheckUtils]: 3: Hoare triple {48731#(= ~q_free~0 1)} call update_channels(); {48769#(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 18:19:19,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {48769#(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); {48729#true} is VALID [2022-02-20 18:19:19,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,904 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #313#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {48731#(= ~q_free~0 1)} assume { :begin_inline_init_threads } true; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {48731#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {48731#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {48731#(= ~q_free~0 1)} assume { :end_inline_init_threads } true; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,906 INFO L272 TraceCheckUtils]: 11: Hoare triple {48731#(= ~q_free~0 1)} call fire_delta_events(); {48770#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:19,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {48770#(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); {48729#true} is VALID [2022-02-20 18:19:19,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {48729#true} assume !(0 == ~q_write_ev~0); {48729#true} is VALID [2022-02-20 18:19:19,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,907 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #315#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,907 INFO L272 TraceCheckUtils]: 16: Hoare triple {48731#(= ~q_free~0 1)} call activate_threads(); {48771#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {48771#(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; {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L272 TraceCheckUtils]: 18: Hoare triple {48729#true} call #t~ret7 := is_do_write_p_triggered(); {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {48729#true} havoc ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {48729#true} assume !(1 == ~p_dw_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {48729#true} ~__retres1~0 := 0; {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {48729#true} #res := ~__retres1~0; {48729#true} is VALID [2022-02-20 18:19:19,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {48729#true} {48729#true} #309#return; {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {48729#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {48729#true} assume !(0 != ~tmp~1); {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L272 TraceCheckUtils]: 27: Hoare triple {48729#true} call #t~ret8 := is_do_read_c_triggered(); {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {48729#true} havoc ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {48729#true} assume !(1 == ~c_dr_pc~0); {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {48729#true} ~__retres1~1 := 0; {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {48729#true} #res := ~__retres1~1; {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {48729#true} {48729#true} #311#return; {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {48729#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {48729#true} assume !(0 != ~tmp___0~1); {48729#true} is VALID [2022-02-20 18:19:19,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,911 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #317#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,911 INFO L272 TraceCheckUtils]: 38: Hoare triple {48731#(= ~q_free~0 1)} call reset_delta_events(); {48770#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:19,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {48770#(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); {48729#true} is VALID [2022-02-20 18:19:19,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {48729#true} assume !(1 == ~q_write_ev~0); {48729#true} is VALID [2022-02-20 18:19:19,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,912 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #319#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {48731#(= ~q_free~0 1)} assume !false; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {48731#(= ~q_free~0 1)} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {48731#(= ~q_free~0 1)} assume !false; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,913 INFO L272 TraceCheckUtils]: 46: Hoare triple {48731#(= ~q_free~0 1)} call eval_#t~ret9#1 := exists_runnable_thread(); {48729#true} is VALID [2022-02-20 18:19:19,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {48729#true} havoc ~__retres1~2; {48729#true} is VALID [2022-02-20 18:19:19,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {48729#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {48729#true} is VALID [2022-02-20 18:19:19,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {48729#true} #res := ~__retres1~2; {48729#true} is VALID [2022-02-20 18:19:19,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {48729#true} assume true; {48729#true} is VALID [2022-02-20 18:19:19,914 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {48729#true} {48731#(= ~q_free~0 1)} #321#return; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {48731#(= ~q_free~0 1)} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {48731#(= ~q_free~0 1)} assume 0 != eval_~tmp___1~0#1; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {48731#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval_#t~nondet10#1 && eval_#t~nondet10#1 <= 2147483647;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {48731#(= ~q_free~0 1)} assume !(0 != eval_~tmp~2#1); {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {48731#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {48731#(= ~q_free~0 1)} assume 0 != eval_~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; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {48731#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {48731#(= ~q_free~0 1)} assume !false; {48731#(= ~q_free~0 1)} is VALID [2022-02-20 18:19:19,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {48731#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {48730#false} is VALID [2022-02-20 18:19:19,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {48730#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; {48730#false} is VALID [2022-02-20 18:19:19,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {48730#false} assume !(~p_last_write~0 == ~c_last_read~0); {48730#false} is VALID [2022-02-20 18:19:19,918 INFO L272 TraceCheckUtils]: 63: Hoare triple {48730#false} call error(); {48730#false} is VALID [2022-02-20 18:19:19,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {48730#false} assume !false; {48730#false} is VALID [2022-02-20 18:19:19,918 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 18:19:19,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:19,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702848797] [2022-02-20 18:19:19,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702848797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:19,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:19,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:19:19,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921798813] [2022-02-20 18:19:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 18:19:19,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:19,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:19,960 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 18:19:19,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:19:19,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:19:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:19,962 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:24,846 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2022-02-20 18:19:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:19:24,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 18:19:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 409 transitions. [2022-02-20 18:19:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 409 transitions. [2022-02-20 18:19:24,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 409 transitions. [2022-02-20 18:19:25,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:26,187 INFO L225 Difference]: With dead ends: 7846 [2022-02-20 18:19:26,187 INFO L226 Difference]: Without dead ends: 5022 [2022-02-20 18:19:26,192 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 18:19:26,193 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:26,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 285 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:19:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2022-02-20 18:19:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2022-02-20 18:19:27,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:27,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5022 states. Second operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-02-20 18:19:28,010 INFO L74 IsIncluded]: Start isIncluded. First operand 5022 states. Second operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-02-20 18:19:28,019 INFO L87 Difference]: Start difference. First operand 5022 states. Second operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-02-20 18:19:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:28,966 INFO L93 Difference]: Finished difference Result 5022 states and 6342 transitions. [2022-02-20 18:19:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 6342 transitions. [2022-02-20 18:19:28,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:28,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:28,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) Second operand 5022 states. [2022-02-20 18:19:28,986 INFO L87 Difference]: Start difference. First operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) Second operand 5022 states. [2022-02-20 18:19:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:29,713 INFO L93 Difference]: Finished difference Result 5022 states and 6342 transitions. [2022-02-20 18:19:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 6342 transitions. [2022-02-20 18:19:29,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:29,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:29,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:29,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-02-20 18:19:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2022-02-20 18:19:30,567 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2022-02-20 18:19:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:30,568 INFO L470 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2022-02-20 18:19:30,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2022-02-20 18:19:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:19:30,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:30,569 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] [2022-02-20 18:19:30,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:19:30,570 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2022-02-20 18:19:30,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:30,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968332372] [2022-02-20 18:19:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {75423#(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); {75382#true} is VALID [2022-02-20 18:19:30,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75382#true} {75382#true} #313#return; {75382#true} is VALID [2022-02-20 18:19:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {75424#(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); {75382#true} is VALID [2022-02-20 18:19:30,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume !(0 == ~q_write_ev~0); {75382#true} is VALID [2022-02-20 18:19:30,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75382#true} {75382#true} #315#return; {75382#true} is VALID [2022-02-20 18:19:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {75382#true} havoc ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume !(1 == ~p_dw_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} ~__retres1~0 := 0; {75382#true} is VALID [2022-02-20 18:19:30,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {75382#true} #res := ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,644 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {75382#true} {75382#true} #309#return; {75382#true} is VALID [2022-02-20 18:19:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {75382#true} havoc ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume !(1 == ~c_dr_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} ~__retres1~1 := 0; {75382#true} is VALID [2022-02-20 18:19:30,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {75382#true} #res := ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,647 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {75382#true} {75382#true} #311#return; {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {75425#(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; {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L272 TraceCheckUtils]: 1: Hoare triple {75382#true} call #t~ret7 := is_do_write_p_triggered(); {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} havoc ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {75382#true} assume !(1 == ~p_dw_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {75382#true} ~__retres1~0 := 0; {75382#true} is VALID [2022-02-20 18:19:30,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {75382#true} #res := ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75382#true} {75382#true} #309#return; {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {75382#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {75382#true} assume !(0 != ~tmp~1); {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L272 TraceCheckUtils]: 10: Hoare triple {75382#true} call #t~ret8 := is_do_read_c_triggered(); {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {75382#true} havoc ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {75382#true} assume !(1 == ~c_dr_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {75382#true} ~__retres1~1 := 0; {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {75382#true} #res := ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75382#true} {75382#true} #311#return; {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {75382#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {75382#true} is VALID [2022-02-20 18:19:30,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {75382#true} assume !(0 != ~tmp___0~1); {75382#true} is VALID [2022-02-20 18:19:30,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,651 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {75382#true} {75382#true} #317#return; {75382#true} is VALID [2022-02-20 18:19:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {75424#(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); {75382#true} is VALID [2022-02-20 18:19:30,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume !(1 == ~q_write_ev~0); {75382#true} is VALID [2022-02-20 18:19:30,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75382#true} {75382#true} #319#return; {75382#true} is VALID [2022-02-20 18:19:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:30,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {75382#true} havoc ~__retres1~2; {75382#true} is VALID [2022-02-20 18:19:30,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75382#true} is VALID [2022-02-20 18:19:30,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} #res := ~__retres1~2; {75382#true} is VALID [2022-02-20 18:19:30,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,660 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75382#true} {75382#true} #321#return; {75382#true} is VALID [2022-02-20 18:19:30,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {75382#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; {75382#true} is VALID [2022-02-20 18:19:30,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {75382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } 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; {75382#true} is VALID [2022-02-20 18:19:30,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {75382#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~4#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~4#1;start_simulation_~kernel_st~0#1 := 0; {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L272 TraceCheckUtils]: 3: Hoare triple {75382#true} call update_channels(); {75423#(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 18:19:30,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {75423#(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); {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75382#true} {75382#true} #313#return; {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {75382#true} assume { :begin_inline_init_threads } true; {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {75382#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {75382#true} is VALID [2022-02-20 18:19:30,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {75382#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {75382#true} is VALID [2022-02-20 18:19:30,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {75382#true} assume { :end_inline_init_threads } true; {75382#true} is VALID [2022-02-20 18:19:30,663 INFO L272 TraceCheckUtils]: 11: Hoare triple {75382#true} call fire_delta_events(); {75424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:30,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {75424#(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); {75382#true} is VALID [2022-02-20 18:19:30,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {75382#true} assume !(0 == ~q_write_ev~0); {75382#true} is VALID [2022-02-20 18:19:30,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,664 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75382#true} {75382#true} #315#return; {75382#true} is VALID [2022-02-20 18:19:30,664 INFO L272 TraceCheckUtils]: 16: Hoare triple {75382#true} call activate_threads(); {75425#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 18:19:30,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {75425#(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; {75382#true} is VALID [2022-02-20 18:19:30,664 INFO L272 TraceCheckUtils]: 18: Hoare triple {75382#true} call #t~ret7 := is_do_write_p_triggered(); {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {75382#true} havoc ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {75382#true} assume !(1 == ~p_dw_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {75382#true} ~__retres1~0 := 0; {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {75382#true} #res := ~__retres1~0; {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {75382#true} {75382#true} #309#return; {75382#true} is VALID [2022-02-20 18:19:30,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {75382#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {75382#true} assume !(0 != ~tmp~1); {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L272 TraceCheckUtils]: 27: Hoare triple {75382#true} call #t~ret8 := is_do_read_c_triggered(); {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {75382#true} havoc ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {75382#true} assume !(1 == ~c_dr_pc~0); {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {75382#true} ~__retres1~1 := 0; {75382#true} is VALID [2022-02-20 18:19:30,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {75382#true} #res := ~__retres1~1; {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {75382#true} {75382#true} #311#return; {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {75382#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {75382#true} assume !(0 != ~tmp___0~1); {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,667 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {75382#true} {75382#true} #317#return; {75382#true} is VALID [2022-02-20 18:19:30,668 INFO L272 TraceCheckUtils]: 38: Hoare triple {75382#true} call reset_delta_events(); {75424#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 18:19:30,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {75424#(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); {75382#true} is VALID [2022-02-20 18:19:30,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {75382#true} assume !(1 == ~q_write_ev~0); {75382#true} is VALID [2022-02-20 18:19:30,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,668 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {75382#true} {75382#true} #319#return; {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {75382#true} assume !false; {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {75382#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret9#1, eval_#t~nondet10#1, eval_#t~nondet11#1, eval_~tmp~2#1, eval_~tmp___0~2#1, eval_~tmp___1~0#1;havoc eval_~tmp~2#1;havoc eval_~tmp___0~2#1;havoc eval_~tmp___1~0#1; {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {75382#true} assume !false; {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L272 TraceCheckUtils]: 46: Hoare triple {75382#true} call eval_#t~ret9#1 := exists_runnable_thread(); {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {75382#true} havoc ~__retres1~2; {75382#true} is VALID [2022-02-20 18:19:30,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {75382#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {75382#true} #res := ~__retres1~2; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {75382#true} assume true; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75382#true} {75382#true} #321#return; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {75382#true} assume -2147483648 <= eval_#t~ret9#1 && eval_#t~ret9#1 <= 2147483647;eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {75382#true} assume 0 != eval_~tmp___1~0#1; {75382#true} is VALID [2022-02-20 18:19:30,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {75382#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval_#t~nondet10#1 && eval_#t~nondet10#1 <= 2147483647;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {75382#true} is VALID [2022-02-20 18:19:30,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {75382#true} assume 0 != eval_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet6#1; {75382#true} is VALID [2022-02-20 18:19:30,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {75382#true} assume 0 == ~p_dw_pc~0; {75382#true} is VALID [2022-02-20 18:19:30,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {75382#true} assume !false; {75382#true} is VALID [2022-02-20 18:19:30,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {75382#true} assume !(0 == ~q_free~0); {75382#true} is VALID [2022-02-20 18:19:30,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {75382#true} assume -2147483648 <= do_write_p_#t~nondet6#1 && do_write_p_#t~nondet6#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet6#1;havoc do_write_p_#t~nondet6#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; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval_#t~nondet11#1 && eval_#t~nondet11#1 <= 2147483647;eval_~tmp___0~2#1 := eval_#t~nondet11#1;havoc eval_#t~nondet11#1; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,678 INFO L290 TraceCheckUtils]: 64: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval_~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; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,678 INFO L290 TraceCheckUtils]: 65: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,678 INFO L290 TraceCheckUtils]: 66: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,679 INFO L290 TraceCheckUtils]: 67: Hoare triple {75421#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {75421#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 18:19:30,679 INFO L290 TraceCheckUtils]: 68: Hoare triple {75421#(= ~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; {75422#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 18:19:30,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {75422#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {75383#false} is VALID [2022-02-20 18:19:30,680 INFO L272 TraceCheckUtils]: 70: Hoare triple {75383#false} call error(); {75383#false} is VALID [2022-02-20 18:19:30,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {75383#false} assume !false; {75383#false} is VALID [2022-02-20 18:19:30,680 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 18:19:30,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:30,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968332372] [2022-02-20 18:19:30,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968332372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:30,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:30,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:19:30,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263243294] [2022-02-20 18:19:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 72 [2022-02-20 18:19:30,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:30,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 18:19:30,723 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 18:19:30,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:19:30,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:19:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:19:30,725 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 18:19:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:35,512 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2022-02-20 18:19:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:19:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 72 [2022-02-20 18:19:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 18:19:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2022-02-20 18:19:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 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 18:19:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2022-02-20 18:19:35,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 278 transitions. [2022-02-20 18:19:35,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:37,247 INFO L225 Difference]: With dead ends: 6136 [2022-02-20 18:19:37,247 INFO L226 Difference]: Without dead ends: 6133 [2022-02-20 18:19:37,249 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 18:19:37,249 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 465 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:37,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 335 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:19:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2022-02-20 18:19:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2022-02-20 18:19:39,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:39,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6133 states. Second operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2022-02-20 18:19:39,568 INFO L74 IsIncluded]: Start isIncluded. First operand 6133 states. Second operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2022-02-20 18:19:39,577 INFO L87 Difference]: Start difference. First operand 6133 states. Second operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2022-02-20 18:19:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:40,606 INFO L93 Difference]: Finished difference Result 6133 states and 7718 transitions. [2022-02-20 18:19:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 7718 transitions. [2022-02-20 18:19:40,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:40,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:40,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) Second operand 6133 states. [2022-02-20 18:19:40,630 INFO L87 Difference]: Start difference. First operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) Second operand 6133 states. [2022-02-20 18:19:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:41,720 INFO L93 Difference]: Finished difference Result 6133 states and 7718 transitions. [2022-02-20 18:19:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 7718 transitions. [2022-02-20 18:19:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:41,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:41,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016)