./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.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-2.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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:19:02,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:19:02,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:19:03,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:19:03,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:19:03,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:19:03,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:19:03,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:19:03,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:19:03,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:19:03,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:19:03,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:19:03,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:19:03,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:19:03,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:19:03,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:19:03,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:19:03,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:19:03,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:19:03,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:19:03,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:19:03,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:19:03,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:19:03,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:19:03,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:19:03,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:19:03,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:19:03,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:19:03,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:19:03,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:19:03,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:19:03,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:19:03,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:19:03,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:19:03,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:19:03,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:19:03,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:19:03,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:19:03,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:19:03,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:19:03,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:19:03,083 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:19:03,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:19:03,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:19:03,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:19:03,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:19:03,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:19:03,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:19:03,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:19:03,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:19:03,116 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:19:03,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:19:03,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:19:03,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:19:03,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:19:03,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:19:03,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:19:03,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:19:03,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:19:03,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:19:03,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:19:03,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:19:03,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:19:03,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:19:03,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:19:03,121 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2022-02-20 18:19:03,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:19:03,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:19:03,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:19:03,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:19:03,389 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:19:03,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-02-20 18:19:03,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf08e428/2db78b6ea11a45289051e862ec0f21ce/FLAG00e170a2c [2022-02-20 18:19:03,772 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:19:03,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-02-20 18:19:03,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf08e428/2db78b6ea11a45289051e862ec0f21ce/FLAG00e170a2c [2022-02-20 18:19:04,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf08e428/2db78b6ea11a45289051e862ec0f21ce [2022-02-20 18:19:04,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:19:04,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:19:04,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:19:04,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:19:04,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:19:04,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c260949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04, skipping insertion in model container [2022-02-20 18:19:04,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:19:04,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:19:04,381 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-2.c[643,656] [2022-02-20 18:19:04,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:19:04,427 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:19:04,436 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-2.c[643,656] [2022-02-20 18:19:04,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:19:04,483 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:19:04,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04 WrapperNode [2022-02-20 18:19:04,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:19:04,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:19:04,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:19:04,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:19:04,491 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:19:04" (1/1) ... [2022-02-20 18:19:04,497 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:19:04" (1/1) ... [2022-02-20 18:19:04,522 INFO L137 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2022-02-20 18:19:04,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:19:04,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:19:04,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:19:04,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:19:04,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:19:04,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:19:04,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:19:04,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:19:04,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (1/1) ... [2022-02-20 18:19:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:19:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:19:04,588 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:19:04,590 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:19:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:19:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 18:19:04,626 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 18:19:04,627 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 18:19:04,627 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 18:19:04,627 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 18:19:04,627 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 18:19:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 18:19:04,631 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 18:19:04,631 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 18:19:04,631 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 18:19:04,631 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 18:19:04,631 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 18:19:04,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:19:04,631 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 18:19:04,631 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 18:19:04,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:19:04,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:19:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 18:19:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 18:19:04,687 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:19:04,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:19:04,976 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:19:04,998 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:19:04,998 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 18:19:05,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:19:04 BoogieIcfgContainer [2022-02-20 18:19:05,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:19:05,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:19:05,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:19:05,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:19:05,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:19:04" (1/3) ... [2022-02-20 18:19:05,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102b4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:19:05, skipping insertion in model container [2022-02-20 18:19:05,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:04" (2/3) ... [2022-02-20 18:19:05,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102b4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:19:05, skipping insertion in model container [2022-02-20 18:19:05,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:19:04" (3/3) ... [2022-02-20 18:19:05,011 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-02-20 18:19:05,015 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:19:05,016 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:19:05,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:19:05,075 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:19:05,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:19:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:19:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:05,110 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:05,110 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] [2022-02-20 18:19:05,112 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-02-20 18:19:05,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:05,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785750141] [2022-02-20 18:19:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(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); {107#true} is VALID [2022-02-20 18:19:05,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107#true} {109#(= 1 ~c_dr_i~0)} #314#return; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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; {107#true} is VALID [2022-02-20 18:19:05,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {107#true} is VALID [2022-02-20 18:19:05,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {108#false} #316#return; {108#false} is VALID [2022-02-20 18:19:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} havoc ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 1 == ~p_dw_pc~0; {107#true} is VALID [2022-02-20 18:19:05,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {107#true} is VALID [2022-02-20 18:19:05,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} #res := ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,420 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107#true} {107#true} #310#return; {107#true} is VALID [2022-02-20 18:19:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} havoc ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 1 == ~c_dr_pc~0; {107#true} is VALID [2022-02-20 18:19:05,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {107#true} is VALID [2022-02-20 18:19:05,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} #res := ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,434 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107#true} {107#true} #312#return; {107#true} is VALID [2022-02-20 18:19:05,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(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; {107#true} is VALID [2022-02-20 18:19:05,435 INFO L272 TraceCheckUtils]: 1: Hoare triple {107#true} call #t~ret7 := is_do_write_p_triggered(); {107#true} is VALID [2022-02-20 18:19:05,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} havoc ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} assume 1 == ~p_dw_pc~0; {107#true} is VALID [2022-02-20 18:19:05,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {107#true} is VALID [2022-02-20 18:19:05,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} #res := ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,438 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107#true} {107#true} #310#return; {107#true} is VALID [2022-02-20 18:19:05,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {107#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {107#true} is VALID [2022-02-20 18:19:05,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {107#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {107#true} is VALID [2022-02-20 18:19:05,439 INFO L272 TraceCheckUtils]: 10: Hoare triple {107#true} call #t~ret8 := is_do_read_c_triggered(); {107#true} is VALID [2022-02-20 18:19:05,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {107#true} havoc ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {107#true} assume 1 == ~c_dr_pc~0; {107#true} is VALID [2022-02-20 18:19:05,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {107#true} is VALID [2022-02-20 18:19:05,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {107#true} #res := ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107#true} {107#true} #312#return; {107#true} is VALID [2022-02-20 18:19:05,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {107#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {107#true} is VALID [2022-02-20 18:19:05,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {107#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {107#true} is VALID [2022-02-20 18:19:05,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,442 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {107#true} {108#false} #318#return; {108#false} is VALID [2022-02-20 18:19:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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; {107#true} is VALID [2022-02-20 18:19:05,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {107#true} is VALID [2022-02-20 18:19:05,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {108#false} #320#return; {108#false} is VALID [2022-02-20 18:19:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:05,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} havoc ~__retres1~2; {107#true} is VALID [2022-02-20 18:19:05,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107#true} is VALID [2022-02-20 18:19:05,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} #res := ~__retres1~2; {107#true} is VALID [2022-02-20 18:19:05,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,481 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {107#true} {108#false} #322#return; {108#false} is VALID [2022-02-20 18:19:05,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#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; {107#true} is VALID [2022-02-20 18:19:05,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#(= 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; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,488 INFO L272 TraceCheckUtils]: 3: Hoare triple {109#(= 1 ~c_dr_i~0)} call update_channels(); {147#(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,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#(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); {107#true} is VALID [2022-02-20 18:19:05,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,491 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {107#true} {109#(= 1 ~c_dr_i~0)} #314#return; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {109#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads } true; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {109#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {109#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 18:19:05,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {109#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {108#false} is VALID [2022-02-20 18:19:05,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume { :end_inline_init_threads } true; {108#false} is VALID [2022-02-20 18:19:05,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {108#false} call fire_delta_events(); {148#(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,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(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; {107#true} is VALID [2022-02-20 18:19:05,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {107#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {107#true} is VALID [2022-02-20 18:19:05,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,494 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {107#true} {108#false} #316#return; {108#false} is VALID [2022-02-20 18:19:05,494 INFO L272 TraceCheckUtils]: 16: Hoare triple {108#false} call activate_threads(); {149#(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,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#(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; {107#true} is VALID [2022-02-20 18:19:05,495 INFO L272 TraceCheckUtils]: 18: Hoare triple {107#true} call #t~ret7 := is_do_write_p_triggered(); {107#true} is VALID [2022-02-20 18:19:05,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {107#true} havoc ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {107#true} assume 1 == ~p_dw_pc~0; {107#true} is VALID [2022-02-20 18:19:05,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {107#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {107#true} is VALID [2022-02-20 18:19:05,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {107#true} #res := ~__retres1~0; {107#true} is VALID [2022-02-20 18:19:05,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,497 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {107#true} {107#true} #310#return; {107#true} is VALID [2022-02-20 18:19:05,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {107#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {107#true} is VALID [2022-02-20 18:19:05,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {107#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {107#true} is VALID [2022-02-20 18:19:05,498 INFO L272 TraceCheckUtils]: 27: Hoare triple {107#true} call #t~ret8 := is_do_read_c_triggered(); {107#true} is VALID [2022-02-20 18:19:05,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {107#true} havoc ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {107#true} assume 1 == ~c_dr_pc~0; {107#true} is VALID [2022-02-20 18:19:05,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {107#true} is VALID [2022-02-20 18:19:05,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {107#true} #res := ~__retres1~1; {107#true} is VALID [2022-02-20 18:19:05,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,499 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {107#true} {107#true} #312#return; {107#true} is VALID [2022-02-20 18:19:05,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {107#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {107#true} is VALID [2022-02-20 18:19:05,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {107#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {107#true} is VALID [2022-02-20 18:19:05,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,501 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {107#true} {108#false} #318#return; {108#false} is VALID [2022-02-20 18:19:05,501 INFO L272 TraceCheckUtils]: 38: Hoare triple {108#false} call reset_delta_events(); {148#(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,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {148#(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; {107#true} is VALID [2022-02-20 18:19:05,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {107#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {107#true} is VALID [2022-02-20 18:19:05,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,502 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {107#true} {108#false} #320#return; {108#false} is VALID [2022-02-20 18:19:05,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:05,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {108#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; {108#false} is VALID [2022-02-20 18:19:05,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:05,503 INFO L272 TraceCheckUtils]: 46: Hoare triple {108#false} call eval_#t~ret9#1 := exists_runnable_thread(); {107#true} is VALID [2022-02-20 18:19:05,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {107#true} havoc ~__retres1~2; {107#true} is VALID [2022-02-20 18:19:05,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107#true} is VALID [2022-02-20 18:19:05,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {107#true} #res := ~__retres1~2; {107#true} is VALID [2022-02-20 18:19:05,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 18:19:05,504 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {107#true} {108#false} #322#return; {108#false} is VALID [2022-02-20 18:19:05,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {108#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; {108#false} is VALID [2022-02-20 18:19:05,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {108#false} assume 0 != eval_~tmp___1~0#1; {108#false} is VALID [2022-02-20 18:19:05,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {108#false} 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; {108#false} is VALID [2022-02-20 18:19:05,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {108#false} assume !(0 != eval_~tmp~2#1); {108#false} is VALID [2022-02-20 18:19:05,508 INFO L272 TraceCheckUtils]: 56: Hoare triple {108#false} call error(); {108#false} is VALID [2022-02-20 18:19:05,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:05,509 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,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:05,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785750141] [2022-02-20 18:19:05,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785750141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:05,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:05,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:19:05,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115184657] [2022-02-20 18:19:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:05,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:05,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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:19:05,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:05,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:19:05,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:19:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:05,632 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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:19:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:06,368 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2022-02-20 18:19:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:19:06,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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:19:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2022-02-20 18:19:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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:19:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2022-02-20 18:19:06,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 317 transitions. [2022-02-20 18:19:06,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:06,685 INFO L225 Difference]: With dead ends: 217 [2022-02-20 18:19:06,685 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 18:19:06,688 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:19:06,691 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 210 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:06,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 290 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:19:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 18:19:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-02-20 18:19:06,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:06,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:06,727 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:06,728 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:06,737 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-02-20 18:19:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-02-20 18:19:06,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:06,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 116 states. [2022-02-20 18:19:06,740 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 116 states. [2022-02-20 18:19:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:06,747 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-02-20 18:19:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-02-20 18:19:06,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:06,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:06,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:06,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-02-20 18:19:06,756 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-02-20 18:19:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:06,756 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-02-20 18:19:06,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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:19:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-02-20 18:19:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:06,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:06,759 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] [2022-02-20 18:19:06,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:19:06,762 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-02-20 18:19:06,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:06,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783606955] [2022-02-20 18:19:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {887#(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); {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:06,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:06,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {849#(= ~q_read_ev~0 2)} #314#return; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(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; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {890#(= |old(~q_read_ev~0)| 0)} assume true; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {890#(= |old(~q_read_ev~0)| 0)} {849#(= ~q_read_ev~0 2)} #316#return; {848#false} is VALID [2022-02-20 18:19:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#true} havoc ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#true} assume 1 == ~p_dw_pc~0; {847#true} is VALID [2022-02-20 18:19:06,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {847#true} is VALID [2022-02-20 18:19:06,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {847#true} #res := ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,907 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {847#true} {847#true} #310#return; {847#true} is VALID [2022-02-20 18:19:06,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#true} havoc ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#true} assume 1 == ~c_dr_pc~0; {847#true} is VALID [2022-02-20 18:19:06,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {847#true} is VALID [2022-02-20 18:19:06,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {847#true} #res := ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,917 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {847#true} {847#true} #312#return; {847#true} is VALID [2022-02-20 18:19:06,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {891#(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; {847#true} is VALID [2022-02-20 18:19:06,923 INFO L272 TraceCheckUtils]: 1: Hoare triple {847#true} call #t~ret7 := is_do_write_p_triggered(); {847#true} is VALID [2022-02-20 18:19:06,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} havoc ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {847#true} assume 1 == ~p_dw_pc~0; {847#true} is VALID [2022-02-20 18:19:06,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {847#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {847#true} is VALID [2022-02-20 18:19:06,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#true} #res := ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,925 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {847#true} {847#true} #310#return; {847#true} is VALID [2022-02-20 18:19:06,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {847#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {847#true} is VALID [2022-02-20 18:19:06,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {847#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {847#true} is VALID [2022-02-20 18:19:06,925 INFO L272 TraceCheckUtils]: 10: Hoare triple {847#true} call #t~ret8 := is_do_read_c_triggered(); {847#true} is VALID [2022-02-20 18:19:06,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#true} havoc ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {847#true} assume 1 == ~c_dr_pc~0; {847#true} is VALID [2022-02-20 18:19:06,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {847#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {847#true} is VALID [2022-02-20 18:19:06,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {847#true} #res := ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {847#true} {847#true} #312#return; {847#true} is VALID [2022-02-20 18:19:06,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {847#true} is VALID [2022-02-20 18:19:06,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {847#true} is VALID [2022-02-20 18:19:06,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,927 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {847#true} {848#false} #318#return; {848#false} is VALID [2022-02-20 18:19:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(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; {847#true} is VALID [2022-02-20 18:19:06,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {847#true} is VALID [2022-02-20 18:19:06,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {847#true} {848#false} #320#return; {848#false} is VALID [2022-02-20 18:19:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:06,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#true} havoc ~__retres1~2; {847#true} is VALID [2022-02-20 18:19:06,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {847#true} is VALID [2022-02-20 18:19:06,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} #res := ~__retres1~2; {847#true} is VALID [2022-02-20 18:19:06,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,943 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {847#true} {848#false} #322#return; {848#false} is VALID [2022-02-20 18:19:06,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#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; {847#true} is VALID [2022-02-20 18:19:06,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#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; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#(= ~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; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,945 INFO L272 TraceCheckUtils]: 3: Hoare triple {849#(= ~q_read_ev~0 2)} call update_channels(); {887#(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:06,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {887#(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); {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:06,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:06,947 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {888#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {849#(= ~q_read_ev~0 2)} #314#return; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads } true; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads } true; {849#(= ~q_read_ev~0 2)} is VALID [2022-02-20 18:19:06,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {849#(= ~q_read_ev~0 2)} call fire_delta_events(); {889#(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:06,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#(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; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {890#(= |old(~q_read_ev~0)| 0)} assume true; {890#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 18:19:06,952 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {890#(= |old(~q_read_ev~0)| 0)} {849#(= ~q_read_ev~0 2)} #316#return; {848#false} is VALID [2022-02-20 18:19:06,952 INFO L272 TraceCheckUtils]: 16: Hoare triple {848#false} call activate_threads(); {891#(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:06,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {891#(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; {847#true} is VALID [2022-02-20 18:19:06,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {847#true} call #t~ret7 := is_do_write_p_triggered(); {847#true} is VALID [2022-02-20 18:19:06,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {847#true} havoc ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {847#true} assume 1 == ~p_dw_pc~0; {847#true} is VALID [2022-02-20 18:19:06,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {847#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {847#true} is VALID [2022-02-20 18:19:06,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {847#true} #res := ~__retres1~0; {847#true} is VALID [2022-02-20 18:19:06,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,953 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {847#true} {847#true} #310#return; {847#true} is VALID [2022-02-20 18:19:06,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {847#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {847#true} is VALID [2022-02-20 18:19:06,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {847#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {847#true} is VALID [2022-02-20 18:19:06,954 INFO L272 TraceCheckUtils]: 27: Hoare triple {847#true} call #t~ret8 := is_do_read_c_triggered(); {847#true} is VALID [2022-02-20 18:19:06,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {847#true} havoc ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {847#true} assume 1 == ~c_dr_pc~0; {847#true} is VALID [2022-02-20 18:19:06,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {847#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {847#true} is VALID [2022-02-20 18:19:06,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {847#true} #res := ~__retres1~1; {847#true} is VALID [2022-02-20 18:19:06,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,955 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {847#true} {847#true} #312#return; {847#true} is VALID [2022-02-20 18:19:06,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {847#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {847#true} is VALID [2022-02-20 18:19:06,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {847#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {847#true} is VALID [2022-02-20 18:19:06,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,956 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {847#true} {848#false} #318#return; {848#false} is VALID [2022-02-20 18:19:06,956 INFO L272 TraceCheckUtils]: 38: Hoare triple {848#false} call reset_delta_events(); {889#(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:06,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {889#(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; {847#true} is VALID [2022-02-20 18:19:06,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {847#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {847#true} is VALID [2022-02-20 18:19:06,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,957 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {847#true} {848#false} #320#return; {848#false} is VALID [2022-02-20 18:19:06,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-02-20 18:19:06,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {848#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; {848#false} is VALID [2022-02-20 18:19:06,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-02-20 18:19:06,958 INFO L272 TraceCheckUtils]: 46: Hoare triple {848#false} call eval_#t~ret9#1 := exists_runnable_thread(); {847#true} is VALID [2022-02-20 18:19:06,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {847#true} havoc ~__retres1~2; {847#true} is VALID [2022-02-20 18:19:06,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {847#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {847#true} is VALID [2022-02-20 18:19:06,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {847#true} #res := ~__retres1~2; {847#true} is VALID [2022-02-20 18:19:06,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {847#true} assume true; {847#true} is VALID [2022-02-20 18:19:06,959 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {847#true} {848#false} #322#return; {848#false} is VALID [2022-02-20 18:19:06,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {848#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; {848#false} is VALID [2022-02-20 18:19:06,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {848#false} assume 0 != eval_~tmp___1~0#1; {848#false} is VALID [2022-02-20 18:19:06,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {848#false} 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; {848#false} is VALID [2022-02-20 18:19:06,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {848#false} assume !(0 != eval_~tmp~2#1); {848#false} is VALID [2022-02-20 18:19:06,960 INFO L272 TraceCheckUtils]: 56: Hoare triple {848#false} call error(); {848#false} is VALID [2022-02-20 18:19:06,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-02-20 18:19:06,961 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:06,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:06,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783606955] [2022-02-20 18:19:06,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783606955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:06,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:06,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:19:06,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254769593] [2022-02-20 18:19:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:06,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:06,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:07,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:07,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:19:07,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:19:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:19:07,009 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:08,521 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2022-02-20 18:19:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:19:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 448 transitions. [2022-02-20 18:19:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 448 transitions. [2022-02-20 18:19:08,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 448 transitions. [2022-02-20 18:19:08,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:08,943 INFO L225 Difference]: With dead ends: 323 [2022-02-20 18:19:08,945 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 18:19:08,947 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:19:08,949 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 400 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:08,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 405 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:19:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 18:19:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-02-20 18:19:08,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:08,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:08,990 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:08,992 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:09,005 INFO L93 Difference]: Finished difference Result 234 states and 318 transitions. [2022-02-20 18:19:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2022-02-20 18:19:09,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:09,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:09,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 234 states. [2022-02-20 18:19:09,013 INFO L87 Difference]: Start difference. First operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 234 states. [2022-02-20 18:19:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:09,024 INFO L93 Difference]: Finished difference Result 234 states and 318 transitions. [2022-02-20 18:19:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2022-02-20 18:19:09,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:09,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:09,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:09,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-02-20 18:19:09,036 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-02-20 18:19:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:09,037 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-02-20 18:19:09,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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,040 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-02-20 18:19:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:09,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:09,043 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] [2022-02-20 18:19:09,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:19:09,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-02-20 18:19:09,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:09,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591337794] [2022-02-20 18:19:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {2149#(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); {2150#(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,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {2150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2150#(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,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2111#(= ~q_write_ev~0 ~q_read_ev~0)} #314#return; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {2150#(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); {2151#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {2151#(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; {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2111#(= ~q_write_ev~0 ~q_read_ev~0)} #316#return; {2110#false} is VALID [2022-02-20 18:19:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#true} havoc ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#true} assume !(1 == ~p_dw_pc~0); {2109#true} is VALID [2022-02-20 18:19:09,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} ~__retres1~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {2109#true} #res := ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,160 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2109#true} {2109#true} #310#return; {2109#true} is VALID [2022-02-20 18:19:09,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#true} havoc ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#true} assume 1 == ~c_dr_pc~0; {2109#true} is VALID [2022-02-20 18:19:09,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {2109#true} #res := ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2109#true} {2109#true} #312#return; {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {2153#(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; {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L272 TraceCheckUtils]: 1: Hoare triple {2109#true} call #t~ret7 := is_do_write_p_triggered(); {2109#true} is VALID [2022-02-20 18:19:09,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} havoc ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {2109#true} assume !(1 == ~p_dw_pc~0); {2109#true} is VALID [2022-02-20 18:19:09,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {2109#true} ~__retres1~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {2109#true} #res := ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2109#true} {2109#true} #310#return; {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {2109#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {2109#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L272 TraceCheckUtils]: 10: Hoare triple {2109#true} call #t~ret8 := is_do_read_c_triggered(); {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {2109#true} havoc ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#true} assume 1 == ~c_dr_pc~0; {2109#true} is VALID [2022-02-20 18:19:09,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {2109#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2109#true} is VALID [2022-02-20 18:19:09,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {2109#true} #res := ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2109#true} {2109#true} #312#return; {2109#true} is VALID [2022-02-20 18:19:09,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {2109#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {2109#true} is VALID [2022-02-20 18:19:09,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {2109#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,169 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2109#true} {2110#false} #318#return; {2110#false} is VALID [2022-02-20 18:19:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {2150#(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); {2109#true} is VALID [2022-02-20 18:19:09,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2109#true} is VALID [2022-02-20 18:19:09,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2109#true} {2110#false} #320#return; {2110#false} is VALID [2022-02-20 18:19:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:09,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#true} havoc ~__retres1~2; {2109#true} is VALID [2022-02-20 18:19:09,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2109#true} is VALID [2022-02-20 18:19:09,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#true} #res := ~__retres1~2; {2109#true} is VALID [2022-02-20 18:19:09,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,178 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2109#true} {2110#false} #322#return; {2110#false} is VALID [2022-02-20 18:19:09,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#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; {2109#true} is VALID [2022-02-20 18:19:09,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#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; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {2111#(= ~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; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,180 INFO L272 TraceCheckUtils]: 3: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels(); {2149#(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,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {2149#(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); {2150#(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,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {2150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2150#(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,181 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2111#(= ~q_write_ev~0 ~q_read_ev~0)} #314#return; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads } true; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads } true; {2111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:09,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {2111#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events(); {2150#(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,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {2150#(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); {2151#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {2151#(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; {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:09,185 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2152#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2111#(= ~q_write_ev~0 ~q_read_ev~0)} #316#return; {2110#false} is VALID [2022-02-20 18:19:09,186 INFO L272 TraceCheckUtils]: 16: Hoare triple {2110#false} call activate_threads(); {2153#(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,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {2153#(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; {2109#true} is VALID [2022-02-20 18:19:09,186 INFO L272 TraceCheckUtils]: 18: Hoare triple {2109#true} call #t~ret7 := is_do_write_p_triggered(); {2109#true} is VALID [2022-02-20 18:19:09,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {2109#true} havoc ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#true} assume !(1 == ~p_dw_pc~0); {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#true} ~__retres1~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {2109#true} #res := ~__retres1~0; {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2109#true} {2109#true} #310#return; {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {2109#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {2109#true} is VALID [2022-02-20 18:19:09,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {2109#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L272 TraceCheckUtils]: 27: Hoare triple {2109#true} call #t~ret8 := is_do_read_c_triggered(); {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {2109#true} havoc ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {2109#true} assume 1 == ~c_dr_pc~0; {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {2109#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {2109#true} #res := ~__retres1~1; {2109#true} is VALID [2022-02-20 18:19:09,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,189 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2109#true} {2109#true} #312#return; {2109#true} is VALID [2022-02-20 18:19:09,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {2109#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {2109#true} is VALID [2022-02-20 18:19:09,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {2109#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2109#true} is VALID [2022-02-20 18:19:09,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,189 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2109#true} {2110#false} #318#return; {2110#false} is VALID [2022-02-20 18:19:09,189 INFO L272 TraceCheckUtils]: 38: Hoare triple {2110#false} call reset_delta_events(); {2150#(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,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {2150#(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); {2109#true} is VALID [2022-02-20 18:19:09,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {2109#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2109#true} is VALID [2022-02-20 18:19:09,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,190 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2109#true} {2110#false} #320#return; {2110#false} is VALID [2022-02-20 18:19:09,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2022-02-20 18:19:09,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {2110#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; {2110#false} is VALID [2022-02-20 18:19:09,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2022-02-20 18:19:09,191 INFO L272 TraceCheckUtils]: 46: Hoare triple {2110#false} call eval_#t~ret9#1 := exists_runnable_thread(); {2109#true} is VALID [2022-02-20 18:19:09,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {2109#true} havoc ~__retres1~2; {2109#true} is VALID [2022-02-20 18:19:09,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {2109#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2109#true} is VALID [2022-02-20 18:19:09,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {2109#true} #res := ~__retres1~2; {2109#true} is VALID [2022-02-20 18:19:09,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {2109#true} assume true; {2109#true} is VALID [2022-02-20 18:19:09,192 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2109#true} {2110#false} #322#return; {2110#false} is VALID [2022-02-20 18:19:09,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {2110#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; {2110#false} is VALID [2022-02-20 18:19:09,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {2110#false} assume 0 != eval_~tmp___1~0#1; {2110#false} is VALID [2022-02-20 18:19:09,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {2110#false} 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; {2110#false} is VALID [2022-02-20 18:19:09,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {2110#false} assume !(0 != eval_~tmp~2#1); {2110#false} is VALID [2022-02-20 18:19:09,193 INFO L272 TraceCheckUtils]: 56: Hoare triple {2110#false} call error(); {2110#false} is VALID [2022-02-20 18:19:09,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {2110#false} assume !false; {2110#false} is VALID [2022-02-20 18:19:09,193 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,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:09,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591337794] [2022-02-20 18:19:09,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591337794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:09,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:09,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:19:09,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871081321] [2022-02-20 18:19:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:09,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:09,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:09,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:19:09,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:09,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:19:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:19:09,235 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:10,925 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-02-20 18:19:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:19:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 471 transitions. [2022-02-20 18:19:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 471 transitions. [2022-02-20 18:19:10,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 471 transitions. [2022-02-20 18:19:11,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:11,282 INFO L225 Difference]: With dead ends: 543 [2022-02-20 18:19:11,282 INFO L226 Difference]: Without dead ends: 365 [2022-02-20 18:19:11,283 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:19:11,284 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 444 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:11,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 646 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:19:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-02-20 18:19:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2022-02-20 18:19:11,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:11,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:19:11,313 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:19:11,314 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:19:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:11,329 INFO L93 Difference]: Finished difference Result 365 states and 500 transitions. [2022-02-20 18:19:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 500 transitions. [2022-02-20 18:19:11,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:11,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:11,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) Second operand 365 states. [2022-02-20 18:19:11,332 INFO L87 Difference]: Start difference. First operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) Second operand 365 states. [2022-02-20 18:19:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:11,347 INFO L93 Difference]: Finished difference Result 365 states and 500 transitions. [2022-02-20 18:19:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 500 transitions. [2022-02-20 18:19:11,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:11,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:11,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:11,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-02-20 18:19:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2022-02-20 18:19:11,371 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2022-02-20 18:19:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:11,371 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2022-02-20 18:19:11,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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,372 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2022-02-20 18:19:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:11,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:11,373 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] [2022-02-20 18:19:11,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:19:11,373 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2022-02-20 18:19:11,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:11,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86455803] [2022-02-20 18:19:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {4101#(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); {4062#true} is VALID [2022-02-20 18:19:11,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4062#true} {4062#true} #314#return; {4062#true} is VALID [2022-02-20 18:19:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {4102#(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); {4062#true} is VALID [2022-02-20 18:19:11,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume !(0 == ~q_write_ev~0); {4062#true} is VALID [2022-02-20 18:19:11,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4062#true} {4062#true} #316#return; {4062#true} is VALID [2022-02-20 18:19:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {4062#true} havoc ~__retres1~0; {4062#true} is VALID [2022-02-20 18:19:11,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume !(1 == ~p_dw_pc~0); {4062#true} is VALID [2022-02-20 18:19:11,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} ~__retres1~0 := 0; {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:19:11,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,568 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4062#true} #310#return; {4110#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:19:11,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {4062#true} havoc ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume 1 == ~c_dr_pc~0; {4062#true} is VALID [2022-02-20 18:19:11,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4062#true} is VALID [2022-02-20 18:19:11,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {4062#true} #res := ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,584 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4062#true} {4063#false} #312#return; {4063#false} is VALID [2022-02-20 18:19:11,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {4103#(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; {4062#true} is VALID [2022-02-20 18:19:11,585 INFO L272 TraceCheckUtils]: 1: Hoare triple {4062#true} call #t~ret7 := is_do_write_p_triggered(); {4062#true} is VALID [2022-02-20 18:19:11,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} havoc ~__retres1~0; {4062#true} is VALID [2022-02-20 18:19:11,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {4062#true} assume !(1 == ~p_dw_pc~0); {4062#true} is VALID [2022-02-20 18:19:11,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {4062#true} ~__retres1~0 := 0; {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:19:11,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,588 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4062#true} #310#return; {4110#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:19:11,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {4110#(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; {4111#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} is VALID [2022-02-20 18:19:11,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {4111#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4063#false} is VALID [2022-02-20 18:19:11,589 INFO L272 TraceCheckUtils]: 10: Hoare triple {4063#false} call #t~ret8 := is_do_read_c_triggered(); {4062#true} is VALID [2022-02-20 18:19:11,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {4062#true} havoc ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {4062#true} assume 1 == ~c_dr_pc~0; {4062#true} is VALID [2022-02-20 18:19:11,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {4062#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4062#true} is VALID [2022-02-20 18:19:11,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {4062#true} #res := ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,591 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4062#true} {4063#false} #312#return; {4063#false} is VALID [2022-02-20 18:19:11,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {4063#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {4063#false} is VALID [2022-02-20 18:19:11,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {4063#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4063#false} is VALID [2022-02-20 18:19:11,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {4063#false} assume true; {4063#false} is VALID [2022-02-20 18:19:11,591 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4063#false} {4062#true} #318#return; {4063#false} is VALID [2022-02-20 18:19:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {4102#(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); {4062#true} is VALID [2022-02-20 18:19:11,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4062#true} is VALID [2022-02-20 18:19:11,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4062#true} {4063#false} #320#return; {4063#false} is VALID [2022-02-20 18:19:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:11,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {4062#true} havoc ~__retres1~2; {4062#true} is VALID [2022-02-20 18:19:11,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4062#true} is VALID [2022-02-20 18:19:11,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#true} #res := ~__retres1~2; {4062#true} is VALID [2022-02-20 18:19:11,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,615 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4062#true} {4063#false} #322#return; {4063#false} is VALID [2022-02-20 18:19:11,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {4062#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; {4062#true} is VALID [2022-02-20 18:19:11,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {4062#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; {4062#true} is VALID [2022-02-20 18:19:11,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {4062#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; {4062#true} is VALID [2022-02-20 18:19:11,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {4062#true} call update_channels(); {4101#(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:11,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {4101#(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); {4062#true} is VALID [2022-02-20 18:19:11,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,617 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4062#true} {4062#true} #314#return; {4062#true} is VALID [2022-02-20 18:19:11,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {4062#true} assume { :begin_inline_init_threads } true; {4062#true} is VALID [2022-02-20 18:19:11,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {4062#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4062#true} is VALID [2022-02-20 18:19:11,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {4062#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4062#true} is VALID [2022-02-20 18:19:11,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {4062#true} assume { :end_inline_init_threads } true; {4062#true} is VALID [2022-02-20 18:19:11,620 INFO L272 TraceCheckUtils]: 11: Hoare triple {4062#true} call fire_delta_events(); {4102#(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:11,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {4102#(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); {4062#true} is VALID [2022-02-20 18:19:11,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {4062#true} assume !(0 == ~q_write_ev~0); {4062#true} is VALID [2022-02-20 18:19:11,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4062#true} {4062#true} #316#return; {4062#true} is VALID [2022-02-20 18:19:11,621 INFO L272 TraceCheckUtils]: 16: Hoare triple {4062#true} call activate_threads(); {4103#(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:11,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {4103#(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; {4062#true} is VALID [2022-02-20 18:19:11,621 INFO L272 TraceCheckUtils]: 18: Hoare triple {4062#true} call #t~ret7 := is_do_write_p_triggered(); {4062#true} is VALID [2022-02-20 18:19:11,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {4062#true} havoc ~__retres1~0; {4062#true} is VALID [2022-02-20 18:19:11,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {4062#true} assume !(1 == ~p_dw_pc~0); {4062#true} is VALID [2022-02-20 18:19:11,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {4062#true} ~__retres1~0 := 0; {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 18:19:11,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {4118#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 18:19:11,627 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4119#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4062#true} #310#return; {4110#(and (<= |activate_threads_#t~ret7| 0) (<= 0 |activate_threads_#t~ret7|))} is VALID [2022-02-20 18:19:11,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {4110#(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; {4111#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} is VALID [2022-02-20 18:19:11,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {4111#(and (< 0 (+ activate_threads_~tmp~1 1)) (<= activate_threads_~tmp~1 0))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4063#false} is VALID [2022-02-20 18:19:11,628 INFO L272 TraceCheckUtils]: 27: Hoare triple {4063#false} call #t~ret8 := is_do_read_c_triggered(); {4062#true} is VALID [2022-02-20 18:19:11,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {4062#true} havoc ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {4062#true} assume 1 == ~c_dr_pc~0; {4062#true} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {4062#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4062#true} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {4062#true} #res := ~__retres1~1; {4062#true} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,629 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4062#true} {4063#false} #312#return; {4063#false} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {4063#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {4063#false} is VALID [2022-02-20 18:19:11,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {4063#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4063#false} is VALID [2022-02-20 18:19:11,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {4063#false} assume true; {4063#false} is VALID [2022-02-20 18:19:11,630 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4063#false} {4062#true} #318#return; {4063#false} is VALID [2022-02-20 18:19:11,630 INFO L272 TraceCheckUtils]: 38: Hoare triple {4063#false} call reset_delta_events(); {4102#(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:11,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {4102#(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); {4062#true} is VALID [2022-02-20 18:19:11,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {4062#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4062#true} is VALID [2022-02-20 18:19:11,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,631 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4062#true} {4063#false} #320#return; {4063#false} is VALID [2022-02-20 18:19:11,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {4063#false} assume !false; {4063#false} is VALID [2022-02-20 18:19:11,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {4063#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; {4063#false} is VALID [2022-02-20 18:19:11,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {4063#false} assume !false; {4063#false} is VALID [2022-02-20 18:19:11,631 INFO L272 TraceCheckUtils]: 46: Hoare triple {4063#false} call eval_#t~ret9#1 := exists_runnable_thread(); {4062#true} is VALID [2022-02-20 18:19:11,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {4062#true} havoc ~__retres1~2; {4062#true} is VALID [2022-02-20 18:19:11,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {4062#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4062#true} is VALID [2022-02-20 18:19:11,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {4062#true} #res := ~__retres1~2; {4062#true} is VALID [2022-02-20 18:19:11,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {4062#true} assume true; {4062#true} is VALID [2022-02-20 18:19:11,632 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4062#true} {4063#false} #322#return; {4063#false} is VALID [2022-02-20 18:19:11,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {4063#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; {4063#false} is VALID [2022-02-20 18:19:11,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {4063#false} assume 0 != eval_~tmp___1~0#1; {4063#false} is VALID [2022-02-20 18:19:11,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {4063#false} 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; {4063#false} is VALID [2022-02-20 18:19:11,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {4063#false} assume !(0 != eval_~tmp~2#1); {4063#false} is VALID [2022-02-20 18:19:11,633 INFO L272 TraceCheckUtils]: 56: Hoare triple {4063#false} call error(); {4063#false} is VALID [2022-02-20 18:19:11,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {4063#false} assume !false; {4063#false} is VALID [2022-02-20 18:19:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:19:11,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:11,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86455803] [2022-02-20 18:19:11,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86455803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:11,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:11,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:19:11,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498875393] [2022-02-20 18:19:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:11,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:11,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:11,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:11,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:19:11,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:19:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:19:11,675 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:12,721 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2022-02-20 18:19:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:19:12,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-02-20 18:19:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-02-20 18:19:12,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 289 transitions. [2022-02-20 18:19:12,916 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:12,930 INFO L225 Difference]: With dead ends: 592 [2022-02-20 18:19:12,931 INFO L226 Difference]: Without dead ends: 324 [2022-02-20 18:19:12,935 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:19:12,943 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:12,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 533 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:19:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-02-20 18:19:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2022-02-20 18:19:12,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:12,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:19:12,977 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:19:12,978 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:19:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:12,989 INFO L93 Difference]: Finished difference Result 324 states and 440 transitions. [2022-02-20 18:19:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 440 transitions. [2022-02-20 18:19:12,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:12,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:12,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) Second operand 324 states. [2022-02-20 18:19:12,991 INFO L87 Difference]: Start difference. First operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) Second operand 324 states. [2022-02-20 18:19:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:13,004 INFO L93 Difference]: Finished difference Result 324 states and 440 transitions. [2022-02-20 18:19:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 440 transitions. [2022-02-20 18:19:13,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:13,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:13,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:13,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-02-20 18:19:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2022-02-20 18:19:13,017 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2022-02-20 18:19:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:13,018 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2022-02-20 18:19:13,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2022-02-20 18:19:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:13,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:13,019 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] [2022-02-20 18:19:13,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:19:13,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2022-02-20 18:19:13,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:13,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059814728] [2022-02-20 18:19:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {6036#(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); {5996#true} is VALID [2022-02-20 18:19:13,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5996#true} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #314#return; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {6037#(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); {5996#true} is VALID [2022-02-20 18:19:13,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume !(0 == ~q_write_ev~0); {5996#true} is VALID [2022-02-20 18:19:13,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5996#true} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #316#return; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#true} havoc ~__retres1~0; {5996#true} is VALID [2022-02-20 18:19:13,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume !(1 == ~p_dw_pc~0); {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,137 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5996#true} #310#return; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#true} havoc ~__retres1~1; {5996#true} is VALID [2022-02-20 18:19:13,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume 1 == ~c_dr_pc~0; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,162 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #312#return; {6052#(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:19:13,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {6038#(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; {5996#true} is VALID [2022-02-20 18:19:13,162 INFO L272 TraceCheckUtils]: 1: Hoare triple {5996#true} call #t~ret7 := is_do_write_p_triggered(); {5996#true} is VALID [2022-02-20 18:19:13,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {5996#true} havoc ~__retres1~0; {5996#true} is VALID [2022-02-20 18:19:13,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {5996#true} assume !(1 == ~p_dw_pc~0); {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,164 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5996#true} #310#return; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {6045#(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; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,165 INFO L272 TraceCheckUtils]: 10: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret8 := is_do_read_c_triggered(); {5996#true} is VALID [2022-02-20 18:19:13,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {5996#true} havoc ~__retres1~1; {5996#true} is VALID [2022-02-20 18:19:13,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {5996#true} assume 1 == ~c_dr_pc~0; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #312#return; {6052#(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:19:13,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {6052#(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; {6052#(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:19:13,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {6052#(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; {6052#(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:19:13,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {6052#(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; {6052#(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:19:13,170 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6052#(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)))))} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #318#return; {5997#false} is VALID [2022-02-20 18:19:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {6037#(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); {5996#true} is VALID [2022-02-20 18:19:13,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5996#true} is VALID [2022-02-20 18:19:13,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5996#true} {5997#false} #320#return; {5997#false} is VALID [2022-02-20 18:19:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:13,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#true} havoc ~__retres1~2; {5996#true} is VALID [2022-02-20 18:19:13,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5996#true} is VALID [2022-02-20 18:19:13,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {5996#true} #res := ~__retres1~2; {5996#true} is VALID [2022-02-20 18:19:13,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,179 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5996#true} {5997#false} #322#return; {5997#false} is VALID [2022-02-20 18:19:13,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {5996#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; {5996#true} is VALID [2022-02-20 18:19:13,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {5996#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; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {5998#(= ~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; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,181 INFO L272 TraceCheckUtils]: 3: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels(); {6036#(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,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {6036#(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); {5996#true} is VALID [2022-02-20 18:19:13,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,182 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5996#true} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #314#return; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads } true; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads } true; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events(); {6037#(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,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {6037#(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); {5996#true} is VALID [2022-02-20 18:19:13,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {5996#true} assume !(0 == ~q_write_ev~0); {5996#true} is VALID [2022-02-20 18:19:13,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,185 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5996#true} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #316#return; {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 18:19:13,185 INFO L272 TraceCheckUtils]: 16: Hoare triple {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads(); {6038#(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,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {6038#(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; {5996#true} is VALID [2022-02-20 18:19:13,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {5996#true} call #t~ret7 := is_do_write_p_triggered(); {5996#true} is VALID [2022-02-20 18:19:13,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {5996#true} havoc ~__retres1~0; {5996#true} is VALID [2022-02-20 18:19:13,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {5996#true} assume !(1 == ~p_dw_pc~0); {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,193 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {5996#true} #310#return; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {6045#(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; {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 18:19:13,193 INFO L272 TraceCheckUtils]: 27: Hoare triple {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret8 := is_do_read_c_triggered(); {5996#true} is VALID [2022-02-20 18:19:13,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {5996#true} havoc ~__retres1~1; {5996#true} is VALID [2022-02-20 18:19:13,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {5996#true} assume 1 == ~c_dr_pc~0; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 18:19:13,196 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6053#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {6045#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #312#return; {6052#(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:19:13,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {6052#(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; {6052#(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:19:13,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {6052#(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; {6052#(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:19:13,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {6052#(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; {6052#(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:19:13,198 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6052#(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)))))} {5998#(= ~c_dr_pc~0 ~p_dw_pc~0)} #318#return; {5997#false} is VALID [2022-02-20 18:19:13,198 INFO L272 TraceCheckUtils]: 38: Hoare triple {5997#false} call reset_delta_events(); {6037#(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,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {6037#(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); {5996#true} is VALID [2022-02-20 18:19:13,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {5996#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5996#true} is VALID [2022-02-20 18:19:13,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,199 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5996#true} {5997#false} #320#return; {5997#false} is VALID [2022-02-20 18:19:13,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {5997#false} assume !false; {5997#false} is VALID [2022-02-20 18:19:13,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {5997#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; {5997#false} is VALID [2022-02-20 18:19:13,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {5997#false} assume !false; {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L272 TraceCheckUtils]: 46: Hoare triple {5997#false} call eval_#t~ret9#1 := exists_runnable_thread(); {5996#true} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {5996#true} havoc ~__retres1~2; {5996#true} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {5996#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5996#true} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {5996#true} #res := ~__retres1~2; {5996#true} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {5996#true} assume true; {5996#true} is VALID [2022-02-20 18:19:13,200 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5996#true} {5997#false} #322#return; {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {5997#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; {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {5997#false} assume 0 != eval_~tmp___1~0#1; {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {5997#false} 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; {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {5997#false} assume !(0 != eval_~tmp~2#1); {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L272 TraceCheckUtils]: 56: Hoare triple {5997#false} call error(); {5997#false} is VALID [2022-02-20 18:19:13,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {5997#false} assume !false; {5997#false} is VALID [2022-02-20 18:19:13,200 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,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:13,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059814728] [2022-02-20 18:19:13,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059814728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:13,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:13,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:19:13,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818951209] [2022-02-20 18:19:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:13,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:13,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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:13,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:13,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:19:13,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:19:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:19:13,239 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:18,008 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2022-02-20 18:19:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 18:19:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 943 transitions. [2022-02-20 18:19:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 943 transitions. [2022-02-20 18:19:18,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 943 transitions. [2022-02-20 18:19:18,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:19,008 INFO L225 Difference]: With dead ends: 1963 [2022-02-20 18:19:19,008 INFO L226 Difference]: Without dead ends: 1690 [2022-02-20 18:19:19,010 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:19,011 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 930 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:19,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [947 Valid, 1061 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 18:19:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-02-20 18:19:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2022-02-20 18:19:19,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:19,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1690 states. Second operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:19,610 INFO L74 IsIncluded]: Start isIncluded. First operand 1690 states. Second operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:19,613 INFO L87 Difference]: Start difference. First operand 1690 states. Second operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:19,747 INFO L93 Difference]: Finished difference Result 1690 states and 2212 transitions. [2022-02-20 18:19:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2212 transitions. [2022-02-20 18:19:19,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:19,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:19,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) Second operand 1690 states. [2022-02-20 18:19:19,759 INFO L87 Difference]: Start difference. First operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) Second operand 1690 states. [2022-02-20 18:19:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:19,894 INFO L93 Difference]: Finished difference Result 1690 states and 2212 transitions. [2022-02-20 18:19:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2212 transitions. [2022-02-20 18:19:19,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:19,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:19,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:19,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-02-20 18:19:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2022-02-20 18:19:20,039 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2022-02-20 18:19:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:20,040 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2022-02-20 18:19:20,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2022-02-20 18:19:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:20,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:20,041 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] [2022-02-20 18:19:20,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:19:20,041 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2022-02-20 18:19:20,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:20,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665798873] [2022-02-20 18:19:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {14093#(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); {14054#true} is VALID [2022-02-20 18:19:20,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14054#true} {14054#true} #314#return; {14054#true} is VALID [2022-02-20 18:19:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {14094#(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); {14054#true} is VALID [2022-02-20 18:19:20,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume !(0 == ~q_write_ev~0); {14054#true} is VALID [2022-02-20 18:19:20,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14054#true} {14054#true} #316#return; {14054#true} is VALID [2022-02-20 18:19:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {14054#true} havoc ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume !(1 == ~p_dw_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} ~__retres1~0 := 0; {14054#true} is VALID [2022-02-20 18:19:20,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {14054#true} #res := ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,156 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14054#true} {14054#true} #310#return; {14054#true} is VALID [2022-02-20 18:19:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {14054#true} havoc ~__retres1~1; {14054#true} is VALID [2022-02-20 18:19:20,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume !(1 == ~c_dr_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} ~__retres1~1 := 0; {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:20,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,197 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14054#true} #312#return; {14108#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {14095#(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; {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L272 TraceCheckUtils]: 1: Hoare triple {14054#true} call #t~ret7 := is_do_write_p_triggered(); {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} havoc ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {14054#true} assume !(1 == ~p_dw_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {14054#true} ~__retres1~0 := 0; {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {14054#true} #res := ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,199 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14054#true} {14054#true} #310#return; {14054#true} is VALID [2022-02-20 18:19:20,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {14054#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {14054#true} is VALID [2022-02-20 18:19:20,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {14054#true} assume !(0 != ~tmp~1); {14054#true} is VALID [2022-02-20 18:19:20,199 INFO L272 TraceCheckUtils]: 10: Hoare triple {14054#true} call #t~ret8 := is_do_read_c_triggered(); {14054#true} is VALID [2022-02-20 18:19:20,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {14054#true} havoc ~__retres1~1; {14054#true} is VALID [2022-02-20 18:19:20,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {14054#true} assume !(1 == ~c_dr_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {14054#true} ~__retres1~1 := 0; {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:20,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,201 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14054#true} #312#return; {14108#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:20,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#(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; {14109#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} is VALID [2022-02-20 18:19:20,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {14109#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14055#false} is VALID [2022-02-20 18:19:20,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {14055#false} assume true; {14055#false} is VALID [2022-02-20 18:19:20,203 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14055#false} {14054#true} #318#return; {14055#false} is VALID [2022-02-20 18:19:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {14094#(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); {14054#true} is VALID [2022-02-20 18:19:20,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14054#true} is VALID [2022-02-20 18:19:20,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14054#true} {14055#false} #320#return; {14055#false} is VALID [2022-02-20 18:19:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:20,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {14054#true} havoc ~__retres1~2; {14054#true} is VALID [2022-02-20 18:19:20,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14054#true} is VALID [2022-02-20 18:19:20,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#true} #res := ~__retres1~2; {14054#true} is VALID [2022-02-20 18:19:20,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,212 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14054#true} {14055#false} #322#return; {14055#false} is VALID [2022-02-20 18:19:20,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {14054#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; {14054#true} is VALID [2022-02-20 18:19:20,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {14054#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; {14054#true} is VALID [2022-02-20 18:19:20,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {14054#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; {14054#true} is VALID [2022-02-20 18:19:20,213 INFO L272 TraceCheckUtils]: 3: Hoare triple {14054#true} call update_channels(); {14093#(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:20,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {14093#(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); {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14054#true} {14054#true} #314#return; {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {14054#true} assume { :begin_inline_init_threads } true; {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {14054#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {14054#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14054#true} is VALID [2022-02-20 18:19:20,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {14054#true} assume { :end_inline_init_threads } true; {14054#true} is VALID [2022-02-20 18:19:20,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {14054#true} call fire_delta_events(); {14094#(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:20,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {14094#(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); {14054#true} is VALID [2022-02-20 18:19:20,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {14054#true} assume !(0 == ~q_write_ev~0); {14054#true} is VALID [2022-02-20 18:19:20,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14054#true} {14054#true} #316#return; {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L272 TraceCheckUtils]: 16: Hoare triple {14054#true} call activate_threads(); {14095#(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:20,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {14095#(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; {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L272 TraceCheckUtils]: 18: Hoare triple {14054#true} call #t~ret7 := is_do_write_p_triggered(); {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {14054#true} havoc ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {14054#true} assume !(1 == ~p_dw_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {14054#true} ~__retres1~0 := 0; {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {14054#true} #res := ~__retres1~0; {14054#true} is VALID [2022-02-20 18:19:20,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14054#true} {14054#true} #310#return; {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {14054#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {14054#true} assume !(0 != ~tmp~1); {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L272 TraceCheckUtils]: 27: Hoare triple {14054#true} call #t~ret8 := is_do_read_c_triggered(); {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {14054#true} havoc ~__retres1~1; {14054#true} is VALID [2022-02-20 18:19:20,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {14054#true} assume !(1 == ~c_dr_pc~0); {14054#true} is VALID [2022-02-20 18:19:20,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {14054#true} ~__retres1~1 := 0; {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 18:19:20,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {14110#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 18:19:20,219 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14111#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14054#true} #312#return; {14108#(and (<= |activate_threads_#t~ret8| 0) (<= 0 |activate_threads_#t~ret8|))} is VALID [2022-02-20 18:19:20,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {14108#(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; {14109#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} is VALID [2022-02-20 18:19:20,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {14109#(and (<= activate_threads_~tmp___0~1 0) (< 0 (+ activate_threads_~tmp___0~1 1)))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14055#false} is VALID [2022-02-20 18:19:20,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {14055#false} assume true; {14055#false} is VALID [2022-02-20 18:19:20,220 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14055#false} {14054#true} #318#return; {14055#false} is VALID [2022-02-20 18:19:20,221 INFO L272 TraceCheckUtils]: 38: Hoare triple {14055#false} call reset_delta_events(); {14094#(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:20,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {14094#(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); {14054#true} is VALID [2022-02-20 18:19:20,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {14054#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14054#true} is VALID [2022-02-20 18:19:20,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,221 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14054#true} {14055#false} #320#return; {14055#false} is VALID [2022-02-20 18:19:20,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {14055#false} assume !false; {14055#false} is VALID [2022-02-20 18:19:20,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {14055#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; {14055#false} is VALID [2022-02-20 18:19:20,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {14055#false} assume !false; {14055#false} is VALID [2022-02-20 18:19:20,222 INFO L272 TraceCheckUtils]: 46: Hoare triple {14055#false} call eval_#t~ret9#1 := exists_runnable_thread(); {14054#true} is VALID [2022-02-20 18:19:20,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {14054#true} havoc ~__retres1~2; {14054#true} is VALID [2022-02-20 18:19:20,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {14054#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14054#true} is VALID [2022-02-20 18:19:20,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {14054#true} #res := ~__retres1~2; {14054#true} is VALID [2022-02-20 18:19:20,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {14054#true} assume true; {14054#true} is VALID [2022-02-20 18:19:20,222 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14054#true} {14055#false} #322#return; {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {14055#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; {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {14055#false} assume 0 != eval_~tmp___1~0#1; {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {14055#false} 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; {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {14055#false} assume !(0 != eval_~tmp~2#1); {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L272 TraceCheckUtils]: 56: Hoare triple {14055#false} call error(); {14055#false} is VALID [2022-02-20 18:19:20,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {14055#false} assume !false; {14055#false} is VALID [2022-02-20 18:19:20,224 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:20,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:20,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665798873] [2022-02-20 18:19:20,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665798873] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:20,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:20,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:19:20,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102396521] [2022-02-20 18:19:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:20,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:20,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:20,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:20,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:19:20,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:19:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:19:20,265 INFO L87 Difference]: Start difference. First operand 1432 states and 1877 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:22,527 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2022-02-20 18:19:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:19:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 291 transitions. [2022-02-20 18:19:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 291 transitions. [2022-02-20 18:19:22,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 291 transitions. [2022-02-20 18:19:22,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:22,923 INFO L225 Difference]: With dead ends: 3031 [2022-02-20 18:19:22,924 INFO L226 Difference]: Without dead ends: 1621 [2022-02-20 18:19:22,926 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:22,927 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 162 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:22,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 481 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:19:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-02-20 18:19:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2022-02-20 18:19:23,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:23,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1621 states. Second operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:23,534 INFO L74 IsIncluded]: Start isIncluded. First operand 1621 states. Second operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:23,538 INFO L87 Difference]: Start difference. First operand 1621 states. Second operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:23,661 INFO L93 Difference]: Finished difference Result 1621 states and 2096 transitions. [2022-02-20 18:19:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2096 transitions. [2022-02-20 18:19:23,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:23,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:23,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) Second operand 1621 states. [2022-02-20 18:19:23,686 INFO L87 Difference]: Start difference. First operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) Second operand 1621 states. [2022-02-20 18:19:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:23,813 INFO L93 Difference]: Finished difference Result 1621 states and 2096 transitions. [2022-02-20 18:19:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2096 transitions. [2022-02-20 18:19:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:23,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:23,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:23,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-02-20 18:19:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2022-02-20 18:19:23,961 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2022-02-20 18:19:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:23,961 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2022-02-20 18:19:23,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 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:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2022-02-20 18:19:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:23,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:23,963 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] [2022-02-20 18:19:23,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:19:23,964 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2022-02-20 18:19:23,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:23,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220591567] [2022-02-20 18:19:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:19:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {23437#(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); {23438#(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:24,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23438#(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:24,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #314#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:19:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {23438#(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); {23438#(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:24,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {23438#(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); {23438#(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:24,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23438#(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:24,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #316#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:19:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:19:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {23397#true} havoc ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {23397#true} assume !(1 == ~p_dw_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {23397#true} ~__retres1~0 := 0; {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {23397#true} #res := ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23397#true} {23397#true} #310#return; {23397#true} is VALID [2022-02-20 18:19:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:19:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {23397#true} havoc ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {23397#true} assume !(1 == ~c_dr_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {23397#true} ~__retres1~1 := 0; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {23397#true} #res := ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23397#true} {23397#true} #312#return; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {23439#(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; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L272 TraceCheckUtils]: 1: Hoare triple {23397#true} call #t~ret7 := is_do_write_p_triggered(); {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {23397#true} havoc ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {23397#true} assume !(1 == ~p_dw_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {23397#true} ~__retres1~0 := 0; {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {23397#true} #res := ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23397#true} {23397#true} #310#return; {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {23397#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {23397#true} assume !(0 != ~tmp~1); {23397#true} is VALID [2022-02-20 18:19:24,062 INFO L272 TraceCheckUtils]: 10: Hoare triple {23397#true} call #t~ret8 := is_do_read_c_triggered(); {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {23397#true} havoc ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {23397#true} assume !(1 == ~c_dr_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {23397#true} ~__retres1~1 := 0; {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {23397#true} #res := ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23397#true} {23397#true} #312#return; {23397#true} is VALID [2022-02-20 18:19:24,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {23397#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {23397#true} is VALID [2022-02-20 18:19:24,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {23397#true} assume !(0 != ~tmp___0~1); {23397#true} is VALID [2022-02-20 18:19:24,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,064 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23397#true} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #318#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 18:19:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {23438#(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); {23452#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 18:19:24,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {23452#(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; {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:24,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:24,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #320#return; {23398#false} is VALID [2022-02-20 18:19:24,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 18:19:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:24,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {23397#true} havoc ~__retres1~2; {23397#true} is VALID [2022-02-20 18:19:24,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {23397#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23397#true} is VALID [2022-02-20 18:19:24,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {23397#true} #res := ~__retres1~2; {23397#true} is VALID [2022-02-20 18:19:24,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,092 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23397#true} {23398#false} #322#return; {23398#false} is VALID [2022-02-20 18:19:24,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {23397#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; {23397#true} is VALID [2022-02-20 18:19:24,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {23397#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; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {23399#(= ~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; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,094 INFO L272 TraceCheckUtils]: 3: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels(); {23437#(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:24,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {23437#(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); {23438#(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:24,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23438#(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:24,095 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #314#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads } true; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads } true; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,097 INFO L272 TraceCheckUtils]: 11: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events(); {23438#(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:24,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {23438#(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); {23438#(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:24,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {23438#(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); {23438#(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:24,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {23438#(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:24,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23438#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #316#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,099 INFO L272 TraceCheckUtils]: 16: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads(); {23439#(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:24,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {23439#(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; {23397#true} is VALID [2022-02-20 18:19:24,099 INFO L272 TraceCheckUtils]: 18: Hoare triple {23397#true} call #t~ret7 := is_do_write_p_triggered(); {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {23397#true} havoc ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {23397#true} assume !(1 == ~p_dw_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {23397#true} ~__retres1~0 := 0; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {23397#true} #res := ~__retres1~0; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23397#true} {23397#true} #310#return; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {23397#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~tmp~1 := #t~ret7;havoc #t~ret7; {23397#true} is VALID [2022-02-20 18:19:24,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {23397#true} assume !(0 != ~tmp~1); {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {23397#true} call #t~ret8 := is_do_read_c_triggered(); {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {23397#true} havoc ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {23397#true} assume !(1 == ~c_dr_pc~0); {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {23397#true} ~__retres1~1 := 0; {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {23397#true} #res := ~__retres1~1; {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,101 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23397#true} {23397#true} #312#return; {23397#true} is VALID [2022-02-20 18:19:24,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {23397#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp___0~1 := #t~ret8;havoc #t~ret8; {23397#true} is VALID [2022-02-20 18:19:24,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {23397#true} assume !(0 != ~tmp___0~1); {23397#true} is VALID [2022-02-20 18:19:24,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,102 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23397#true} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #318#return; {23399#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 18:19:24,103 INFO L272 TraceCheckUtils]: 38: Hoare triple {23399#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events(); {23438#(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:24,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {23438#(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); {23452#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 18:19:24,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {23452#(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; {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:24,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 18:19:24,104 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23453#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {23399#(= ~q_write_ev~0 ~q_read_ev~0)} #320#return; {23398#false} is VALID [2022-02-20 18:19:24,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {23398#false} assume !false; {23398#false} is VALID [2022-02-20 18:19:24,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {23398#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; {23398#false} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {23398#false} assume !false; {23398#false} is VALID [2022-02-20 18:19:24,105 INFO L272 TraceCheckUtils]: 46: Hoare triple {23398#false} call eval_#t~ret9#1 := exists_runnable_thread(); {23397#true} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {23397#true} havoc ~__retres1~2; {23397#true} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {23397#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23397#true} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {23397#true} #res := ~__retres1~2; {23397#true} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {23397#true} assume true; {23397#true} is VALID [2022-02-20 18:19:24,105 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {23397#true} {23398#false} #322#return; {23398#false} is VALID [2022-02-20 18:19:24,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {23398#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; {23398#false} is VALID [2022-02-20 18:19:24,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {23398#false} assume 0 != eval_~tmp___1~0#1; {23398#false} is VALID [2022-02-20 18:19:24,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {23398#false} 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; {23398#false} is VALID [2022-02-20 18:19:24,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {23398#false} assume !(0 != eval_~tmp~2#1); {23398#false} is VALID [2022-02-20 18:19:24,106 INFO L272 TraceCheckUtils]: 56: Hoare triple {23398#false} call error(); {23398#false} is VALID [2022-02-20 18:19:24,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {23398#false} assume !false; {23398#false} is VALID [2022-02-20 18:19:24,106 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:24,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:19:24,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220591567] [2022-02-20 18:19:24,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220591567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:24,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:24,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:19:24,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48721486] [2022-02-20 18:19:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:24,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:24,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:24,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:24,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:24,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:19:24,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:19:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:19:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:19:24,145 INFO L87 Difference]: Start difference. First operand 1477 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:26,587 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2022-02-20 18:19:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:19:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2022-02-20 18:19:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 463 transitions. [2022-02-20 18:19:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 463 transitions. [2022-02-20 18:19:26,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 463 transitions. [2022-02-20 18:19:26,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:27,112 INFO L225 Difference]: With dead ends: 2912 [2022-02-20 18:19:27,113 INFO L226 Difference]: Without dead ends: 1676 [2022-02-20 18:19:27,115 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:27,116 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 412 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:27,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 420 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:19:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-02-20 18:19:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2022-02-20 18:19:27,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:27,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1676 states. Second operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 1676 states. Second operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:27,747 INFO L87 Difference]: Start difference. First operand 1676 states. Second operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:27,867 INFO L93 Difference]: Finished difference Result 1676 states and 2144 transitions. [2022-02-20 18:19:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2144 transitions. [2022-02-20 18:19:27,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:27,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:27,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) Second operand 1676 states. [2022-02-20 18:19:27,875 INFO L87 Difference]: Start difference. First operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) Second operand 1676 states. [2022-02-20 18:19:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:27,974 INFO L93 Difference]: Finished difference Result 1676 states and 2144 transitions. [2022-02-20 18:19:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2144 transitions. [2022-02-20 18:19:27,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:27,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:27,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:27,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-02-20 18:19:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2022-02-20 18:19:28,105 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2022-02-20 18:19:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:28,105 INFO L470 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2022-02-20 18:19:28,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2022-02-20 18:19:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:28,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:28,106 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] [2022-02-20 18:19:28,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:19:28,106 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-02-20 18:19:28,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:19:28,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484552355] [2022-02-20 18:19:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:19:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:19:28,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:19:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:19:28,173 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:19:28,173 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:19:28,175 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:19:28,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:19:28,179 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:19:28,182 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:19:28,230 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels(); [2022-02-20 18:19:28,235 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:19:28,242 INFO L158 Benchmark]: Toolchain (without parser) took 24054.19ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 59.2MB in the beginning and 150.7MB in the end (delta: -91.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,243 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:19:28,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.23ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 70.5MB in the end (delta: -11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.47ms. Allocated memory is still 98.6MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,244 INFO L158 Benchmark]: Boogie Preprocessor took 26.42ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 67.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,244 INFO L158 Benchmark]: RCFGBuilder took 449.60ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 49.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,244 INFO L158 Benchmark]: TraceAbstraction took 23239.95ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 49.3MB in the beginning and 150.7MB in the end (delta: -101.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-02-20 18:19:28,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.23ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 70.5MB in the end (delta: -11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.47ms. Allocated memory is still 98.6MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.42ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 67.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.60ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 49.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23239.95ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 49.3MB in the beginning and 150.7MB in the end (delta: -101.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:19:28,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:19:30,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:19:30,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:19:30,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:19:30,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:19:30,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:19:30,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:19:30,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:19:30,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:19:30,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:19:30,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:19:30,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:19:30,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:19:30,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:19:30,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:19:30,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:19:30,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:19:30,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:19:30,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:19:30,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:19:30,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:19:30,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:19:30,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:19:30,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:19:30,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:19:30,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:19:30,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:19:30,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:19:30,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:19:30,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:19:30,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:19:30,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:19:30,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:19:30,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:19:30,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:19:30,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:19:30,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:19:30,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:19:30,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:19:30,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:19:30,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:19:30,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 18:19:30,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:19:30,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:19:30,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:19:30,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:19:30,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:19:30,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:19:30,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:19:30,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:19:30,385 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:19:30,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:19:30,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:19:30,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:19:30,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:19:30,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:19:30,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:19:30,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:19:30,387 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:19:30,387 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:19:30,387 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:19:30,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:19:30,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:19:30,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:19:30,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:19:30,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:19:30,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:19:30,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:19:30,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:19:30,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:19:30,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:19:30,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:19:30,390 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:19:30,390 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:19:30,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:19:30,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:19:30,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:19:30,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:19:30,391 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2022-02-20 18:19:30,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:19:30,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:19:30,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:19:30,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:19:30,766 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:19:30,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-02-20 18:19:30,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2434be317/101c633f79f440d2a5352653591e844d/FLAG32ea2d98e [2022-02-20 18:19:31,240 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:19:31,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-02-20 18:19:31,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2434be317/101c633f79f440d2a5352653591e844d/FLAG32ea2d98e [2022-02-20 18:19:31,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2434be317/101c633f79f440d2a5352653591e844d [2022-02-20 18:19:31,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:19:31,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:19:31,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:19:31,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:19:31,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:19:31,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341dd643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31, skipping insertion in model container [2022-02-20 18:19:31,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:19:31,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:19:31,453 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-2.c[643,656] [2022-02-20 18:19:31,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:19:31,566 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:19:31,581 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-2.c[643,656] [2022-02-20 18:19:31,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:19:31,637 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:19:31,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31 WrapperNode [2022-02-20 18:19:31,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:19:31,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:19:31,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:19:31,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:19:31,646 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:19:31" (1/1) ... [2022-02-20 18:19:31,666 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:19:31" (1/1) ... [2022-02-20 18:19:31,699 INFO L137 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 182 [2022-02-20 18:19:31,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:19:31,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:19:31,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:19:31,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:19:31,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:19:31,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:19:31,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:19:31,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:19:31,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (1/1) ... [2022-02-20 18:19:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:19:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:19:31,780 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:19:31,809 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:19:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:19:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:19:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 18:19:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 18:19:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 18:19:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 18:19:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 18:19:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 18:19:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 18:19:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 18:19:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 18:19:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 18:19:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 18:19:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 18:19:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 18:19:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 18:19:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:19:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:19:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 18:19:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 18:19:31,898 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:19:31,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:19:32,180 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:19:32,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:19:32,187 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 18:19:32,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:19:32 BoogieIcfgContainer [2022-02-20 18:19:32,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:19:32,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:19:32,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:19:32,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:19:32,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:19:31" (1/3) ... [2022-02-20 18:19:32,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266a3e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:19:32, skipping insertion in model container [2022-02-20 18:19:32,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:19:31" (2/3) ... [2022-02-20 18:19:32,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266a3e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:19:32, skipping insertion in model container [2022-02-20 18:19:32,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:19:32" (3/3) ... [2022-02-20 18:19:32,208 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-02-20 18:19:32,213 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:19:32,213 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:19:32,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:19:32,270 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:19:32,270 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:19:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:19:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:32,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:32,306 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] [2022-02-20 18:19:32,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-02-20 18:19:32,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:32,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922179549] [2022-02-20 18:19:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:32,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:32,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:32,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 18:19:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:32,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:19:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:32,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:19:32,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32; {107#true} is VALID [2022-02-20 18:19:32,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} 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 := 0bv32; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,755 INFO L272 TraceCheckUtils]: 3: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} call update_channels(); {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} assume !(1bv32 == ~q_req_up~0); {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} assume true; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,757 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {115#(= ~c_dr_i~0 (_ bv1 32))} {115#(= ~c_dr_i~0 (_ bv1 32))} #314#return; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} assume { :begin_inline_init_threads } true; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {115#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 18:19:32,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#(= ~c_dr_i~0 (_ bv1 32))} assume !(1bv32 == ~c_dr_i~0);~c_dr_st~0 := 2bv32; {108#false} is VALID [2022-02-20 18:19:32,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume { :end_inline_init_threads } true; {108#false} is VALID [2022-02-20 18:19:32,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {108#false} call fire_delta_events(); {108#false} is VALID [2022-02-20 18:19:32,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#false} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {108#false} is VALID [2022-02-20 18:19:32,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {108#false} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {108#false} is VALID [2022-02-20 18:19:32,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {108#false} {108#false} #316#return; {108#false} is VALID [2022-02-20 18:19:32,760 INFO L272 TraceCheckUtils]: 16: Hoare triple {108#false} call activate_threads(); {108#false} is VALID [2022-02-20 18:19:32,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {108#false} havoc ~tmp~1;havoc ~tmp___0~1; {108#false} is VALID [2022-02-20 18:19:32,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {108#false} call #t~ret7 := is_do_write_p_triggered(); {108#false} is VALID [2022-02-20 18:19:32,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {108#false} havoc ~__retres1~0; {108#false} is VALID [2022-02-20 18:19:32,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {108#false} assume 1bv32 == ~p_dw_pc~0; {108#false} is VALID [2022-02-20 18:19:32,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {108#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {108#false} is VALID [2022-02-20 18:19:32,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {108#false} #res := ~__retres1~0; {108#false} is VALID [2022-02-20 18:19:32,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,764 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {108#false} {108#false} #310#return; {108#false} is VALID [2022-02-20 18:19:32,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {108#false} ~tmp~1 := #t~ret7;havoc #t~ret7; {108#false} is VALID [2022-02-20 18:19:32,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {108#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {108#false} is VALID [2022-02-20 18:19:32,765 INFO L272 TraceCheckUtils]: 27: Hoare triple {108#false} call #t~ret8 := is_do_read_c_triggered(); {108#false} is VALID [2022-02-20 18:19:32,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {108#false} havoc ~__retres1~1; {108#false} is VALID [2022-02-20 18:19:32,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {108#false} assume 1bv32 == ~c_dr_pc~0; {108#false} is VALID [2022-02-20 18:19:32,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {108#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {108#false} is VALID [2022-02-20 18:19:32,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {108#false} #res := ~__retres1~1; {108#false} is VALID [2022-02-20 18:19:32,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,768 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {108#false} {108#false} #312#return; {108#false} is VALID [2022-02-20 18:19:32,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {108#false} ~tmp___0~1 := #t~ret8;havoc #t~ret8; {108#false} is VALID [2022-02-20 18:19:32,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {108#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {108#false} is VALID [2022-02-20 18:19:32,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,769 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {108#false} {108#false} #318#return; {108#false} is VALID [2022-02-20 18:19:32,769 INFO L272 TraceCheckUtils]: 38: Hoare triple {108#false} call reset_delta_events(); {108#false} is VALID [2022-02-20 18:19:32,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {108#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {108#false} is VALID [2022-02-20 18:19:32,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {108#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {108#false} is VALID [2022-02-20 18:19:32,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,772 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {108#false} {108#false} #320#return; {108#false} is VALID [2022-02-20 18:19:32,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:32,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {108#false} start_simulation_~kernel_st~0#1 := 1bv32;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; {108#false} is VALID [2022-02-20 18:19:32,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:32,773 INFO L272 TraceCheckUtils]: 46: Hoare triple {108#false} call eval_#t~ret9#1 := exists_runnable_thread(); {108#false} is VALID [2022-02-20 18:19:32,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {108#false} havoc ~__retres1~2; {108#false} is VALID [2022-02-20 18:19:32,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {108#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {108#false} is VALID [2022-02-20 18:19:32,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {108#false} #res := ~__retres1~2; {108#false} is VALID [2022-02-20 18:19:32,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 18:19:32,778 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {108#false} {108#false} #322#return; {108#false} is VALID [2022-02-20 18:19:32,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {108#false} eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {108#false} is VALID [2022-02-20 18:19:32,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {108#false} assume 0bv32 != eval_~tmp___1~0#1; {108#false} is VALID [2022-02-20 18:19:32,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {108#false} assume 0bv32 == ~p_dw_st~0;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {108#false} is VALID [2022-02-20 18:19:32,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {108#false} assume !(0bv32 != eval_~tmp~2#1); {108#false} is VALID [2022-02-20 18:19:32,784 INFO L272 TraceCheckUtils]: 56: Hoare triple {108#false} call error(); {108#false} is VALID [2022-02-20 18:19:32,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 18:19:32,786 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:32,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:19:32,788 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:19:32,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922179549] [2022-02-20 18:19:32,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922179549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:32,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:32,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:19:32,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26279180] [2022-02-20 18:19:32,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:32,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:32,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:32,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:32,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:19:32,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:19:32,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:19:32,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:19:32,901 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:33,119 INFO L93 Difference]: Finished difference Result 199 states and 289 transitions. [2022-02-20 18:19:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:19:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2022-02-20 18:19:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2022-02-20 18:19:33,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 289 transitions. [2022-02-20 18:19:33,444 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:33,455 INFO L225 Difference]: With dead ends: 199 [2022-02-20 18:19:33,455 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 18:19:33,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:19:33,461 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:33,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:19:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 18:19:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-20 18:19:33,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:33,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:33,495 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:33,495 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:33,502 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2022-02-20 18:19:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-02-20 18:19:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:33,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 98 states. [2022-02-20 18:19:33,505 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 98 states. [2022-02-20 18:19:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:33,512 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2022-02-20 18:19:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-02-20 18:19:33,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:33,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:33,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:33,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:19:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-02-20 18:19:33,521 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-02-20 18:19:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:33,521 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-02-20 18:19:33,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-02-20 18:19:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:33,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:33,524 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] [2022-02-20 18:19:33,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:19:33,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:33,733 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-02-20 18:19:33,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:33,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018387625] [2022-02-20 18:19:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:33,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:33,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:33,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 18:19:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:33,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:19:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:33,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:19:34,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {898#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32; {898#true} is VALID [2022-02-20 18:19:34,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {898#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#(= (_ bv2 32) ~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 := 0bv32; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,002 INFO L272 TraceCheckUtils]: 3: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} call update_channels(); {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,004 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {906#(= (_ bv2 32) ~q_read_ev~0)} #314#return; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads } true; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads } true; {906#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,007 INFO L272 TraceCheckUtils]: 11: Hoare triple {906#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events(); {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 18:19:34,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {941#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 18:19:34,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {941#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {941#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 18:19:34,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {941#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {941#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 18:19:34,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {941#(= |old(~q_read_ev~0)| (_ bv0 32))} {906#(= (_ bv2 32) ~q_read_ev~0)} #316#return; {899#false} is VALID [2022-02-20 18:19:34,009 INFO L272 TraceCheckUtils]: 16: Hoare triple {899#false} call activate_threads(); {899#false} is VALID [2022-02-20 18:19:34,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#false} havoc ~tmp~1;havoc ~tmp___0~1; {899#false} is VALID [2022-02-20 18:19:34,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {899#false} call #t~ret7 := is_do_write_p_triggered(); {899#false} is VALID [2022-02-20 18:19:34,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {899#false} havoc ~__retres1~0; {899#false} is VALID [2022-02-20 18:19:34,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {899#false} assume 1bv32 == ~p_dw_pc~0; {899#false} is VALID [2022-02-20 18:19:34,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {899#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {899#false} is VALID [2022-02-20 18:19:34,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {899#false} #res := ~__retres1~0; {899#false} is VALID [2022-02-20 18:19:34,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {899#false} assume true; {899#false} is VALID [2022-02-20 18:19:34,011 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {899#false} {899#false} #310#return; {899#false} is VALID [2022-02-20 18:19:34,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {899#false} ~tmp~1 := #t~ret7;havoc #t~ret7; {899#false} is VALID [2022-02-20 18:19:34,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {899#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {899#false} is VALID [2022-02-20 18:19:34,011 INFO L272 TraceCheckUtils]: 27: Hoare triple {899#false} call #t~ret8 := is_do_read_c_triggered(); {899#false} is VALID [2022-02-20 18:19:34,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {899#false} havoc ~__retres1~1; {899#false} is VALID [2022-02-20 18:19:34,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {899#false} assume 1bv32 == ~c_dr_pc~0; {899#false} is VALID [2022-02-20 18:19:34,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {899#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {899#false} is VALID [2022-02-20 18:19:34,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {899#false} #res := ~__retres1~1; {899#false} is VALID [2022-02-20 18:19:34,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {899#false} assume true; {899#false} is VALID [2022-02-20 18:19:34,012 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {899#false} {899#false} #312#return; {899#false} is VALID [2022-02-20 18:19:34,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {899#false} ~tmp___0~1 := #t~ret8;havoc #t~ret8; {899#false} is VALID [2022-02-20 18:19:34,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {899#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {899#false} is VALID [2022-02-20 18:19:34,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {899#false} assume true; {899#false} is VALID [2022-02-20 18:19:34,013 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {899#false} {899#false} #318#return; {899#false} is VALID [2022-02-20 18:19:34,014 INFO L272 TraceCheckUtils]: 38: Hoare triple {899#false} call reset_delta_events(); {899#false} is VALID [2022-02-20 18:19:34,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {899#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {899#false} is VALID [2022-02-20 18:19:34,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {899#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {899#false} is VALID [2022-02-20 18:19:34,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {899#false} assume true; {899#false} is VALID [2022-02-20 18:19:34,014 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {899#false} {899#false} #320#return; {899#false} is VALID [2022-02-20 18:19:34,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 18:19:34,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {899#false} start_simulation_~kernel_st~0#1 := 1bv32;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; {899#false} is VALID [2022-02-20 18:19:34,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 18:19:34,015 INFO L272 TraceCheckUtils]: 46: Hoare triple {899#false} call eval_#t~ret9#1 := exists_runnable_thread(); {899#false} is VALID [2022-02-20 18:19:34,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {899#false} havoc ~__retres1~2; {899#false} is VALID [2022-02-20 18:19:34,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {899#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {899#false} is VALID [2022-02-20 18:19:34,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {899#false} #res := ~__retres1~2; {899#false} is VALID [2022-02-20 18:19:34,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {899#false} assume true; {899#false} is VALID [2022-02-20 18:19:34,016 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {899#false} {899#false} #322#return; {899#false} is VALID [2022-02-20 18:19:34,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {899#false} eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {899#false} is VALID [2022-02-20 18:19:34,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {899#false} assume 0bv32 != eval_~tmp___1~0#1; {899#false} is VALID [2022-02-20 18:19:34,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {899#false} assume 0bv32 == ~p_dw_st~0;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {899#false} is VALID [2022-02-20 18:19:34,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {899#false} assume !(0bv32 != eval_~tmp~2#1); {899#false} is VALID [2022-02-20 18:19:34,017 INFO L272 TraceCheckUtils]: 56: Hoare triple {899#false} call error(); {899#false} is VALID [2022-02-20 18:19:34,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 18:19:34,018 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:34,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:19:34,018 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:19:34,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018387625] [2022-02-20 18:19:34,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018387625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:34,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:34,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:19:34,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888642904] [2022-02-20 18:19:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:34,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:34,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:34,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:34,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:19:34,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:19:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:19:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:19:34,074 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:34,798 INFO L93 Difference]: Finished difference Result 291 states and 402 transitions. [2022-02-20 18:19:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:19:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2022-02-20 18:19:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2022-02-20 18:19:34,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 402 transitions. [2022-02-20 18:19:35,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:35,178 INFO L225 Difference]: With dead ends: 291 [2022-02-20 18:19:35,178 INFO L226 Difference]: Without dead ends: 202 [2022-02-20 18:19:35,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:35,184 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 204 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:35,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 368 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:19:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-20 18:19:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2022-02-20 18:19:35,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:35,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:35,216 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:35,218 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:35,228 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2022-02-20 18:19:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 272 transitions. [2022-02-20 18:19:35,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:35,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 202 states. [2022-02-20 18:19:35,238 INFO L87 Difference]: Start difference. First operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) Second operand 202 states. [2022-02-20 18:19:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:35,248 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2022-02-20 18:19:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 272 transitions. [2022-02-20 18:19:35,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:35,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:35,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:35,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-20 18:19:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-02-20 18:19:35,260 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-02-20 18:19:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:35,260 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-02-20 18:19:35,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-02-20 18:19:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:35,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:35,266 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] [2022-02-20 18:19:35,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:19:35,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:35,475 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-02-20 18:19:35,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:35,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688647116] [2022-02-20 18:19:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:35,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 18:19:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:35,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:19:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:35,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:19:35,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {2157#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32; {2157#true} is VALID [2022-02-20 18:19:35,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2157#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {2165#(= (_ bv2 32) ~q_write_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 := 0bv32; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,709 INFO L272 TraceCheckUtils]: 3: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} call update_channels(); {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,710 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {2165#(= (_ bv2 32) ~q_write_ev~0)} #314#return; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads } true; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads } true; {2165#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {2165#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events(); {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 18:19:35,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {2203#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 18:19:35,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {2203#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 18:19:35,714 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2203#(= |old(~q_write_ev~0)| (_ bv0 32))} {2165#(= (_ bv2 32) ~q_write_ev~0)} #316#return; {2158#false} is VALID [2022-02-20 18:19:35,714 INFO L272 TraceCheckUtils]: 16: Hoare triple {2158#false} call activate_threads(); {2158#false} is VALID [2022-02-20 18:19:35,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {2158#false} havoc ~tmp~1;havoc ~tmp___0~1; {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L272 TraceCheckUtils]: 18: Hoare triple {2158#false} call #t~ret7 := is_do_write_p_triggered(); {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {2158#false} havoc ~__retres1~0; {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {2158#false} assume !(1bv32 == ~p_dw_pc~0); {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {2158#false} ~__retres1~0 := 0bv32; {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {2158#false} #res := ~__retres1~0; {2158#false} is VALID [2022-02-20 18:19:35,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {2158#false} assume true; {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2158#false} {2158#false} #310#return; {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {2158#false} ~tmp~1 := #t~ret7;havoc #t~ret7; {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {2158#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L272 TraceCheckUtils]: 27: Hoare triple {2158#false} call #t~ret8 := is_do_read_c_triggered(); {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {2158#false} havoc ~__retres1~1; {2158#false} is VALID [2022-02-20 18:19:35,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {2158#false} assume 1bv32 == ~c_dr_pc~0; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {2158#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {2158#false} #res := ~__retres1~1; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {2158#false} assume true; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2158#false} {2158#false} #312#return; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {2158#false} ~tmp___0~1 := #t~ret8;havoc #t~ret8; {2158#false} is VALID [2022-02-20 18:19:35,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {2158#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {2158#false} assume true; {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2158#false} {2158#false} #318#return; {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L272 TraceCheckUtils]: 38: Hoare triple {2158#false} call reset_delta_events(); {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {2158#false} assume !(1bv32 == ~q_read_ev~0); {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {2158#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {2158#false} assume true; {2158#false} is VALID [2022-02-20 18:19:35,718 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2158#false} {2158#false} #320#return; {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {2158#false} assume !false; {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {2158#false} start_simulation_~kernel_st~0#1 := 1bv32;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; {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {2158#false} assume !false; {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L272 TraceCheckUtils]: 46: Hoare triple {2158#false} call eval_#t~ret9#1 := exists_runnable_thread(); {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {2158#false} havoc ~__retres1~2; {2158#false} is VALID [2022-02-20 18:19:35,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {2158#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {2158#false} #res := ~__retres1~2; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {2158#false} assume true; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2158#false} {2158#false} #322#return; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {2158#false} eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {2158#false} assume 0bv32 != eval_~tmp___1~0#1; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {2158#false} assume 0bv32 == ~p_dw_st~0;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {2158#false} is VALID [2022-02-20 18:19:35,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {2158#false} assume !(0bv32 != eval_~tmp~2#1); {2158#false} is VALID [2022-02-20 18:19:35,721 INFO L272 TraceCheckUtils]: 56: Hoare triple {2158#false} call error(); {2158#false} is VALID [2022-02-20 18:19:35,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {2158#false} assume !false; {2158#false} is VALID [2022-02-20 18:19:35,721 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:35,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:19:35,721 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:19:35,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688647116] [2022-02-20 18:19:35,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688647116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:35,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:35,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:19:35,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925801189] [2022-02-20 18:19:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:35,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:35,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:35,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:35,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:19:35,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:19:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:19:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:19:35,773 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:36,469 INFO L93 Difference]: Finished difference Result 588 states and 817 transitions. [2022-02-20 18:19:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:19:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-02-20 18:19:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2022-02-20 18:19:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2022-02-20 18:19:36,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 400 transitions. [2022-02-20 18:19:36,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:36,832 INFO L225 Difference]: With dead ends: 588 [2022-02-20 18:19:36,832 INFO L226 Difference]: Without dead ends: 408 [2022-02-20 18:19:36,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:36,839 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 196 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:36,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 373 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:19:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-02-20 18:19:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 399. [2022-02-20 18:19:36,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:36,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2022-02-20 18:19:36,908 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2022-02-20 18:19:36,911 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2022-02-20 18:19:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:36,932 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2022-02-20 18:19:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2022-02-20 18:19:36,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:36,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:36,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) Second operand 408 states. [2022-02-20 18:19:36,936 INFO L87 Difference]: Start difference. First operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) Second operand 408 states. [2022-02-20 18:19:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:36,955 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2022-02-20 18:19:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2022-02-20 18:19:36,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:36,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:36,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:36,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 312 states have (on average 1.3557692307692308) internal successors, (423), 325 states have internal predecessors, (423), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2022-02-20 18:19:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 541 transitions. [2022-02-20 18:19:36,979 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 541 transitions. Word has length 58 [2022-02-20 18:19:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:36,980 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 541 transitions. [2022-02-20 18:19:36,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:19:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 541 transitions. [2022-02-20 18:19:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:36,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:36,981 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] [2022-02-20 18:19:36,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:19:37,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:37,191 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1945384473, now seen corresponding path program 1 times [2022-02-20 18:19:37,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:37,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033064881] [2022-02-20 18:19:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:37,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:37,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:37,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:37,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 18:19:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:37,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 18:19:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:19:37,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32; {4507#true} is VALID [2022-02-20 18:19:37,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {4507#true} is VALID [2022-02-20 18:19:37,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#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 := 0bv32; {4507#true} is VALID [2022-02-20 18:19:37,408 INFO L272 TraceCheckUtils]: 3: Hoare triple {4507#true} call update_channels(); {4507#true} is VALID [2022-02-20 18:19:37,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {4507#true} assume !(1bv32 == ~q_req_up~0); {4507#true} is VALID [2022-02-20 18:19:37,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-02-20 18:19:37,411 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4507#true} {4507#true} #314#return; {4507#true} is VALID [2022-02-20 18:19:37,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} assume { :begin_inline_init_threads } true; {4507#true} is VALID [2022-02-20 18:19:37,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {4507#true} is VALID [2022-02-20 18:19:37,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {4507#true} is VALID [2022-02-20 18:19:37,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {4507#true} assume { :end_inline_init_threads } true; {4507#true} is VALID [2022-02-20 18:19:37,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call fire_delta_events(); {4507#true} is VALID [2022-02-20 18:19:37,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} assume !(0bv32 == ~q_read_ev~0); {4507#true} is VALID [2022-02-20 18:19:37,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#true} assume !(0bv32 == ~q_write_ev~0); {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4507#true} {4507#true} #316#return; {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L272 TraceCheckUtils]: 16: Hoare triple {4507#true} call activate_threads(); {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} havoc ~tmp~1;havoc ~tmp___0~1; {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call #t~ret7 := is_do_write_p_triggered(); {4507#true} is VALID [2022-02-20 18:19:37,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} havoc ~__retres1~0; {4507#true} is VALID [2022-02-20 18:19:37,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(1bv32 == ~p_dw_pc~0); {4507#true} is VALID [2022-02-20 18:19:37,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} ~__retres1~0 := 0bv32; {4575#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 18:19:37,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {4575#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {4579#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 18:19:37,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {4579#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {4579#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 18:19:37,419 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4579#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {4507#true} #310#return; {4586#(= |activate_threads_#t~ret7| (_ bv0 32))} is VALID [2022-02-20 18:19:37,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {4586#(= |activate_threads_#t~ret7| (_ bv0 32))} ~tmp~1 := #t~ret7;havoc #t~ret7; {4590#(= activate_threads_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 18:19:37,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {4590#(= activate_threads_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {4508#false} is VALID [2022-02-20 18:19:37,420 INFO L272 TraceCheckUtils]: 27: Hoare triple {4508#false} call #t~ret8 := is_do_read_c_triggered(); {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {4508#false} havoc ~__retres1~1; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {4508#false} assume !(1bv32 == ~c_dr_pc~0); {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {4508#false} ~__retres1~1 := 0bv32; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {4508#false} #res := ~__retres1~1; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {4508#false} assume true; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4508#false} {4508#false} #312#return; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {4508#false} ~tmp___0~1 := #t~ret8;havoc #t~ret8; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {4508#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {4508#false} is VALID [2022-02-20 18:19:37,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {4508#false} assume true; {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4508#false} {4507#true} #318#return; {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L272 TraceCheckUtils]: 38: Hoare triple {4508#false} call reset_delta_events(); {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {4508#false} assume !(1bv32 == ~q_read_ev~0); {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {4508#false} assume !(1bv32 == ~q_write_ev~0); {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {4508#false} assume true; {4508#false} is VALID [2022-02-20 18:19:37,422 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4508#false} {4508#false} #320#return; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {4508#false} start_simulation_~kernel_st~0#1 := 1bv32;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; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L272 TraceCheckUtils]: 46: Hoare triple {4508#false} call eval_#t~ret9#1 := exists_runnable_thread(); {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {4508#false} havoc ~__retres1~2; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {4508#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {4508#false} #res := ~__retres1~2; {4508#false} is VALID [2022-02-20 18:19:37,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {4508#false} assume true; {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4508#false} {4508#false} #322#return; {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {4508#false} eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {4508#false} assume 0bv32 != eval_~tmp___1~0#1; {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {4508#false} assume 0bv32 == ~p_dw_st~0;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {4508#false} assume !(0bv32 != eval_~tmp~2#1); {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L272 TraceCheckUtils]: 56: Hoare triple {4508#false} call error(); {4508#false} is VALID [2022-02-20 18:19:37,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-02-20 18:19:37,425 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:37,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:19:37,425 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:19:37,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033064881] [2022-02-20 18:19:37,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033064881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:37,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:37,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:19:37,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315895653] [2022-02-20 18:19:37,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:37,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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 58 [2022-02-20 18:19:37,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:37,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:37,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:37,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:19:37,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:19:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:19:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:37,471 INFO L87 Difference]: Start difference. First operand 399 states and 541 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:37,896 INFO L93 Difference]: Finished difference Result 790 states and 1074 transitions. [2022-02-20 18:19:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:19:37,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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 58 [2022-02-20 18:19:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2022-02-20 18:19:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2022-02-20 18:19:37,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 266 transitions. [2022-02-20 18:19:38,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:38,124 INFO L225 Difference]: With dead ends: 790 [2022-02-20 18:19:38,124 INFO L226 Difference]: Without dead ends: 419 [2022-02-20 18:19:38,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:19:38,131 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:38,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 644 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:19:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-02-20 18:19:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 409. [2022-02-20 18:19:38,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:38,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2022-02-20 18:19:38,157 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2022-02-20 18:19:38,158 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2022-02-20 18:19:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:38,181 INFO L93 Difference]: Finished difference Result 419 states and 565 transitions. [2022-02-20 18:19:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 565 transitions. [2022-02-20 18:19:38,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:38,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:38,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) Second operand 419 states. [2022-02-20 18:19:38,186 INFO L87 Difference]: Start difference. First operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) Second operand 419 states. [2022-02-20 18:19:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:38,200 INFO L93 Difference]: Finished difference Result 419 states and 565 transitions. [2022-02-20 18:19:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 565 transitions. [2022-02-20 18:19:38,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:38,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:38,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:38,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 320 states have (on average 1.340625) internal successors, (429), 333 states have internal predecessors, (429), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2022-02-20 18:19:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 549 transitions. [2022-02-20 18:19:38,219 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 549 transitions. Word has length 58 [2022-02-20 18:19:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:38,219 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 549 transitions. [2022-02-20 18:19:38,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 549 transitions. [2022-02-20 18:19:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:38,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:38,223 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] [2022-02-20 18:19:38,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 18:19:38,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:38,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1670624859, now seen corresponding path program 1 times [2022-02-20 18:19:38,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:38,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558256209] [2022-02-20 18:19:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:38,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:38,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 18:19:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:38,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 18:19:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:19:38,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:19:38,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {7158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32; {7158#true} is VALID [2022-02-20 18:19:38,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {7158#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {7158#true} is VALID [2022-02-20 18:19:38,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {7158#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 := 0bv32; {7158#true} is VALID [2022-02-20 18:19:38,664 INFO L272 TraceCheckUtils]: 3: Hoare triple {7158#true} call update_channels(); {7158#true} is VALID [2022-02-20 18:19:38,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {7158#true} assume !(1bv32 == ~q_req_up~0); {7158#true} is VALID [2022-02-20 18:19:38,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {7158#true} assume true; {7158#true} is VALID [2022-02-20 18:19:38,664 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7158#true} {7158#true} #314#return; {7158#true} is VALID [2022-02-20 18:19:38,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {7158#true} assume { :begin_inline_init_threads } true; {7158#true} is VALID [2022-02-20 18:19:38,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {7158#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7158#true} is VALID [2022-02-20 18:19:38,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7158#true} is VALID [2022-02-20 18:19:38,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {7158#true} assume { :end_inline_init_threads } true; {7158#true} is VALID [2022-02-20 18:19:38,665 INFO L272 TraceCheckUtils]: 11: Hoare triple {7158#true} call fire_delta_events(); {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {7158#true} assume !(0bv32 == ~q_read_ev~0); {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {7158#true} assume !(0bv32 == ~q_write_ev~0); {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {7158#true} assume true; {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7158#true} {7158#true} #316#return; {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L272 TraceCheckUtils]: 16: Hoare triple {7158#true} call activate_threads(); {7158#true} is VALID [2022-02-20 18:19:38,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {7158#true} havoc ~tmp~1;havoc ~tmp___0~1; {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {7158#true} call #t~ret7 := is_do_write_p_triggered(); {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {7158#true} havoc ~__retres1~0; {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {7158#true} assume !(1bv32 == ~p_dw_pc~0); {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {7158#true} ~__retres1~0 := 0bv32; {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {7158#true} #res := ~__retres1~0; {7158#true} is VALID [2022-02-20 18:19:38,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {7158#true} assume true; {7158#true} is VALID [2022-02-20 18:19:38,668 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7158#true} {7158#true} #310#return; {7158#true} is VALID [2022-02-20 18:19:38,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {7158#true} ~tmp~1 := #t~ret7;havoc #t~ret7; {7158#true} is VALID [2022-02-20 18:19:38,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {7158#true} assume !(0bv32 != ~tmp~1); {7158#true} is VALID [2022-02-20 18:19:38,668 INFO L272 TraceCheckUtils]: 27: Hoare triple {7158#true} call #t~ret8 := is_do_read_c_triggered(); {7158#true} is VALID [2022-02-20 18:19:38,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {7158#true} havoc ~__retres1~1; {7158#true} is VALID [2022-02-20 18:19:38,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {7158#true} assume !(1bv32 == ~c_dr_pc~0); {7158#true} is VALID [2022-02-20 18:19:38,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {7158#true} ~__retres1~1 := 0bv32; {7253#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 18:19:38,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {7253#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {7257#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 18:19:38,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {7257#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {7257#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 18:19:38,671 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7257#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {7158#true} #312#return; {7264#(= |activate_threads_#t~ret8| (_ bv0 32))} is VALID [2022-02-20 18:19:38,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {7264#(= |activate_threads_#t~ret8| (_ bv0 32))} ~tmp___0~1 := #t~ret8;havoc #t~ret8; {7268#(= activate_threads_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 18:19:38,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {7268#(= activate_threads_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {7159#false} assume true; {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7159#false} {7158#true} #318#return; {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L272 TraceCheckUtils]: 38: Hoare triple {7159#false} call reset_delta_events(); {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {7159#false} assume !(1bv32 == ~q_read_ev~0); {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {7159#false} assume !(1bv32 == ~q_write_ev~0); {7159#false} is VALID [2022-02-20 18:19:38,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {7159#false} assume true; {7159#false} is VALID [2022-02-20 18:19:38,673 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7159#false} {7159#false} #320#return; {7159#false} is VALID [2022-02-20 18:19:38,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {7159#false} assume !false; {7159#false} is VALID [2022-02-20 18:19:38,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {7159#false} start_simulation_~kernel_st~0#1 := 1bv32;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; {7159#false} is VALID [2022-02-20 18:19:38,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {7159#false} assume !false; {7159#false} is VALID [2022-02-20 18:19:38,673 INFO L272 TraceCheckUtils]: 46: Hoare triple {7159#false} call eval_#t~ret9#1 := exists_runnable_thread(); {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {7159#false} havoc ~__retres1~2; {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {7159#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {7159#false} #res := ~__retres1~2; {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {7159#false} assume true; {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7159#false} {7159#false} #322#return; {7159#false} is VALID [2022-02-20 18:19:38,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {7159#false} eval_~tmp___1~0#1 := eval_#t~ret9#1;havoc eval_#t~ret9#1; {7159#false} is VALID [2022-02-20 18:19:38,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {7159#false} assume 0bv32 != eval_~tmp___1~0#1; {7159#false} is VALID [2022-02-20 18:19:38,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {7159#false} assume 0bv32 == ~p_dw_st~0;eval_~tmp~2#1 := eval_#t~nondet10#1;havoc eval_#t~nondet10#1; {7159#false} is VALID [2022-02-20 18:19:38,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {7159#false} assume !(0bv32 != eval_~tmp~2#1); {7159#false} is VALID [2022-02-20 18:19:38,675 INFO L272 TraceCheckUtils]: 56: Hoare triple {7159#false} call error(); {7159#false} is VALID [2022-02-20 18:19:38,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {7159#false} assume !false; {7159#false} is VALID [2022-02-20 18:19:38,676 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:38,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:19:38,676 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:19:38,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558256209] [2022-02-20 18:19:38,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558256209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:19:38,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:19:38,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:19:38,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993910705] [2022-02-20 18:19:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:19:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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 58 [2022-02-20 18:19:38,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:19:38,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:38,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:38,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:19:38,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:19:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:19:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:19:38,717 INFO L87 Difference]: Start difference. First operand 409 states and 549 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:39,135 INFO L93 Difference]: Finished difference Result 804 states and 1080 transitions. [2022-02-20 18:19:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:19:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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 58 [2022-02-20 18:19:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:19:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:19:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:19:39,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 261 transitions. [2022-02-20 18:19:39,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:19:39,350 INFO L225 Difference]: With dead ends: 804 [2022-02-20 18:19:39,351 INFO L226 Difference]: Without dead ends: 423 [2022-02-20 18:19:39,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:19:39,352 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:19:39,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 640 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:19:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-02-20 18:19:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2022-02-20 18:19:39,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:19:39,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2022-02-20 18:19:39,382 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2022-02-20 18:19:39,383 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2022-02-20 18:19:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:39,398 INFO L93 Difference]: Finished difference Result 423 states and 563 transitions. [2022-02-20 18:19:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 563 transitions. [2022-02-20 18:19:39,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:39,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:39,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) Second operand 423 states. [2022-02-20 18:19:39,402 INFO L87 Difference]: Start difference. First operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) Second operand 423 states. [2022-02-20 18:19:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:19:39,416 INFO L93 Difference]: Finished difference Result 423 states and 563 transitions. [2022-02-20 18:19:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 563 transitions. [2022-02-20 18:19:39,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:19:39,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:19:39,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:19:39,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:19:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 328 states have (on average 1.326219512195122) internal successors, (435), 341 states have internal predecessors, (435), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2022-02-20 18:19:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 557 transitions. [2022-02-20 18:19:39,434 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 557 transitions. Word has length 58 [2022-02-20 18:19:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:19:39,435 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 557 transitions. [2022-02-20 18:19:39,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 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:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 557 transitions. [2022-02-20 18:19:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:19:39,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:19:39,437 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] [2022-02-20 18:19:39,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:19:39,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:39,648 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:19:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:19:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-02-20 18:19:39,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:19:39,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272876266] [2022-02-20 18:19:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:19:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:19:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:19:39,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:19:39,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 18:19:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:19:39,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:19:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:19:39,770 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:19:39,770 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:19:39,771 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:19:39,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 18:19:39,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:19:39,998 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:19:40,001 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:19:40,041 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels(); [2022-02-20 18:19:40,042 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:19:40,045 INFO L158 Benchmark]: Toolchain (without parser) took 8782.66ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 43.1MB in the end (delta: 3.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,045 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:19:40,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.68ms. Allocated memory is still 67.1MB. Free memory was 46.0MB in the beginning and 46.3MB in the end (delta: -298.1kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.54ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 44.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,048 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 42.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,048 INFO L158 Benchmark]: RCFGBuilder took 437.01ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 47.2MB in the end (delta: -4.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,050 INFO L158 Benchmark]: TraceAbstraction took 7854.20ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.9MB in the beginning and 43.1MB in the end (delta: 3.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-02-20 18:19:40,051 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.68ms. Allocated memory is still 67.1MB. Free memory was 46.0MB in the beginning and 46.3MB in the end (delta: -298.1kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.54ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 44.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 42.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.01ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 47.2MB in the end (delta: -4.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7854.20ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.9MB in the beginning and 43.1MB in the end (delta: 3.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:19:40,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator