/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 08:47:36,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 08:47:36,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 08:47:36,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 08:47:36,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 08:47:36,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 08:47:36,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 08:47:36,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 08:47:36,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 08:47:36,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 08:47:36,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 08:47:36,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 08:47:36,240 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 08:47:36,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 08:47:36,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 08:47:36,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 08:47:36,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 08:47:36,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 08:47:36,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 08:47:36,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 08:47:36,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 08:47:36,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 08:47:36,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 08:47:36,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 08:47:36,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 08:47:36,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 08:47:36,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 08:47:36,247 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 08:47:36,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 08:47:36,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 08:47:36,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 08:47:36,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 08:47:36,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 08:47:36,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 08:47:36,249 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 08:47:36,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 08:47:36,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 08:47:36,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 08:47:36,249 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 08:47:36,249 INFO L153 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/UGemCutter-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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 08:47:36,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 08:47:36,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 08:47:36,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 08:47:36,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 08:47:36,465 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 08:47:36,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-07 08:47:37,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 08:47:37,886 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 08:47:37,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-07 08:47:37,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9641a157a/88ffba47a6294839962bb93d24bb621b/FLAGe07137422 [2024-05-07 08:47:37,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9641a157a/88ffba47a6294839962bb93d24bb621b [2024-05-07 08:47:37,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 08:47:37,933 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 08:47:37,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 08:47:37,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 08:47:37,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 08:47:37,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:47:37" (1/1) ... [2024-05-07 08:47:37,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbecec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:37, skipping insertion in model container [2024-05-07 08:47:37,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:47:37" (1/1) ... [2024-05-07 08:47:38,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 08:47:38,329 WARN L240 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] [2024-05-07 08:47:38,333 WARN L240 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] [2024-05-07 08:47:38,334 WARN L240 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] [2024-05-07 08:47:38,372 WARN L240 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] [2024-05-07 08:47:38,374 WARN L240 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] [2024-05-07 08:47:38,378 WARN L240 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] [2024-05-07 08:47:38,381 WARN L240 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] [2024-05-07 08:47:38,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 08:47:38,397 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 08:47:38,434 WARN L240 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] [2024-05-07 08:47:38,434 WARN L240 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] [2024-05-07 08:47:38,435 WARN L240 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] [2024-05-07 08:47:38,443 WARN L240 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] [2024-05-07 08:47:38,443 WARN L240 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] [2024-05-07 08:47:38,444 WARN L240 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] [2024-05-07 08:47:38,445 WARN L240 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] [2024-05-07 08:47:38,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 08:47:38,502 INFO L206 MainTranslator]: Completed translation [2024-05-07 08:47:38,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38 WrapperNode [2024-05-07 08:47:38,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 08:47:38,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 08:47:38,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 08:47:38,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 08:47:38,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,568 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 211 [2024-05-07 08:47:38,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 08:47:38,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 08:47:38,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 08:47:38,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 08:47:38,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 08:47:38,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 08:47:38,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 08:47:38,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 08:47:38,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (1/1) ... [2024-05-07 08:47:38,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 08:47:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:47:38,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 08:47:38,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2024-05-07 08:47:38,707 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2024-05-07 08:47:38,707 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 08:47:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 08:47:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 08:47:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 08:47:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 08:47:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 08:47:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 08:47:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 08:47:38,709 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 08:47:38,912 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 08:47:38,916 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 08:47:39,145 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 08:47:39,161 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 08:47:39,161 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-07 08:47:39,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:47:39 BoogieIcfgContainer [2024-05-07 08:47:39,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 08:47:39,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 08:47:39,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 08:47:39,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 08:47:39,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 08:47:37" (1/3) ... [2024-05-07 08:47:39,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b990b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:47:39, skipping insertion in model container [2024-05-07 08:47:39,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:47:38" (2/3) ... [2024-05-07 08:47:39,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b990b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:47:39, skipping insertion in model container [2024-05-07 08:47:39,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:47:39" (3/3) ... [2024-05-07 08:47:39,168 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2024-05-07 08:47:39,174 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 08:47:39,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 08:47:39,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-07 08:47:39,181 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 08:47:39,250 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 08:47:39,286 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 08:47:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 08:47:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:47:39,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 08:47:39,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 08:47:39,341 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 08:47:39,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:47:39,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 08:47:39,375 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=LoopHeads, 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;@24c2c771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 08:47:39,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-07 08:47:39,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-05-07 08:47:39,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-05-07 08:47:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1450183971, now seen corresponding path program 1 times [2024-05-07 08:47:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:47:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:47:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 08:47:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 08:47:41,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-07 08:47:41,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 08:47:41,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash -479581409, now seen corresponding path program 1 times [2024-05-07 08:47:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:47:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:47:43,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:47:43,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:47:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 538585321, now seen corresponding path program 1 times [2024-05-07 08:47:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:47:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300997607] [2024-05-07 08:47:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:47:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:47:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300997607] [2024-05-07 08:47:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300997607] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:47:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:47:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-07 08:47:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385781765] [2024-05-07 08:47:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:47:44,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-07 08:47:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:47:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-07 08:47:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-05-07 08:47:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:47:44,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:47:44,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 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) [2024-05-07 08:47:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:47:46,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:47:46,413 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:46,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:46,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:46,545 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:46,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1970970037, now seen corresponding path program 1 times [2024-05-07 08:47:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 08:47:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 08:47:49,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:50,139 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:50,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:50,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:50,287 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:50,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -888138981, now seen corresponding path program 2 times [2024-05-07 08:47:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 08:47:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 08:47:50,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:50,950 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:50,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:50,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:51,100 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:51,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1955215739, now seen corresponding path program 3 times [2024-05-07 08:47:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 08:47:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 08:47:51,787 INFO L349 Elim1Store]: treesize reduction 48, result has 70.6 percent of original size [2024-05-07 08:47:51,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 81 treesize of output 159 [2024-05-07 08:47:52,365 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:52,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:52,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:52,784 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:52,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:52,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -434436118, now seen corresponding path program 1 times [2024-05-07 08:47:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 08:47:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 08:47:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 08:47:53,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 08:47:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:47:53,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:54,016 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:54,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:54,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:54,157 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:54,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1691096009, now seen corresponding path program 1 times [2024-05-07 08:47:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-05-07 08:47:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-05-07 08:47:57,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:57,487 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:57,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:57,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:57,724 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:57,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:47:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -343782828, now seen corresponding path program 2 times [2024-05-07 08:47:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:47:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:47:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:47:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:47:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:47:58,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:47:58,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 29 [2024-05-07 08:47:58,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:47:58,839 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:47:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:48:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 794732711, now seen corresponding path program 1 times [2024-05-07 08:48:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-07 08:48:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-07 08:48:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-07 08:48:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 08:48:01,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:02,187 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:48:02,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:48:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1414741495, now seen corresponding path program 2 times [2024-05-07 08:48:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 08:48:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 08:48:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:04,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1555649310, now seen corresponding path program 1 times [2024-05-07 08:48:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:04,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:05,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1321158188, now seen corresponding path program 2 times [2024-05-07 08:48:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:06,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1014405294, now seen corresponding path program 1 times [2024-05-07 08:48:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:08,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:08,702 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:48:08,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:48:08,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1954301447, now seen corresponding path program 3 times [2024-05-07 08:48:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:08,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:08,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:09,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2024-05-07 08:48:09,691 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 08:48:09,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 08:48:09,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 08:48:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 347885040, now seen corresponding path program 4 times [2024-05-07 08:48:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 08:48:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:48:10,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 08:48:10,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:48:10,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:48:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 388017180, now seen corresponding path program 1 times [2024-05-07 08:48:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:48:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671890128] [2024-05-07 08:48:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:48:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:48:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:48:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671890128] [2024-05-07 08:48:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671890128] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 08:48:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6411992] [2024-05-07 08:48:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:48:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 08:48:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:48:13,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 08:48:13,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 08:48:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:48:13,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-07 08:48:13,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 08:48:13,373 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:48:13,385 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 08:48:13,386 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:48:13,404 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-07 08:48:13,405 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:48:13,434 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-05-07 08:48:13,446 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 18 [2024-05-07 08:48:13,483 INFO L378 Elim1Store]: Elim1 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 16 [2024-05-07 08:48:13,681 INFO L378 Elim1Store]: Elim1 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 16 [2024-05-07 08:48:14,175 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-05-07 08:48:14,176 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 35 [2024-05-07 08:48:14,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 89 treesize of output 71 [2024-05-07 08:48:14,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 97 [2024-05-07 08:48:14,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-05-07 08:48:15,044 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-05-07 08:48:15,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 55 [2024-05-07 08:48:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:48:15,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 08:48:15,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse1 .cse2 .cse3) v_ArrVal_1471)) (< 4 .cse3) (= .cse3 4) (< .cse3 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse5) (< (+ .cse5 3) 0) (not (= (store .cse1 .cse2 .cse5) v_ArrVal_1471))))) (<= 1 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse1 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))))) is different from false [2024-05-07 08:48:18,919 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20))) (let ((.cse2 (let ((.cse7 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse7 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse7 .cse3) 4) 4) 1)))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1471 .cse3))) (or (< 0 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 4 .cse1) (not (= (store .cse2 .cse3 .cse1) v_ArrVal_1471)) (< .cse1 1) (= .cse1 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1471 .cse3))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (not (= (store .cse2 .cse3 .cse5) v_ArrVal_1471)) (< 0 .cse5) (< (+ 3 .cse5) 0)))) (<= 1 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse2 .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) is different from false [2024-05-07 08:48:20,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1469 (Array Int Int))) (<= 1 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse3) 4)) 1)) .cse3 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469)) (.cse4 (select v_ArrVal_1471 .cse3))) (or (= .cse4 4) (not (= (store (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse5 .cse3) 4)) 1)) .cse3 .cse4) v_ArrVal_1471)) (< 0 (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse7 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4)))) (< 4 .cse4) (< .cse4 1)))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1471 .cse3)) (.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469))) (or (< 0 .cse8) (< (+ 3 .cse8) 0) (not (= (store (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse9 .cse3) 4)) 1)) .cse3 .cse8) v_ArrVal_1471)) (< 0 (let ((.cse11 (select (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4))))))))) is different from false [2024-05-07 08:48:20,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469)) (.cse0 (select v_ArrVal_1471 .cse4))) (or (< 0 .cse0) (< 0 (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse1 (+ (* (select .cse1 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (< (+ 3 .cse0) 0) (not (= (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse3 .cse4) 4)) 1)) .cse4 .cse0) v_ArrVal_1471))))) (forall ((v_ArrVal_1469 (Array Int Int))) (<= 1 (let ((.cse5 (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469))) (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse7 .cse4) 4)) 1)) .cse4 0))) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse5 (+ (* (select .cse5 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469)) (.cse10 (select v_ArrVal_1471 .cse4))) (or (< 0 (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse8 (+ (* (select .cse8 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (= .cse10 4) (not (= (store (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse11 .cse4) 4)) 1)) .cse4 .cse10) v_ArrVal_1471)) (< 4 .cse10) (< .cse10 1)))))) is different from false [2024-05-07 08:48:21,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469)) (.cse0 (select v_ArrVal_1471 .cse2))) (or (= .cse0 4) (not (= (store (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse1 .cse2) 4)) 1)) .cse2 .cse0) v_ArrVal_1471)) (< 0 (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* (select .cse4 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4))))) (< 4 .cse0) (< .cse0 1)))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1471 .cse2)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469))) (or (< 0 .cse5) (< (+ 3 .cse5) 0) (not (= (store (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse6 .cse2) 4)) 1)) .cse2 .cse5) v_ArrVal_1471)) (< 0 (let ((.cse8 (select (store .cse7 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse8 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* (select .cse8 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4)))))))) (forall ((v_ArrVal_1469 (Array Int Int))) (<= 1 (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469))) (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse11 .cse2) 4)) 1)) .cse2 0))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4))))))) is different from false [2024-05-07 08:48:21,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1469 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (< 0 (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse1) 4)) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)) 4)))) (= v_DerPreprocessor_2 4) (< 4 v_DerPreprocessor_2) (< v_DerPreprocessor_2 1))) (forall ((v_ArrVal_1469 (Array Int Int))) (<= 1 (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse4 .cse1) 4)) 1)))) (select (store .cse3 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|)) 4))))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< (+ 3 v_DerPreprocessor_3) 0) (< 0 v_DerPreprocessor_3) (< 0 (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse6 .cse1) 4)) 1)))) (select (store .cse5 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|)) 4)))))))) is different from false [2024-05-07 08:48:22,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< (+ 3 v_DerPreprocessor_3) 0) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse1)) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))))) (< 0 v_DerPreprocessor_3))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (< 0 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse4 .cse1)) 4) 1)))) (select (store .cse3 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))))) (= v_DerPreprocessor_2 4) (< 4 v_DerPreprocessor_2) (< v_DerPreprocessor_2 1))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int))) (<= 1 (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse6 .cse1)) 4) 1)))) (select (store .cse5 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))) is different from false [2024-05-07 08:48:22,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)))) (and (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 4) (< 4 v_DerPreprocessor_2) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse1)) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_DerPreprocessor_2 1))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int))) (<= 1 (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse5 .cse1)) 4) 1)))) (select (store .cse4 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< (+ 3 v_DerPreprocessor_3) 0) (< 0 v_DerPreprocessor_3) (< 0 (let ((.cse6 (let ((.cse7 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse7 .cse1)) 4) 1)))) (select (store .cse6 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))))))) is different from false [2024-05-07 08:48:22,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 92 [2024-05-07 08:48:22,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 432 treesize of output 420 [2024-05-07 08:48:22,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 206 [2024-05-07 08:48:22,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1038 treesize of output 632 [2024-05-07 08:48:22,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2024-05-07 08:48:22,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 08:48:22,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 222 treesize of output 246 [2024-05-07 08:48:24,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 08:48:24,467 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 08:48:24,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-07 08:48:24,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 08:48:24,473 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 08:48:24,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-07 08:48:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-05-07 08:48:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6411992] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 08:48:24,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 08:48:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 32] total 79 [2024-05-07 08:48:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016329161] [2024-05-07 08:48:24,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 08:48:24,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-05-07 08:48:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:48:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-05-07 08:48:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4721, Unknown=35, NotChecked=1160, Total=6162 [2024-05-07 08:48:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:48:24,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:48:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.759493670886076) internal successors, (297), 79 states have internal predecessors, (297), 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) [2024-05-07 08:48:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:48:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:48:33,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (let ((.cse38 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20)) (.cse5 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 20)) (.cse8 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 20)) (.cse23 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| 20)) (.cse16 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse55 (+ (* (select .cse13 .cse2) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4))) (let ((.cse1 (store .cse13 .cse55 |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|)) (.cse15 (let ((.cse58 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse58 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse58 .cse16) 4) 4) 1))) (.cse22 (let ((.cse57 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base|))) (store .cse57 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| (* (select .cse57 .cse23) 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|))) (.cse7 (let ((.cse56 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base|))) (store .cse56 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 4 (* (select .cse56 .cse8) 4)) 1))) (.cse27 (store .cse13 .cse55 |c_writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) (.cse4 (let ((.cse54 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|))) (store .cse54 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| (* (select .cse54 .cse5) 4) 4) 1))) (.cse37 (let ((.cse53 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse53 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse53 .cse38) 4) 4) (+ |c_writer_fnThread1of1ForFork1_~i~1#1| 1))))) (and (= |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse1 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1471 .cse5))) (or (< 4 .cse3) (not (= v_ArrVal_1471 (store .cse4 .cse5 .cse3))) (= 4 .cse3) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse3 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1471 .cse8))) (or (not (= v_ArrVal_1471 (store .cse7 .cse8 .cse9))) (< (+ 3 .cse9) 0) (< 0 .cse9) (< 0 (let ((.cse10 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1471 .cse8))) (or (not (= v_ArrVal_1471 (store .cse7 .cse8 .cse11))) (< .cse11 1) (< 4 .cse11) (= .cse11 4) (< 0 (let ((.cse12 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ (* (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= (select .cse13 0) 0) (<= 1 (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse15 .cse16 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse14 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (let ((.cse20 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse17 (= (select .cse20 0) 0)) (.cse18 (select .cse20 20)) (.cse19 (= (select .cse20 4) 1))) (or (and .cse17 (= 0 .cse18) .cse19) (and .cse17 (<= 1 .cse18) (<= .cse18 3) .cse19) (and .cse17 (<= (+ 1 .cse18) 0) (<= 0 (+ 3 .cse18)) .cse19)))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (<= 1 (let ((.cse21 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| (store .cse22 .cse23 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse21 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse25 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse24 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ (* (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse1 .cse2 .cse25) v_ArrVal_1471)) (< 4 .cse25) (= .cse25 4) (< .cse25 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse28 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse26 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse26 (+ (* (select .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse27 .cse2 .cse28) v_ArrVal_1471)) (< 4 .cse28) (= .cse28 4) (< .cse28 1)))) (= |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| 0) (= (select .cse13 4) 1) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse30 (select v_ArrVal_1471 .cse16))) (or (< 0 (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse29 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (= .cse30 4) (< 4 .cse30) (not (= v_ArrVal_1471 (store .cse15 .cse16 .cse30))) (< .cse30 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse31 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse31 (+ (* (select .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse32) (not (= (store .cse1 .cse2 .cse32) v_ArrVal_1471)) (< (+ .cse32 3) 0)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse33 (select v_ArrVal_1471 .cse23))) (or (< 4 .cse33) (< .cse33 1) (= 4 .cse33) (not (= v_ArrVal_1471 (store .cse22 .cse23 .cse33))) (< 0 (let ((.cse34 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse34 (+ (* 4 (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1471 .cse38))) (or (< 0 (let ((.cse35 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse35 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 4 .cse36) (< .cse36 1) (not (= (store .cse37 .cse38 .cse36) v_ArrVal_1471)) (= .cse36 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse40 (select v_ArrVal_1471 .cse38))) (or (< 0 (let ((.cse39 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse39 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse39 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse40) (< (+ 3 .cse40) 0) (not (= (store .cse37 .cse38 .cse40) v_ArrVal_1471))))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse41 (select v_ArrVal_1471 .cse16))) (or (< 0 .cse41) (< 0 (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse42 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< (+ 3 .cse41) 0) (not (= v_ArrVal_1471 (store .cse15 .cse16 .cse41)))))) (<= 1 (let ((.cse43 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse27 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse43 (+ (* (select .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1471 .cse23))) (or (< (+ 3 .cse44) 0) (< 0 .cse44) (not (= v_ArrVal_1471 (store .cse22 .cse23 .cse44))) (< 0 (let ((.cse45 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse45 (+ (* 4 (select .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (<= 1 (let ((.cse46 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| (store .cse4 .cse5 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse46 (+ (* (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (<= 1 (let ((.cse47 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| (store .cse7 .cse8 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse47 (+ (* (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse49 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse48 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse48 (+ (* (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse49) (< (+ .cse49 3) 0) (not (= (store .cse27 .cse2 .cse49) v_ArrVal_1471))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse50 (select v_ArrVal_1471 .cse5))) (or (< (+ 3 .cse50) 0) (< 0 .cse50) (not (= v_ArrVal_1471 (store .cse4 .cse5 .cse50))) (< 0 (let ((.cse51 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse51 (+ (* (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (<= 1 (let ((.cse52 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse37 .cse38 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse52 (+ (* (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))) is different from false [2024-05-07 08:48:52,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (let ((.cse38 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20)) (.cse5 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 20)) (.cse8 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 20)) (.cse23 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| 20)) (.cse16 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse55 (+ (* (select .cse13 .cse2) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4))) (let ((.cse1 (store .cse13 .cse55 |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|)) (.cse15 (let ((.cse58 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse58 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse58 .cse16) 4) 4) 1))) (.cse22 (let ((.cse57 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base|))) (store .cse57 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| (* (select .cse57 .cse23) 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|))) (.cse7 (let ((.cse56 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base|))) (store .cse56 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 4 (* (select .cse56 .cse8) 4)) 1))) (.cse27 (store .cse13 .cse55 |c_writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) (.cse4 (let ((.cse54 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|))) (store .cse54 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| (* (select .cse54 .cse5) 4) 4) 1))) (.cse37 (let ((.cse53 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse53 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse53 .cse38) 4) 4) (+ |c_writer_fnThread1of1ForFork1_~i~1#1| 1))))) (and (= |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse1 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1471 .cse5))) (or (< 4 .cse3) (not (= v_ArrVal_1471 (store .cse4 .cse5 .cse3))) (= 4 .cse3) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse3 1)))) (= |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| 0) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1471 .cse8))) (or (not (= v_ArrVal_1471 (store .cse7 .cse8 .cse9))) (< (+ 3 .cse9) 0) (< 0 .cse9) (< 0 (let ((.cse10 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1471 .cse8))) (or (not (= v_ArrVal_1471 (store .cse7 .cse8 .cse11))) (< .cse11 1) (< 4 .cse11) (= .cse11 4) (< 0 (let ((.cse12 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ (* (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= (select .cse13 0) 0) (<= 1 (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse15 .cse16 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse14 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (let ((.cse20 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse17 (= (select .cse20 0) 0)) (.cse18 (select .cse20 20)) (.cse19 (= (select .cse20 4) 1))) (or (and .cse17 (= 0 .cse18) .cse19) (and .cse17 (<= 1 .cse18) (<= .cse18 3) .cse19) (and .cse17 (<= (+ 1 .cse18) 0) (<= 0 (+ 3 .cse18)) .cse19)))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (<= 1 (let ((.cse21 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| (store .cse22 .cse23 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse21 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse25 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse24 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ (* (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse1 .cse2 .cse25) v_ArrVal_1471)) (< 4 .cse25) (= .cse25 4) (< .cse25 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse28 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse26 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse26 (+ (* (select .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse27 .cse2 .cse28) v_ArrVal_1471)) (< 4 .cse28) (= .cse28 4) (< .cse28 1)))) (= |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| 0) (= (select .cse13 4) 1) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse30 (select v_ArrVal_1471 .cse16))) (or (< 0 (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse29 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (= .cse30 4) (< 4 .cse30) (not (= v_ArrVal_1471 (store .cse15 .cse16 .cse30))) (< .cse30 1)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse31 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse31 (+ (* (select .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse32) (not (= (store .cse1 .cse2 .cse32) v_ArrVal_1471)) (< (+ .cse32 3) 0)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse33 (select v_ArrVal_1471 .cse23))) (or (< 4 .cse33) (< .cse33 1) (= 4 .cse33) (not (= v_ArrVal_1471 (store .cse22 .cse23 .cse33))) (< 0 (let ((.cse34 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse34 (+ (* 4 (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1471 .cse38))) (or (< 0 (let ((.cse35 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse35 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 4 .cse36) (< .cse36 1) (not (= (store .cse37 .cse38 .cse36) v_ArrVal_1471)) (= .cse36 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse40 (select v_ArrVal_1471 .cse38))) (or (< 0 (let ((.cse39 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse39 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse39 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse40) (< (+ 3 .cse40) 0) (not (= (store .cse37 .cse38 .cse40) v_ArrVal_1471))))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse41 (select v_ArrVal_1471 .cse16))) (or (< 0 .cse41) (< 0 (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse42 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< (+ 3 .cse41) 0) (not (= v_ArrVal_1471 (store .cse15 .cse16 .cse41)))))) (= |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (<= 1 (let ((.cse43 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse27 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse43 (+ (* (select .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1471 .cse23))) (or (< (+ 3 .cse44) 0) (< 0 .cse44) (not (= v_ArrVal_1471 (store .cse22 .cse23 .cse44))) (< 0 (let ((.cse45 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse45 (+ (* 4 (select .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (<= 1 (let ((.cse46 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| (store .cse4 .cse5 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse46 (+ (* (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (<= 1 (let ((.cse47 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| (store .cse7 .cse8 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse47 (+ (* (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse49 (select v_ArrVal_1471 .cse2))) (or (< 0 (let ((.cse48 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse48 (+ (* (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse49) (< (+ .cse49 3) 0) (not (= (store .cse27 .cse2 .cse49) v_ArrVal_1471))))) (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse50 (select v_ArrVal_1471 .cse5))) (or (< (+ 3 .cse50) 0) (< 0 .cse50) (not (= v_ArrVal_1471 (store .cse4 .cse5 .cse50))) (< 0 (let ((.cse51 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_1471) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse51 (+ (* (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (<= 1 (let ((.cse52 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse37 .cse38 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse52 (+ (* (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))) is different from false [2024-05-07 08:49:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-07 08:49:02,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 08:49:02,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-05-07 08:49:02,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:49:02,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:49:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 250164921, now seen corresponding path program 1 times [2024-05-07 08:49:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:49:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060145847] [2024-05-07 08:49:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:49:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:49:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:49:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:49:06,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:49:06,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060145847] [2024-05-07 08:49:06,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060145847] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:49:06,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:49:06,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-05-07 08:49:06,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701669286] [2024-05-07 08:49:06,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:49:06,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-07 08:49:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:49:06,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-07 08:49:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-05-07 08:49:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:06,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:49:06,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 29 states have internal predecessors, (137), 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) [2024-05-07 08:49:06,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:06,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-07 08:49:06,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:22,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-07 08:49:22,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:49:22,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:49:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1348064810, now seen corresponding path program 1 times [2024-05-07 08:49:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:49:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974602264] [2024-05-07 08:49:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:49:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:49:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:49:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:49:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:49:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974602264] [2024-05-07 08:49:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974602264] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:49:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:49:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2024-05-07 08:49:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378572369] [2024-05-07 08:49:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:49:26,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-07 08:49:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:49:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-07 08:49:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2024-05-07 08:49:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:26,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:49:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 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) [2024-05-07 08:49:26,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:26,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:26,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:26,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:49:43,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-07 08:49:43,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:49:43,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:49:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -491030938, now seen corresponding path program 1 times [2024-05-07 08:49:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:49:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915288733] [2024-05-07 08:49:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:49:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:49:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:49:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:49:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:49:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915288733] [2024-05-07 08:49:45,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915288733] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:49:45,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:49:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-05-07 08:49:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366712810] [2024-05-07 08:49:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:49:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-07 08:49:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:49:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-07 08:49:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2024-05-07 08:49:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:45,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:49:45,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 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) [2024-05-07 08:49:45,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:45,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:45,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:49:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:49:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 08:49:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-07 08:49:50,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:49:50,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:49:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 357556893, now seen corresponding path program 1 times [2024-05-07 08:49:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:49:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543062637] [2024-05-07 08:49:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:49:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:49:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:49:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:49:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:49:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543062637] [2024-05-07 08:49:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543062637] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:49:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:49:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2024-05-07 08:49:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988606461] [2024-05-07 08:49:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:49:58,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-07 08:49:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:49:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-07 08:49:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1958, Unknown=0, NotChecked=0, Total=2070 [2024-05-07 08:49:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:49:58,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:49:58,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.217391304347826) internal successors, (148), 46 states have internal predecessors, (148), 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) [2024-05-07 08:49:58,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:49:58,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:49:58,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:49:58,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:49:58,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-07 08:49:58,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 08:50:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-07 08:50:23,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-07 08:50:23,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:50:23,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:50:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1315832491, now seen corresponding path program 1 times [2024-05-07 08:50:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:50:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920747304] [2024-05-07 08:50:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:50:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:50:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:50:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:50:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:50:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920747304] [2024-05-07 08:50:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920747304] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 08:50:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753553069] [2024-05-07 08:50:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:50:27,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 08:50:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:50:27,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 08:50:27,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 08:50:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:50:27,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2024-05-07 08:50:27,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 08:50:27,303 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:50:27,351 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-07 08:50:27,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-05-07 08:50:27,668 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-05-07 08:50:27,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-05-07 08:50:28,313 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-05-07 08:50:29,806 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-05-07 08:50:29,864 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-05-07 08:50:30,584 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-05-07 08:50:30,874 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-05-07 08:50:30,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 15 [2024-05-07 08:50:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-05-07 08:50:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:50:32,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 08:50:34,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1663 Int)) (or (< |reader_twoThread1of1ForFork0_~val~1#1| 2) (< (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| v_ArrVal_1661) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1663) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 08:50:34,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1663 Int)) (or (< (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1661) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1663) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork0_~val~1#1| 2))) is different from false [2024-05-07 08:50:34,647 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1663 Int) (v_ArrVal_1660 (Array Int Int))) (or (< |reader_twoThread1of1ForFork0_~val~1#1| 2) (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1660) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1661) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1663) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 08:50:35,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1663 Int) (v_ArrVal_1660 (Array Int Int))) (or (< |reader_twoThread1of1ForFork0_~val~1#1| 2) (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1660) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1661) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1663) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 08:50:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 363 [2024-05-07 08:50:47,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 08:50:47,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2024-05-07 08:50:47,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 08:50:47,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2024-05-07 08:50:47,882 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 08:50:47,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2024-05-07 08:50:47,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-05-07 08:50:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-05-07 08:50:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753553069] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 08:50:49,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 08:50:49,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 24] total 70 [2024-05-07 08:50:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374869999] [2024-05-07 08:50:49,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 08:50:49,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-05-07 08:50:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:50:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-05-07 08:50:49,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3947, Unknown=82, NotChecked=524, Total=4830 [2024-05-07 08:50:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:50:49,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:50:49,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.757142857142857) internal successors, (473), 70 states have internal predecessors, (473), 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) [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-07 08:50:49,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-07 08:50:49,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-07 08:51:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-07 08:51:07,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 08:51:07,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-05-07 08:51:07,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 08:51:07,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:51:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2023151598, now seen corresponding path program 1 times [2024-05-07 08:51:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:51:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721112538] [2024-05-07 08:51:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:51:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:51:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:51:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:51:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:51:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721112538] [2024-05-07 08:51:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721112538] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 08:51:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035583521] [2024-05-07 08:51:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:51:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 08:51:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:51:21,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 08:51:21,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-07 08:51:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:51:21,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 176 conjunts are in the unsatisfiable core [2024-05-07 08:51:21,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 08:51:21,647 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:51:21,876 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 08:51:21,877 INFO L378 Elim1Store]: Elim1 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 [2024-05-07 08:51:22,139 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-05-07 08:51:22,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2024-05-07 08:51:22,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-05-07 08:51:23,040 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 18 [2024-05-07 08:51:23,490 INFO L378 Elim1Store]: Elim1 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 16 [2024-05-07 08:51:24,978 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-05-07 08:51:24,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2024-05-07 08:51:25,775 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 16 [2024-05-07 08:51:31,218 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-05-07 08:51:31,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2024-05-07 08:51:32,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-05-07 08:51:34,379 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2024-05-07 08:51:34,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2024-05-07 08:51:35,352 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 21 [2024-05-07 08:51:39,236 INFO L349 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2024-05-07 08:51:39,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 64 [2024-05-07 08:51:40,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 47 treesize of output 29 [2024-05-07 08:51:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2024-05-07 08:51:42,435 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2024-05-07 08:51:42,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 63 [2024-05-07 08:51:42,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 96 treesize of output 76 [2024-05-07 08:51:42,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 110 [2024-05-07 08:51:43,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 30 [2024-05-07 08:51:43,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 23 [2024-05-07 08:51:49,813 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-05-07 08:51:49,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 64 [2024-05-07 08:51:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:51:50,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 08:51:53,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse3 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1776 .cse3))) (or (= .cse0 4) (< 0 (let ((.cse1 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse1 (+ (* 4 (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_1776 (store .cse2 .cse3 .cse0))) (< 4 .cse0) (< .cse0 1)))) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1776 .cse3))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* 4 (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_1776 (store .cse2 .cse3 .cse5))) (< 0 .cse5) (< (+ .cse5 3) 0)))) (<= 1 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse2 .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))))) is different from false [2024-05-07 08:51:56,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4))) (let ((.cse4 (not .cse11)) (.cse2 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse8 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 4)) (.cse3 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1776 .cse3))) (or (= .cse0 4) (< 0 (let ((.cse1 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse1 (+ (* 4 (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_1776 (store .cse2 .cse3 .cse0))) (< 4 .cse0) (< .cse0 1)))) .cse4) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse6 (select v_ArrVal_1776 .cse3))) (or (< 0 (let ((.cse5 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse5 (+ (* 4 (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_1776 (store .cse2 .cse3 .cse6))) (< 0 .cse6) (< (+ .cse6 3) 0)))) .cse4) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse7 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store (store .cse2 .cse8 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse7 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1776 .cse3))) (or (= .cse9 4) (< 0 (let ((.cse10 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ (* 4 (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 4 .cse9) (not (= v_ArrVal_1776 (store (store .cse2 .cse8 (select v_ArrVal_1776 .cse8)) .cse3 .cse9))) (< .cse9 1)))) .cse11) (or .cse11 (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1776 .cse3))) (or (< 0 (let ((.cse12 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ (* 4 (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse13) (not (= v_ArrVal_1776 (store (store .cse2 .cse8 (select v_ArrVal_1776 .cse8)) .cse3 .cse13))) (< (+ .cse13 3) 0)))))))) is different from false [2024-05-07 08:52:28,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base|)) (.cse3 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| 20))) (let ((.cse14 (select .cse1 .cse3))) (let ((.cse9 (= .cse14 4))) (let ((.cse6 (not .cse9)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| (* .cse14 4) 4))) (and (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| (store (store .cse1 .cse2 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4))))) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1776 .cse3))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4)))) (< 4 .cse5) (< .cse5 1) (not (= (store .cse1 .cse3 .cse5) v_ArrVal_1776)) (= .cse5 4)))) .cse6) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1776 .cse3))) (or (< 0 (let ((.cse7 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse7 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4)))) (not (= (store .cse1 .cse3 .cse8) v_ArrVal_1776)) (< 0 .cse8) (< (+ .cse8 3) 0)))) .cse6) (or .cse9 (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse10 (select v_ArrVal_1776 .cse3))) (or (not (= (store (store .cse1 .cse2 (select v_ArrVal_1776 .cse2)) .cse3 .cse10) v_ArrVal_1776)) (< 0 (let ((.cse11 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4)))) (< 4 .cse10) (< .cse10 1) (= .cse10 4))))) (or .cse9 (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1776 .cse3))) (or (not (= (store (store .cse1 .cse2 (select v_ArrVal_1776 .cse2)) .cse3 .cse12) v_ArrVal_1776)) (< 0 (let ((.cse13 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4)))) (< 0 .cse12) (< (+ .cse12 3) 0)))))))))) is different from false [2024-05-07 08:59:38,696 WARN L293 SmtUtils]: Spent 19.72s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 08:59:42,432 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse2 (mod (+ 1 |c_ULTIMATE.start_ring_enqueue_#t~mem4#1|) 4))) (let ((.cse1 (= .cse2 0)) (.cse0 (+ 2 |c_ULTIMATE.start_ring_enqueue_#t~mem4#1|)) (.cse3 (select .cse13 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|))) (or (and (or (< 0 .cse0) .cse1) (= .cse2 .cse3)) (let ((.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse8 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20)) (.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse13 .cse12) 4)))) (and (forall ((v_ArrVal_1773 Int)) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse10 (select .cse11 .cse12))) (let ((.cse9 (mod (+ .cse10 1) 4))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse11 .cse12 (+ .cse9 (- 4)))))) (let ((.cse7 (select .cse6 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1776 .cse8))) (or (< .cse4 1) (= 4 .cse4) (< 0 (let ((.cse5 (select (store .cse6 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse5 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= (store .cse7 .cse8 .cse4) v_ArrVal_1776)) (< 4 .cse4)))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse9 0) (< 0 (+ .cse10 2)) (not (= (select .cse7 .cse8) 4))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse20 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse16 (+ (select .cse20 .cse12) 1))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse20 .cse12 (mod .cse16 4))))) (let ((.cse15 (select .cse18 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (not (= (select .cse15 .cse8) 4)) (< .cse16 0) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse19 (select v_ArrVal_1776 .cse8))) (or (< 0 (let ((.cse17 (select (store .cse18 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse17 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse17 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< .cse19 1) (= 4 .cse19) (not (= (store .cse15 .cse8 .cse19) v_ArrVal_1776)) (< 4 .cse19)))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse25 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse21 (+ (select .cse25 .cse12) 1))) (or (< .cse21 0) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse22 (select (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse25 .cse12 (mod .cse21 4))))) (store .cse23 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse24 (select .cse23 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse24 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse24 .cse8) 4) 4) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse8 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse22 (+ (* (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse32 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse32 .cse12 0)))) (let ((.cse26 (select .cse31 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse28 (select .cse26 .cse8))) (or (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse29 (select v_ArrVal_1776 .cse8))) (or (not (= v_ArrVal_1776 (store (let ((.cse27 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse28 4) 4))) (store .cse26 .cse27 (select v_ArrVal_1776 .cse27))) .cse8 .cse29))) (< 0 .cse29) (< 0 (let ((.cse30 (select (store .cse31 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse30 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< (+ 3 .cse29) 0)))) (not (= (mod (+ (select .cse32 .cse12) 1) 4) 0)) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse28 4))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse33 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse33 .cse12 0)))) (let ((.cse35 (select .cse39 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse37 (select .cse35 .cse8))) (or (not (= (mod (+ (select .cse33 .cse12) 1) 4) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse34 (select v_ArrVal_1776 .cse8))) (or (< .cse34 1) (= 4 .cse34) (not (= v_ArrVal_1776 (store (let ((.cse36 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse37 4) 4))) (store .cse35 .cse36 (select v_ArrVal_1776 .cse36))) .cse8 .cse34))) (< 0 (let ((.cse38 (select (store .cse39 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse38 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 4 .cse34)))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse37 4))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse45 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse41 (+ (select .cse45 .cse12) 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse45 .cse12 (mod .cse41 4))))) (let ((.cse40 (select .cse43 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (not (= (select .cse40 .cse8) 4)) (< .cse41 0) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1776 .cse8))) (or (< 0 (let ((.cse42 (select (store .cse43 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse42 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (not (= (store .cse40 .cse8 .cse44) v_ArrVal_1776)) (< 0 .cse44) (< (+ 3 .cse44) 0)))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse46 (store .cse13 .cse14 v_ArrVal_1773))) (or (not (= (mod (+ (select .cse46 .cse12) 1) 4) 0)) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse47 (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse46 .cse12 0)))) (store .cse48 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse49 (select .cse48 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse49 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse49 .cse8) 4) 4) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse8 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse47 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_1773 Int)) (let ((.cse50 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse50 .cse12 0)))) (let ((.cse51 (select .cse54 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (not (= (mod (+ (select .cse50 .cse12) 1) 4) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse52 (select v_ArrVal_1776 .cse8))) (or (not (= (store .cse51 .cse8 .cse52) v_ArrVal_1776)) (< 0 .cse52) (< 0 (let ((.cse53 (select (store .cse54 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse53 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< (+ 3 .cse52) 0)))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (select .cse51 .cse8) 4))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse62 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse56 (+ (select .cse62 .cse12) 1))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse62 .cse12 (mod .cse56 4))))) (let ((.cse60 (select .cse58 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse55 (select .cse60 .cse8))) (or (= .cse55 4) (< .cse56 0) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse59 (select v_ArrVal_1776 .cse8))) (or (< 0 (let ((.cse57 (select (store .cse58 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse57 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse57 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< .cse59 1) (= 4 .cse59) (not (= (store (let ((.cse61 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse55 4) 4))) (store .cse60 .cse61 (select v_ArrVal_1776 .cse61))) .cse8 .cse59) v_ArrVal_1776)) (< 4 .cse59))))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse63 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse63 .cse12 0)))) (let ((.cse65 (select .cse67 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (not (= (mod (+ (select .cse63 .cse12) 1) 4) 0)) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse64 (select v_ArrVal_1776 .cse8))) (or (< .cse64 1) (= 4 .cse64) (not (= (store .cse65 .cse8 .cse64) v_ArrVal_1776)) (< 0 (let ((.cse66 (select (store .cse67 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse66 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse66 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 4 .cse64)))) (not (= (select .cse65 .cse8) 4))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse76 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse75 (select .cse76 .cse12))) (let ((.cse74 (mod (+ .cse75 1) 4))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse76 .cse12 (+ .cse74 (- 4)))))) (let ((.cse69 (select .cse73 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse68 (select .cse69 .cse8))) (or (= .cse68 4) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1776 .cse8))) (or (not (= (store (let ((.cse70 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse68 4) 4))) (store .cse69 .cse70 (select v_ArrVal_1776 .cse70))) .cse8 .cse71) v_ArrVal_1776)) (< 0 .cse71) (< 0 (let ((.cse72 (select (store .cse73 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse72 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse72 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ 3 .cse71) 0)))) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse74 0) (< 0 (+ .cse75 2)))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse85 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse84 (select .cse85 .cse12))) (let ((.cse83 (mod (+ .cse84 1) 4))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse85 .cse12 (+ .cse83 (- 4)))))) (let ((.cse79 (select .cse82 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse77 (select .cse79 .cse8))) (or (= .cse77 4) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse78 (select v_ArrVal_1776 .cse8))) (or (< .cse78 1) (= 4 .cse78) (not (= (store (let ((.cse80 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse77 4) 4))) (store .cse79 .cse80 (select v_ArrVal_1776 .cse80))) .cse8 .cse78) v_ArrVal_1776)) (< 0 (let ((.cse81 (select (store .cse82 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse81 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse81 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< 4 .cse78)))) (= .cse83 0) (< 0 (+ .cse84 2)))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse92 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse91 (select .cse92 .cse12))) (let ((.cse86 (mod (+ .cse91 1) 4))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse92 .cse12 (+ .cse86 (- 4)))))) (let ((.cse90 (select .cse89 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse86 0) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse87 (select v_ArrVal_1776 .cse8))) (or (< 0 .cse87) (< 0 (let ((.cse88 (select (store .cse89 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse88 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse88 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= (store .cse90 .cse8 .cse87) v_ArrVal_1776)) (< (+ 3 .cse87) 0)))) (< 0 (+ .cse91 2)) (not (= (select .cse90 .cse8) 4))))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse96 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse98 (select .cse96 .cse12))) (let ((.cse97 (mod (+ .cse98 1) 4))) (or (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse93 (select (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse96 .cse12 (+ .cse97 (- 4)))))) (store .cse94 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse95 (select .cse94 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse95 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse95 .cse8) 4) 4) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse8 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse93 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse93 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (= .cse97 0) (< 0 (+ .cse98 2))))))) (forall ((v_ArrVal_1773 Int)) (let ((.cse106 (store .cse13 .cse14 v_ArrVal_1773))) (let ((.cse100 (+ (select .cse106 .cse12) 1))) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse106 .cse12 (mod .cse100 4))))) (let ((.cse104 (select .cse102 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse99 (select .cse104 .cse8))) (or (= .cse99 4) (< .cse100 0) (< v_ArrVal_1773 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_1776 (Array Int Int))) (let ((.cse103 (select v_ArrVal_1776 .cse8))) (or (< 0 (let ((.cse101 (select (store .cse102 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1776) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse101 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse101 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse103) (not (= (store (let ((.cse105 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse99 4) 4))) (store .cse104 .cse105 (select v_ArrVal_1776 .cse105))) .cse8 .cse103) v_ArrVal_1776)) (< (+ 3 .cse103) 0)))))))))))))) (and (not .cse1) (<= .cse0 0) (= .cse2 (+ .cse3 4)))))) is different from true [2024-05-07 09:01:44,311 WARN L293 SmtUtils]: Spent 17.74s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-07 09:01:49,607 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-05-07 09:01:49,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-07 09:01:49,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 09:01:49,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 09:01:49,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-07 09:01:49,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-05-07 09:01:49,809 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. [2024-05-07 09:01:49,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2024-05-07 09:01:49,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-05-07 09:01:49,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2024-05-07 09:01:49,812 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2024-05-07 09:01:49,812 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-05-07 09:01:49,814 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-05-07 09:01:49,814 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2024-05-07 09:01:49,814 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-05-07 09:01:49,814 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-05-07 09:01:49,817 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 09:01:49,820 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 09:01:49,821 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 09:01:49,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 09:01:49 BasicIcfg [2024-05-07 09:01:49,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 09:01:49,822 INFO L158 Benchmark]: Toolchain (without parser) took 851896.10ms. Allocated memory was 223.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 148.1MB in the beginning and 515.1MB in the end (delta: -366.9MB). Peak memory consumption was 904.9MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 223.3MB. Free memory was 184.0MB in the beginning and 183.9MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.32ms. Allocated memory was 223.3MB in the beginning and 270.5MB in the end (delta: 47.2MB). Free memory was 148.0MB in the beginning and 205.3MB in the end (delta: -57.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.05ms. Allocated memory is still 270.5MB. Free memory was 205.3MB in the beginning and 202.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: Boogie Preprocessor took 54.38ms. Allocated memory is still 270.5MB. Free memory was 202.1MB in the beginning and 199.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: RCFGBuilder took 538.37ms. Allocated memory is still 270.5MB. Free memory was 199.5MB in the beginning and 174.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,823 INFO L158 Benchmark]: TraceAbstraction took 850658.27ms. Allocated memory was 270.5MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 173.3MB in the beginning and 515.1MB in the end (delta: -341.8MB). Peak memory consumption was 883.0MB. Max. memory is 8.0GB. [2024-05-07 09:01:49,831 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 223.3MB. Free memory was 184.0MB in the beginning and 183.9MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.32ms. Allocated memory was 223.3MB in the beginning and 270.5MB in the end (delta: 47.2MB). Free memory was 148.0MB in the beginning and 205.3MB in the end (delta: -57.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.05ms. Allocated memory is still 270.5MB. Free memory was 205.3MB in the beginning and 202.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.38ms. Allocated memory is still 270.5MB. Free memory was 202.1MB in the beginning and 199.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 538.37ms. Allocated memory is still 270.5MB. Free memory was 199.5MB in the beginning and 174.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 850658.27ms. Allocated memory was 270.5MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 173.3MB in the beginning and 515.1MB in the end (delta: -341.8MB). Peak memory consumption was 883.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1229456, independent: 1200516, independent conditional: 1197723, independent unconditional: 2793, dependent: 28940, dependent conditional: 28936, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1202118, independent: 1200516, independent conditional: 1197723, independent unconditional: 2793, dependent: 1602, dependent conditional: 1598, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1202118, independent: 1200516, independent conditional: 1197723, independent unconditional: 2793, dependent: 1602, dependent conditional: 1598, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1202118, independent: 1200516, independent conditional: 1197723, independent unconditional: 2793, dependent: 1602, dependent conditional: 1598, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 563460, independent unconditional: 637056, dependent: 9759, dependent conditional: 7561, dependent unconditional: 2198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 199033, independent unconditional: 1001483, dependent: 9759, dependent conditional: 3857, dependent unconditional: 5902, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 199033, independent unconditional: 1001483, dependent: 9759, dependent conditional: 3857, dependent unconditional: 5902, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4254, independent: 4180, independent conditional: 469, independent unconditional: 3711, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4254, independent: 4172, independent conditional: 0, independent unconditional: 4172, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 82, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 23, independent conditional: 18, independent unconditional: 5, dependent: 190, dependent conditional: 122, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1210275, independent: 1196336, independent conditional: 198564, independent unconditional: 997772, dependent: 9685, dependent conditional: 3799, dependent unconditional: 5886, unknown: 4254, unknown conditional: 527, unknown unconditional: 3727] , Statistics on independence cache: Total cache size (in pairs): 4254, Positive cache size: 4180, Positive conditional cache size: 469, Positive unconditional cache size: 3711, Negative cache size: 74, Negative conditional cache size: 58, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 368131, Maximal queried relation: 10, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 563460, independent unconditional: 637056, dependent: 9759, dependent conditional: 7561, dependent unconditional: 2198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 199033, independent unconditional: 1001483, dependent: 9759, dependent conditional: 3857, dependent unconditional: 5902, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1210275, independent: 1200516, independent conditional: 199033, independent unconditional: 1001483, dependent: 9759, dependent conditional: 3857, dependent unconditional: 5902, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4254, independent: 4180, independent conditional: 469, independent unconditional: 3711, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4254, independent: 4172, independent conditional: 0, independent unconditional: 4172, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 82, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 74, dependent conditional: 58, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 23, independent conditional: 18, independent unconditional: 5, dependent: 190, dependent conditional: 122, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1210275, independent: 1196336, independent conditional: 198564, independent unconditional: 997772, dependent: 9685, dependent conditional: 3799, dependent unconditional: 5886, unknown: 4254, unknown conditional: 527, unknown unconditional: 3727] , Statistics on independence cache: Total cache size (in pairs): 4254, Positive cache size: 4180, Positive conditional cache size: 469, Positive unconditional cache size: 3711, Negative cache size: 74, Negative conditional cache size: 58, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 368131 ], Independence queries for same thread: 27338 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 244 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-5-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 850.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 148.3s, 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: 300, 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.3s SatisfiabilityAnalysisTime, 58.7s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1592 ConstructedInterpolants, 160 QuantifiedInterpolants, 42450 SizeOfPredicates, 65 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 19/86 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, ConditionalCommutativityCheckTime: 29.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 24, ConditionalCommutativityTraceChecks: 15, ConditionalCommutativityImperfectProofs: 12 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown