/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 14:09:05,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 14:09:05,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 14:09:05,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 14:09:05,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 14:09:05,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 14:09:05,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 14:09:05,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 14:09:05,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 14:09:05,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 14:09:05,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 14:09:05,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 14:09:05,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 14:09:05,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 14:09:05,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 14:09:05,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 14:09:05,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 14:09:05,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 14:09:05,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 14:09:05,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 14:09:05,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 14:09:05,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 14:09:05,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 14:09:05,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 14:09:05,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 14:09:05,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 14:09:05,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 14:09:05,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 14:09:05,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 14:09:05,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 14:09:05,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 14:09:05,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 14:09:05,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 14:09:05,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 14:09:05,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 14:09:05,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 14:09:05,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 14:09:05,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 14:09:05,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 14:09:05,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 14:09:05,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 14:09:05,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 14:09:05,753 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 14:09:05,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 14:09:05,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 14:09:05,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 14:09:05,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 14:09:05,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 14:09:05,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 14:09:05,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 14:09:05,756 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 14:09:05,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 14:09:05,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 14:09:05,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 14:09:05,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 14:09:05,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 14:09:05,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 14:09:05,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:09:05,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 14:09:05,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 14:09:05,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 14:09:05,760 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 14:09:05,761 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 14:09:05,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 14:09:05,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 14:09:05,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 14:09:05,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 14:09:05,762 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 14:09:05,762 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 14:09:06,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 14:09:06,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 14:09:06,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 14:09:06,036 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 14:09:06,037 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 14:09:06,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 14:09:06,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc74552b/e9c92a3ff518455bbf55529ea8a71ef9/FLAG4347b636c [2023-05-04 14:09:06,563 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 14:09:06,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 14:09:06,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc74552b/e9c92a3ff518455bbf55529ea8a71ef9/FLAG4347b636c [2023-05-04 14:09:06,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc74552b/e9c92a3ff518455bbf55529ea8a71ef9 [2023-05-04 14:09:06,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 14:09:06,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 14:09:06,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 14:09:06,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 14:09:06,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 14:09:06,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:09:06" (1/1) ... [2023-05-04 14:09:06,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb1a6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:06, skipping insertion in model container [2023-05-04 14:09:06,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:09:06" (1/1) ... [2023-05-04 14:09:06,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 14:09:06,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 14:09:06,818 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 14:09:07,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 14:09:07,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 14:09:07,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 14:09:07,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 14:09:07,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 14:09:07,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 14:09:07,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 14:09:07,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:09:07,187 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 14:09:07,204 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 14:09:07,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 14:09:07,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 14:09:07,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 14:09:07,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 14:09:07,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 14:09:07,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 14:09:07,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 14:09:07,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:09:07,311 INFO L208 MainTranslator]: Completed translation [2023-05-04 14:09:07,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07 WrapperNode [2023-05-04 14:09:07,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 14:09:07,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 14:09:07,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 14:09:07,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 14:09:07,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,375 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2023-05-04 14:09:07,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 14:09:07,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 14:09:07,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 14:09:07,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 14:09:07,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 14:09:07,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 14:09:07,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 14:09:07,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 14:09:07,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (1/1) ... [2023-05-04 14:09:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:09:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:09:07,478 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) [2023-05-04 14:09:07,494 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 [2023-05-04 14:09:07,529 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-05-04 14:09:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-05-04 14:09:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 14:09:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 14:09:07,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 14:09:07,532 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 14:09:07,681 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 14:09:07,682 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 14:09:08,013 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 14:09:08,022 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 14:09:08,022 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 14:09:08,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:09:08 BoogieIcfgContainer [2023-05-04 14:09:08,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 14:09:08,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 14:09:08,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 14:09:08,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 14:09:08,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 02:09:06" (1/3) ... [2023-05-04 14:09:08,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5fa97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:09:08, skipping insertion in model container [2023-05-04 14:09:08,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:09:07" (2/3) ... [2023-05-04 14:09:08,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5fa97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:09:08, skipping insertion in model container [2023-05-04 14:09:08,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:09:08" (3/3) ... [2023-05-04 14:09:08,037 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-05-04 14:09:08,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 14:09:08,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 14:09:08,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-05-04 14:09:08,072 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 14:09:08,180 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 14:09:08,221 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:09:08,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:09:08,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:09:08,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 14:09:08,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 14:09:08,258 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:09:08,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 14:09:08,280 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f7b0ab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:09:08,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 14:09:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 14:09:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-04 14:09:08,641 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-04 14:09:08,643 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/2) [2023-05-04 14:09:08,648 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:09:08,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:09:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:09:08,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 14:09:08,676 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:09:08,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoThread1of1ForFork1 ======== [2023-05-04 14:09:08,678 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f7b0ab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:09:08,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 14:09:08,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 14:09:08,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash 162274553, now seen corresponding path program 1 times [2023-05-04 14:09:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:08,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428747051] [2023-05-04 14:09:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-05-04 14:09:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:09,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428747051] [2023-05-04 14:09:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428747051] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:09:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:09:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 14:09:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301848895] [2023-05-04 14:09:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:09:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 14:09:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:09:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 14:09:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 14:09:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:09:09,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:09:09,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 14:09:09,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1569238028, now seen corresponding path program 1 times [2023-05-04 14:09:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:09,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180164686] [2023-05-04 14:09:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-05-04 14:09:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180164686] [2023-05-04 14:09:09,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180164686] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:09:09,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:09:09,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:09:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046039449] [2023-05-04 14:09:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:09:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:09:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:09:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:09:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:09:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:09:09,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:09:09,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:09,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 14:09:09,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1591009914, now seen corresponding path program 1 times [2023-05-04 14:09:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:09,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58297945] [2023-05-04 14:09:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:09,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 14:09:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:09,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58297945] [2023-05-04 14:09:09,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58297945] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:09:09,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:09:09,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:09:09,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296036064] [2023-05-04 14:09:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:09:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:09:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:09:09,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:09:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:09:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:09:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:09:09,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:09,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:09,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 14:09:10,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 984739205, now seen corresponding path program 1 times [2023-05-04 14:09:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:10,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533884736] [2023-05-04 14:09:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 14:09:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533884736] [2023-05-04 14:09:10,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533884736] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:09:10,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:09:10,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:09:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025725091] [2023-05-04 14:09:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:09:10,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:09:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:09:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:09:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:09:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:09:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:09:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 14:09:10,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -480269768, now seen corresponding path program 1 times [2023-05-04 14:09:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002098691] [2023-05-04 14:09:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 14:09:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002098691] [2023-05-04 14:09:10,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002098691] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:09:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643602573] [2023-05-04 14:09:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:09:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:09:10,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:09:10,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 14:09:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:10,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjunts are in the unsatisfiable core [2023-05-04 14:09:10,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:09:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 14:09:10,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:09:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 14:09:10,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643602573] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:09:10,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:09:10,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-05-04 14:09:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86535057] [2023-05-04 14:09:10,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:09:10,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 14:09:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:09:10,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 14:09:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-05-04 14:09:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:09:10,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:09:10,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:10,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:10,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:09:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:09:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 14:09:11,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 14:09:11,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:09:11,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 14:09:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:09:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash 896979965, now seen corresponding path program 1 times [2023-05-04 14:09:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:09:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782076187] [2023-05-04 14:09:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:09:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 14:09:18,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:09:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782076187] [2023-05-04 14:09:18,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782076187] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:09:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633023554] [2023-05-04 14:09:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:09:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:09:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:09:18,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:09:18,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 14:09:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:09:18,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 131 conjunts are in the unsatisfiable core [2023-05-04 14:09:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:09:18,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 14:09:18,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 14:09:18,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-05-04 14:09:18,706 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-04 14:09:18,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 14:09:18,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 14:09:18,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:09:18,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-05-04 14:09:18,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-05-04 14:09:19,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-05-04 14:09:21,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:09:21,132 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-05-04 14:09:21,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2023-05-04 14:09:21,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:09:21,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2023-05-04 14:09:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 14:09:22,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:11:01,084 WARN L233 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:11:45,758 WARN L233 SmtUtils]: Spent 12.69s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:12:23,054 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:13:05,365 WARN L233 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:13:46,853 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:14:32,831 WARN L233 SmtUtils]: Spent 10.63s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:15:19,712 WARN L233 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:16:00,915 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:16:43,872 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:17:26,069 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:18:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 14:18:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633023554] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:18:37,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:18:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 32] total 102 [2023-05-04 14:18:37,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61212806] [2023-05-04 14:18:37,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:18:37,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2023-05-04 14:18:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:18:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2023-05-04 14:18:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=9621, Unknown=55, NotChecked=0, Total=10302 [2023-05-04 14:18:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:18:37,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:18:37,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 4.323529411764706) internal successors, (441), 102 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 14:18:37,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:20:12,725 WARN L233 SmtUtils]: Spent 15.61s on a formula simplification. DAG size of input: 211 DAG size of output: 188 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:20:25,793 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| 20)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|))) (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~arg#1.base|) (= |c_writer_fnThread1of1ForFork0_~arg#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_#in~r#1.offset|) (= 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~arg#1.offset|)) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork1_~arg#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_#in~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_~r#1.offset|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 1) (= |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|)) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|) (= (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork1_~arg#1.offset|) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (let ((.cse14 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20))) (let ((.cse70 (select .cse2 .cse14))) (let ((.cse71 (+ .cse70 1))) (let ((.cse5 (mod .cse71 4))) (let ((.cse4 (< .cse71 0)) (.cse3 (= .cse5 0)) (.cse6 (select .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|))) (or (and (or .cse3 (not .cse4)) (= .cse5 .cse6)) (and .cse4 (not .cse3) (= (+ .cse6 4) .cse5)) (let ((.cse15 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* .cse70 4) 4))) (and (forall ((v_ArrVal_226 Int)) (let ((.cse13 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse11 (+ (select .cse13 .cse14) 1))) (let ((.cse7 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse13 .cse14 (mod .cse11 4))))) (let ((.cse10 (+ (select (select .cse7 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse9 (* (div .cse10 4) 4))) (or (not (= (+ (select (select (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) .cse9) .cse10)) (not (= .cse9 .cse10)) (< .cse11 0)))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse23 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse22 (+ (select .cse23 .cse14) 1))) (let ((.cse20 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse23 .cse14 (mod .cse22 4))))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse19 (select .cse18 .cse12))) (let ((.cse16 (+ .cse19 1))) (let ((.cse17 (mod .cse16 4))) (or (<= 0 .cse16) (not (= .cse17 (+ (select .cse18 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4))) (not (= .cse19 (+ (select (select (store .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse21 (select .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse21 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse21 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 3 (* (div .cse16 4) 4)))) (= .cse17 0) (< .cse22 0)))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse32 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse29 (+ (select .cse32 .cse14) 1))) (let ((.cse28 (mod .cse29 4))) (let ((.cse26 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse32 .cse14 (+ .cse28 (- 4)))))) (let ((.cse30 (select .cse26 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse25 (select .cse30 .cse12))) (let ((.cse24 (+ .cse25 1))) (let ((.cse31 (mod .cse24 4))) (or (<= 0 .cse24) (not (= .cse25 (+ 3 (* (div .cse24 4) 4) (select (select (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse27 (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ 1 (select .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (= .cse28 0) (not (< .cse29 0)) (not (= (+ (select .cse30 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4) .cse31)) (= .cse31 0))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse37 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse36 (mod (+ (select .cse37 .cse14) 1) 4))) (let ((.cse33 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse37 .cse14 .cse36)))) (let ((.cse35 (+ (select (select .cse33 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (= (+ (select (select (store .cse33 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse34 (select .cse33 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) (* (div .cse35 4) 4)) .cse35)) (not (<= 0 .cse35)) (not (= .cse36 0)))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse45 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse44 (mod (+ (select .cse45 .cse14) 1) 4))) (let ((.cse42 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse45 .cse14 .cse44)))) (let ((.cse40 (select .cse42 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse41 (select .cse40 .cse12))) (let ((.cse38 (+ .cse41 1))) (let ((.cse39 (mod .cse38 4))) (or (<= 0 .cse38) (not (= .cse39 (+ (select .cse40 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4))) (not (= .cse41 (+ (select (select (store .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 3 (* (div .cse38 4) 4)))) (= .cse39 0) (not (= .cse44 0))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse51 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse50 (mod (+ (select .cse51 .cse14) 1) 4))) (let ((.cse46 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse51 .cse14 .cse50)))) (let ((.cse49 (+ (select (select .cse46 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse48 (* (div .cse49 4) 4))) (or (not (= (+ (select (select (store .cse46 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse47 (select .cse46 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse47 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse47 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) .cse48) .cse49)) (not (= .cse48 .cse49)) (not (= .cse50 0))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse57 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse54 (+ (select .cse57 .cse14) 1))) (let ((.cse53 (mod .cse54 4))) (let ((.cse55 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse57 .cse14 (+ .cse53 (- 4)))))) (let ((.cse52 (+ (select (select .cse55 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (<= 0 .cse52)) (= .cse53 0) (not (< .cse54 0)) (not (= (+ (* (div .cse52 4) 4) (select (select (store .cse55 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse56 (select .cse55 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse56 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ 1 (select .cse56 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)) .cse52))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse64 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse61 (+ (select .cse64 .cse14) 1))) (let ((.cse58 (mod .cse61 4))) (let ((.cse62 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse64 .cse14 (+ .cse58 (- 4)))))) (let ((.cse60 (+ (select (select .cse62 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse59 (* (div .cse60 4) 4))) (or (= .cse58 0) (not (= .cse59 .cse60)) (not (< .cse61 0)) (not (= (+ .cse59 (select (select (store .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse63 (select .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse63 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ 1 (select .cse63 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)) .cse60)))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse69 (store .cse2 .cse15 v_ArrVal_226))) (let ((.cse68 (+ (select .cse69 .cse14) 1))) (let ((.cse65 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse69 .cse14 (mod .cse68 4))))) (let ((.cse67 (+ (select (select .cse65 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (= (+ (select (select (store .cse65 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse66 (select .cse65 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse66 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse66 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) (* (div .cse67 4) 4)) .cse67)) (not (<= 0 .cse67)) (< .cse68 0))))))))))))))) (= (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (let ((.cse84 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|)) (.cse83 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|))) (let ((.cse139 (select .cse84 .cse83))) (let ((.cse140 (+ .cse139 1))) (let ((.cse74 (mod .cse140 4))) (let ((.cse73 (= .cse74 0)) (.cse72 (< .cse140 0)) (.cse75 (select .cse84 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|))) (or (and (or (not .cse72) .cse73) (= .cse74 .cse75)) (and (not .cse73) .cse72 (= (+ 4 .cse75) .cse74)) (let ((.cse85 (+ (* .cse139 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 4))) (and (forall ((v_ArrVal_226 Int)) (let ((.cse82 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse78 (+ (select .cse82 .cse83) 1))) (let ((.cse79 (mod .cse78 4))) (let ((.cse80 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse82 .cse83 (+ (- 4) .cse79))))) (let ((.cse76 (+ (select (select .cse80 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse77 (* (div .cse76 4) 4))) (or (not (= .cse76 .cse77)) (not (< .cse78 0)) (= .cse79 0) (not (= .cse76 (+ (select (select (store .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse81 (select .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) .cse77))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse91 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse90 (mod (+ (select .cse91 .cse83) 1) 4))) (let ((.cse88 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse91 .cse83 .cse90)))) (let ((.cse86 (+ (select (select .cse88 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse87 (* (div .cse86 4) 4))) (or (not (= .cse86 (+ .cse87 (select (select (store .cse88 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse89 (select .cse88 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse89 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse89 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (not (= .cse90 0)) (not (= .cse87 .cse86))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse99 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse93 (mod (+ (select .cse99 .cse83) 1) 4))) (let ((.cse97 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse99 .cse83 .cse93)))) (let ((.cse94 (select .cse97 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse96 (select .cse94 .cse12))) (let ((.cse92 (+ .cse96 1))) (let ((.cse95 (mod .cse92 4))) (or (<= 0 .cse92) (not (= .cse93 0)) (not (= (+ (select .cse94 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4) .cse95)) (= .cse95 0) (not (= .cse96 (+ (* (div .cse92 4) 4) 3 (select (select (store .cse97 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse98 (select .cse97 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse98 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse98 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|))))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse104 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse103 (+ (select .cse104 .cse83) 1))) (let ((.cse101 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse104 .cse83 (mod .cse103 4))))) (let ((.cse100 (+ (select (select .cse101 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (= .cse100 (+ (* (div .cse100 4) 4) (select (select (store .cse101 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse102 (select .cse101 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse102 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse102 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (not (<= 0 .cse100)) (< .cse103 0))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse113 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse108 (+ (select .cse113 .cse83) 1))) (let ((.cse109 (mod .cse108 4))) (let ((.cse111 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse113 .cse83 (+ (- 4) .cse109))))) (let ((.cse106 (select .cse111 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse110 (select .cse106 .cse12))) (let ((.cse105 (+ .cse110 1))) (let ((.cse107 (mod .cse105 4))) (or (<= 0 .cse105) (not (= (+ (select .cse106 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4) .cse107)) (not (< .cse108 0)) (= .cse109 0) (= 0 .cse107) (not (= .cse110 (+ (select (select (store .cse111 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse112 (select .cse111 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse112 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse112 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 3 (* (div .cse105 4) 4)))))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse121 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse120 (+ (select .cse121 .cse83) 1))) (let ((.cse118 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse121 .cse83 (mod .cse120 4))))) (let ((.cse115 (select .cse118 |c_ULTIMATE.start_writer_fn_~arg#1.base|))) (let ((.cse117 (select .cse115 .cse12))) (let ((.cse114 (+ .cse117 1))) (let ((.cse116 (mod .cse114 4))) (or (<= 0 .cse114) (not (= (+ (select .cse115 |c_ULTIMATE.start_writer_fn_~arg#1.offset|) 4) .cse116)) (= .cse116 0) (not (= .cse117 (+ (* (div .cse114 4) 4) 3 (select (select (store .cse118 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse119 (select .cse118 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse119 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse119 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (< .cse120 0)))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse127 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse122 (+ (select .cse127 .cse83) 1))) (let ((.cse123 (mod .cse122 4))) (let ((.cse125 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse127 .cse83 (+ (- 4) .cse123))))) (let ((.cse124 (+ (select (select .cse125 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (< .cse122 0)) (= .cse123 0) (not (<= 0 .cse124)) (not (= .cse124 (+ (select (select (store .cse125 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse126 (select .cse125 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse126 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse126 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|) (* (div .cse124 4) 4))))))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse133 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse132 (+ (select .cse133 .cse83) 1))) (let ((.cse130 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse133 .cse83 (mod .cse132 4))))) (let ((.cse128 (+ (select (select .cse130 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (let ((.cse129 (* (div .cse128 4) 4))) (or (not (= .cse128 (+ .cse129 (select (select (store .cse130 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse131 (select .cse130 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse131 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse131 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (not (= .cse129 .cse128)) (< .cse132 0)))))))) (forall ((v_ArrVal_226 Int)) (let ((.cse138 (store .cse84 .cse85 v_ArrVal_226))) (let ((.cse137 (mod (+ (select .cse138 .cse83) 1) 4))) (let ((.cse135 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| (store .cse138 .cse83 .cse137)))) (let ((.cse134 (+ (select (select .cse135 |c_ULTIMATE.start_writer_fn_~arg#1.base|) .cse12) 1))) (or (not (= .cse134 (+ (* (div .cse134 4) 4) (select (select (store .cse135 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse136 (select .cse135 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse136 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse136 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_ULTIMATE.start_writer_fn_~arg#1.base|) |c_ULTIMATE.start_writer_fn_~arg#1.offset|)))) (not (= .cse137 0)) (not (<= 0 .cse134)))))))))))))))) (= (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_~arg#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|)) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~arg#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|))) is different from true [2023-05-04 14:21:22,101 WARN L233 SmtUtils]: Spent 21.01s on a formula simplification. DAG size of input: 276 DAG size of output: 256 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:22:23,335 WARN L233 SmtUtils]: Spent 30.00s on a formula simplification. DAG size of input: 297 DAG size of output: 277 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 14:23:30,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:23:30,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:23:30,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:23:30,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:23:30,897 WARN L249 SmtUtils]: Removed 6 from assertion stack [2023-05-04 14:23:30,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 14:23:31,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:23:31,098 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 318 for 34114ms.. [2023-05-04 14:23:31,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 14:23:31,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-05-04 14:23:31,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-05-04 14:23:31,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-05-04 14:23:31,100 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-05-04 14:23:31,101 INFO L307 ceAbstractionStarter]: Result for error location reader_twoThread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-05-04 14:23:31,102 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 14:23:31,102 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 14:23:31,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 02:23:31 BasicIcfg [2023-05-04 14:23:31,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 14:23:31,105 INFO L158 Benchmark]: Toolchain (without parser) took 864509.93ms. Allocated memory was 176.2MB in the beginning and 507.5MB in the end (delta: 331.4MB). Free memory was 118.3MB in the beginning and 296.4MB in the end (delta: -178.1MB). Peak memory consumption was 154.1MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,106 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 14:23:31,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.77ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 125.1MB in the end (delta: -6.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.58ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 121.9MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,107 INFO L158 Benchmark]: Boogie Preprocessor took 59.81ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 119.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,107 INFO L158 Benchmark]: RCFGBuilder took 590.22ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 98.1MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,107 INFO L158 Benchmark]: TraceAbstraction took 863075.96ms. Allocated memory was 176.2MB in the beginning and 507.5MB in the end (delta: 331.4MB). Free memory was 96.9MB in the beginning and 296.4MB in the end (delta: -199.5MB). Peak memory consumption was 132.5MB. Max. memory is 8.0GB. [2023-05-04 14:23:31,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 715.77ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 125.1MB in the end (delta: -6.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.58ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 121.9MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.81ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 119.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 590.22ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 98.1MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 863075.96ms. Allocated memory was 176.2MB in the beginning and 507.5MB in the end (delta: 331.4MB). Free memory was 96.9MB in the beginning and 296.4MB in the end (delta: -199.5MB). Peak memory consumption was 132.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8547, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 126, dependent conditional: 58, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 86, dependent conditional: 18, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 86, dependent conditional: 18, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7976, independent: 7908, independent conditional: 0, independent unconditional: 7908, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7976, independent: 7907, independent conditional: 0, independent unconditional: 7907, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8507, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7976, unknown conditional: 0, unknown unconditional: 7976] , Statistics on independence cache: Total cache size (in pairs): 7976, Positive cache size: 7908, Positive conditional cache size: 0, Positive unconditional cache size: 7908, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 40 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 182, Number of trivial persistent sets: 154, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8381, independent: 8313, independent conditional: 0, independent unconditional: 8313, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8547, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 126, dependent conditional: 58, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 86, dependent conditional: 18, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 108, independent unconditional: 8313, dependent: 86, dependent conditional: 18, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8507, independent: 8421, independent conditional: 0, independent unconditional: 8421, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7976, independent: 7908, independent conditional: 0, independent unconditional: 7908, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7976, independent: 7907, independent conditional: 0, independent unconditional: 7907, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8507, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7976, unknown conditional: 0, unknown unconditional: 7976] , Statistics on independence cache: Total cache size (in pairs): 7976, Positive cache size: 7908, Positive conditional cache size: 0, Positive unconditional cache size: 7908, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 40 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 22442, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 910, dependent conditional: 836, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21628, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 96, dependent conditional: 22, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21628, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 96, dependent conditional: 22, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 38, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 4, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 4, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12540, independent: 12464, independent conditional: 0, independent unconditional: 12464, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12540, independent: 12460, independent conditional: 0, independent unconditional: 12460, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 80, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 188, dependent conditional: 11, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21666, independent: 9068, independent conditional: 0, independent unconditional: 9068, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 12540, unknown conditional: 2, unknown unconditional: 12538] , Statistics on independence cache: Total cache size (in pairs): 12540, Positive cache size: 12464, Positive conditional cache size: 0, Positive unconditional cache size: 12464, Negative cache size: 76, Negative conditional cache size: 2, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 5, Independence queries for same thread: 814 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 518, Number of trivial persistent sets: 349, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19365, independent: 19291, independent conditional: 0, independent unconditional: 19291, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 22442, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 910, dependent conditional: 836, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21628, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 96, dependent conditional: 22, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21628, independent: 21532, independent conditional: 2241, independent unconditional: 19291, dependent: 96, dependent conditional: 22, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 38, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 4, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21666, independent: 21532, independent conditional: 0, independent unconditional: 21532, dependent: 134, dependent conditional: 4, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12540, independent: 12464, independent conditional: 0, independent unconditional: 12464, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12540, independent: 12460, independent conditional: 0, independent unconditional: 12460, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 80, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 76, dependent conditional: 2, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 188, dependent conditional: 11, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21666, independent: 9068, independent conditional: 0, independent unconditional: 9068, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 12540, unknown conditional: 2, unknown unconditional: 12538] , Statistics on independence cache: Total cache size (in pairs): 12540, Positive cache size: 12464, Positive conditional cache size: 0, Positive unconditional cache size: 12464, Negative cache size: 76, Negative conditional cache size: 2, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 5, Independence queries for same thread: 814 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 318 for 34114ms.. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 318 for 34114ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 318 for 34114ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 318 for 34114ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_twoThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 862.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 294.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 566.7s InterpolantComputationTime, 1346 NumberOfCodeBlocks, 1346 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1698 ConstructedInterpolants, 59 QuantifiedInterpolants, 251405 SizeOfPredicates, 45 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 369/475 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown