/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --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 21:58:24,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 21:58:24,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 21:58:24,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 21:58:24,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 21:58:24,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 21:58:24,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 21:58:24,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 21:58:24,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 21:58:24,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 21:58:24,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 21:58:24,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 21:58:24,114 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 21:58:24,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 21:58:24,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 21:58:24,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 21:58:24,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 21:58:24,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 21:58:24,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 21:58:24,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 21:58:24,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 21:58:24,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 21:58:24,118 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 21:58:24,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 21:58:24,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:58:24,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 21:58:24,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 21:58:24,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 21:58:24,120 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 21:58:24,120 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT 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 21:58:24,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 21:58:24,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 21:58:24,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 21:58:24,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 21:58:24,336 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 21:58:24,336 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 21:58:25,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 21:58:25,529 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 21:58:25,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-07 21:58:25,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70e33d571/023320d6055e4851a285eaa549798b62/FLAG632dd11b8 [2024-05-07 21:58:25,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70e33d571/023320d6055e4851a285eaa549798b62 [2024-05-07 21:58:25,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 21:58:25,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 21:58:25,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 21:58:25,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 21:58:25,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 21:58:25,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:58:25" (1/1) ... [2024-05-07 21:58:25,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491ca8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:25, skipping insertion in model container [2024-05-07 21:58:25,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:58:25" (1/1) ... [2024-05-07 21:58:25,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 21:58:25,923 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 21:58:25,931 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 21:58:25,986 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 21:58:26,075 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 21:58:26,076 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 21:58:26,077 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 21:58:26,077 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 21:58:26,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:58:26,089 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 21:58:26,118 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 21:58:26,119 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 21:58:26,120 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 21:58:26,127 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 21:58:26,127 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 21:58:26,128 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 21:58:26,128 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 21:58:26,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:58:26,182 INFO L206 MainTranslator]: Completed translation [2024-05-07 21:58:26,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26 WrapperNode [2024-05-07 21:58:26,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 21:58:26,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 21:58:26,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 21:58:26,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 21:58:26,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,237 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 211 [2024-05-07 21:58:26,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 21:58:26,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 21:58:26,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 21:58:26,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 21:58:26,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 21:58:26,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 21:58:26,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 21:58:26,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 21:58:26,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (1/1) ... [2024-05-07 21:58:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:58:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:58:26,328 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 21:58:26,346 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 21:58:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2024-05-07 21:58:26,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2024-05-07 21:58:26,368 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2024-05-07 21:58:26,368 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2024-05-07 21:58:26,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 21:58:26,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 21:58:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 21:58:26,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 21:58:26,371 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 21:58:26,488 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 21:58:26,490 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 21:58:26,717 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 21:58:26,739 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 21:58:26,739 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-07 21:58:26,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:58:26 BoogieIcfgContainer [2024-05-07 21:58:26,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 21:58:26,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 21:58:26,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 21:58:26,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 21:58:26,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 09:58:25" (1/3) ... [2024-05-07 21:58:26,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e186a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:58:26, skipping insertion in model container [2024-05-07 21:58:26,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:58:26" (2/3) ... [2024-05-07 21:58:26,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e186a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:58:26, skipping insertion in model container [2024-05-07 21:58:26,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:58:26" (3/3) ... [2024-05-07 21:58:26,752 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2024-05-07 21:58:26,758 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 21:58:26,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 21:58:26,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-07 21:58:26,765 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 21:58:26,884 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 21:58:26,918 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 21:58:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 21:58:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:58:26,924 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 21:58:26,927 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 21:58:26,957 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 21:58:26,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:58:26,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 21:58:26,973 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;@522f2105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 21:58:26,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-07 21:58:27,180 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 37 treesize of output 31 [2024-05-07 21:58:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1329901190, now seen corresponding path program 1 times [2024-05-07 21:58:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:29,809 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 21:58:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:29,957 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 21:58:29,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 21:58:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 21:58:30,269 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 21:58:30,351 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 21:58:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1696175707, now seen corresponding path program 1 times [2024-05-07 21:58:30,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:30,623 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 21:58:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:30,751 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 21:58:30,950 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 21:58:30,968 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 21:58:31,008 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 21:58:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -479581409, now seen corresponding path program 2 times [2024-05-07 21:58:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:33,336 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 21:58:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:33,453 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 21:58:33,618 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 21:58:33,634 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 21:58:33,673 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 21:58:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -688799903, now seen corresponding path program 3 times [2024-05-07 21:58:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:36,063 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 21:58:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:36,216 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 21:58:36,246 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 21:58:36,285 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 21:58:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash -80167483, now seen corresponding path program 4 times [2024-05-07 21:58:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:36,457 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 21:58:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:36,532 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 21:58:36,553 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 21:58:36,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:58:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash 538585321, now seen corresponding path program 1 times [2024-05-07 21:58:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:58:36,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089238778] [2024-05-07 21:58:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:37,683 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 21:58:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:58:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089238778] [2024-05-07 21:58:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089238778] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:58:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:58:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-07 21:58:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282923770] [2024-05-07 21:58:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:58:37,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-07 21:58:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:58:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-07 21:58:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-05-07 21:58:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:58:37,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:58:37,708 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 21:58:37,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:58:39,540 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 21:58:39,656 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:39,657 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 21:58:39,677 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 21:58:39,797 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:39,798 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 21:58:39,811 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 21:58:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -62292534, now seen corresponding path program 1 times [2024-05-07 21:58:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:58:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:58:41,069 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 21:58:41,081 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 21:58:41,208 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:41,209 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 21:58:41,227 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 21:58:41,319 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:41,324 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 21:58:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -330340134, now seen corresponding path program 2 times [2024-05-07 21:58:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 21:58:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 21:58:44,042 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 21:58:44,053 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 21:58:44,198 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 21:58:44,244 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:44,245 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 21:58:44,330 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 21:58:44,373 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:44,373 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 21:58:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1970970037, now seen corresponding path program 3 times [2024-05-07 21:58:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:46,622 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 21:58:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:46,772 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 21:58:46,856 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 21:58:47,025 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:47,026 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 21:58:47,040 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 21:58:47,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:47,178 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 21:58:47,192 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 21:58:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -888138981, now seen corresponding path program 4 times [2024-05-07 21:58:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:48,105 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 21:58:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:48,178 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 21:58:48,567 INFO L349 Elim1Store]: treesize reduction 96, result has 41.1 percent of original size [2024-05-07 21:58:48,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 97 treesize of output 127 [2024-05-07 21:58:49,259 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:49,262 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 21:58:49,365 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 21:58:49,690 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:49,691 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 21:58:49,775 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 21:58:50,393 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:50,393 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 21:58:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1686041095, now seen corresponding path program 1 times [2024-05-07 21:58:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:58:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:58:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 21:58:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 21:58:50,921 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 21:58:51,080 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:51,083 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 21:58:51,103 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 21:58:51,290 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:51,290 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 21:58:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -575303592, now seen corresponding path program 1 times [2024-05-07 21:58:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:53,770 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 21:58:53,785 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 21:58:53,949 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 21:58:54,054 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:54,055 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 21:58:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1949129844, now seen corresponding path program 2 times [2024-05-07 21:58:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-07 21:58:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-07 21:58:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-07 21:58:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 21:58:57,174 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 21:58:57,397 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:57,397 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 21:58:57,520 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 21:58:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -575303592, now seen corresponding path program 3 times [2024-05-07 21:58:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:58,373 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 21:58:58,679 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 21:58:58,732 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:58:58,732 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 21:58:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -790615118, now seen corresponding path program 4 times [2024-05-07 21:58:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 21:58:59,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 21:58:59,646 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 21:58:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1414741495, now seen corresponding path program 5 times [2024-05-07 21:58:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:59,792 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 21:58:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:58:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:58:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:58:59,935 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 21:59:00,528 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 21:59:00,861 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 21:59:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1783079711, now seen corresponding path program 6 times [2024-05-07 21:59:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:59:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 21:59:03,287 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-05-07 21:59:03,288 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 8 new quantified variables, introduced 30 case distinctions, treesize of input 87 treesize of output 51 [2024-05-07 21:59:04,090 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 21:59:04,383 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:59:04,383 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 21:59:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 1 times [2024-05-07 21:59:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:04,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:04,876 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 25 [2024-05-07 21:59:04,895 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 27 treesize of output 23 [2024-05-07 21:59:05,088 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:59:05,088 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 21:59:05,232 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 21:59:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 270746730, now seen corresponding path program 1 times [2024-05-07 21:59:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:05,477 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 21:59:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:05,538 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 21:59:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 21:59:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-05-07 21:59:06,996 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-05-07 21:59:06,996 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 8 new quantified variables, introduced 30 case distinctions, treesize of input 87 treesize of output 51 [2024-05-07 21:59:07,585 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:59:07,585 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 21:59:07,670 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 21:59:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 2 times [2024-05-07 21:59:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:08,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:08,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 21:59:08,834 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 21:59:08,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:59:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash 388017180, now seen corresponding path program 1 times [2024-05-07 21:59:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:59:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890618325] [2024-05-07 21:59:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:10,488 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 21:59:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:59:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890618325] [2024-05-07 21:59:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890618325] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 21:59:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890888323] [2024-05-07 21:59:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:10,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 21:59:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:59:10,533 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 21:59:10,533 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 21:59:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:10,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-07 21:59:10,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 21:59:10,748 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 21:59:10,756 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 21:59:10,756 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 21:59:10,769 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-07 21:59:10,770 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 21:59:10,803 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 21:59:10,809 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 21:59:10,852 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 21:59:11,046 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 21:59:11,520 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-05-07 21:59:11,520 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 21:59:11,821 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 21:59:11,824 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 21:59:11,911 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 44 treesize of output 36 [2024-05-07 21:59:12,471 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-05-07 21:59:12,472 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 88 treesize of output 50 [2024-05-07 21:59:12,607 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 21:59:12,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 21:59:13,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (<= 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 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_1519 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1519 .cse2))) (or (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse4) (not (= v_ArrVal_1519 (store .cse1 .cse2 .cse4))) (< (+ 3 .cse4) 0)))) (forall ((v_ArrVal_1519 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1519 .cse2))) (or (< .cse5 1) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (= .cse5 4) (not (= v_ArrVal_1519 (store .cse1 .cse2 .cse5))) (< 4 .cse5)))))) is different from false [2024-05-07 21:59:17,952 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517))) (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| (* (select .cse2 .cse3) 4) 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_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517)) (.cse6 (select v_ArrVal_1519 .cse3))) (or (< 0 (let ((.cse4 (select (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |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)))) (< .cse6 1) (= .cse6 4) (not (= (store (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse3) 4) 4) 1)) .cse3 .cse6) v_ArrVal_1519)) (< 4 .cse6)))) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517)) (.cse10 (select v_ArrVal_1519 .cse3))) (or (< 0 (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse8 (+ (* (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< (+ .cse10 3) 0) (< 0 .cse10) (not (= (store (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse3) 4) 4) 1)) .cse3 .cse10) v_ArrVal_1519))))))) is different from false [2024-05-07 21:59:18,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517))) (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| (* (select .cse2 .cse3) 4) 4) 1)) .cse3 0))) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))))) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1519 .cse3)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517))) (or (< (+ .cse4 3) 0) (< 0 .cse4) (not (= (store (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 .cse3) 4) 4) 1)) .cse3 .cse4) v_ArrVal_1519)) (< 0 (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse7 (+ (* (select .cse7 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))))))) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517)) (.cse8 (select v_ArrVal_1519 .cse3))) (or (< .cse8 1) (= .cse8 4) (not (= (store (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse9 .cse3) 4) 4) 1)) .cse3 .cse8) v_ArrVal_1519)) (< 0 (let ((.cse11 (select (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse11 (+ (* (select .cse11 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (< 4 .cse8)))))) is different from false [2024-05-07 21:59:18,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517)) (.cse0 (select v_ArrVal_1519 .cse4))) (or (< .cse0 1) (< 0 (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse1 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* 4 (select .cse1 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) 4)))) (= .cse0 4) (not (= (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 .cse4) 4) 4) 1)) .cse4 .cse0) v_ArrVal_1519)) (< 4 .cse0)))) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517)) (.cse5 (select v_ArrVal_1519 .cse4))) (or (< (+ .cse5 3) 0) (< 0 .cse5) (< 0 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1519) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* 4 (select .cse6 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) 4)))) (not (= (store (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse8 .cse4) 4) 4) 1)) .cse4 .cse5) v_ArrVal_1519))))) (forall ((v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517))) (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| (* (select .cse11 .cse4) 4) 4) 1)) .cse4 0))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* (select .cse9 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4)))))))) is different from false [2024-05-07 21:59:18,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_DerPreprocessor_2 Int) (v_ArrVal_1517 (Array Int Int))) (or (< 0 v_DerPreprocessor_2) (< 0 (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 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)))) (< (+ 3 v_DerPreprocessor_2) 0))) (forall ((v_DerPreprocessor_3 Int) (v_ArrVal_1517 (Array Int Int))) (or (< v_DerPreprocessor_3 1) (< 4 v_DerPreprocessor_3) (< 0 (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 .cse1) 4) 4) 1)))) (select (store .cse3 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (= v_DerPreprocessor_3 4))) (forall ((v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 .cse1) 4) 4) 1)))) (select (store .cse5 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))))) is different from false [2024-05-07 21:59:18,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_ArrVal_1517 (Array Int Int))) (or (< 0 v_DerPreprocessor_2) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |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 (* 4 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))) (< (+ 3 v_DerPreprocessor_2) 0))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1517 (Array Int Int))) (or (< v_DerPreprocessor_3 1) (< 4 v_DerPreprocessor_3) (= v_DerPreprocessor_3 4) (< 0 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |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_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |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 (* 4 (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|))))))))) is different from false [2024-05-07 21:59:18,957 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_1516 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_ArrVal_1517 (Array Int Int))) (or (< 0 v_DerPreprocessor_2) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse2 .cse1))) 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)))) (< (+ 3 v_DerPreprocessor_2) 0))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 1 (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse5 .cse1))) 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_1516 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_1517 (Array Int Int))) (or (< v_DerPreprocessor_3 1) (< 0 (let ((.cse6 (let ((.cse7 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse7 .cse1))) 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)))) (< 4 v_DerPreprocessor_3) (= v_DerPreprocessor_3 4))))) is different from false [2024-05-07 21:59:18,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:18,971 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 21:59:18,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:18,978 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 21:59:18,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:18,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 424 treesize of output 275 [2024-05-07 21:59:19,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:19,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 178 [2024-05-07 21:59:19,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 9 [2024-05-07 21:59:19,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:19,280 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 236 treesize of output 248 [2024-05-07 21:59:21,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 21:59:21,099 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 21:59:21,099 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 21:59:21,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 21:59:21,105 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 21:59:21,105 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 21:59:21,394 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 21:59:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890888323] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 21:59:21,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 21:59:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 32] total 75 [2024-05-07 21:59:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21468827] [2024-05-07 21:59:21,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 21:59:21,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-05-07 21:59:21,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:59:21,507 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-05-07 21:59:21,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 31 [2024-05-07 21:59:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 3 times [2024-05-07 21:59:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:22,008 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 21:59:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:22,143 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 21:59:22,325 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 21:59:22,325 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 92 [2024-05-07 21:59:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 270746730, now seen corresponding path program 2 times [2024-05-07 21:59:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:22,489 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 21:59:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:22,542 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 21:59:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-05-07 21:59:22,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=5405, Unknown=30, NotChecked=1078, Total=6806 [2024-05-07 21:59:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:59:22,550 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:59:22,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 81 states have (on average 4.888888888888889) internal successors, (396), 83 states have internal predecessors, (396), 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 21:59:22,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:22,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:59:34,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 21:59:34,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 21:59:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 21:59:34,721 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2024-05-07 21:59:36,426 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 21:59:36,635 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:59:36,635 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 21:59:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 356184086, now seen corresponding path program 1 times [2024-05-07 21:59:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:36,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:36,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:37,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 21:59:37,725 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 76 [2024-05-07 21:59:38,095 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 21:59:38,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 21:59:38,228 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 21:59:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2146405875, now seen corresponding path program 1 times [2024-05-07 21:59:38,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:59:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:59:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-07 21:59:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3897, Unknown=0, NotChecked=0, Total=4160 [2024-05-07 21:59:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-07 21:59:48,038 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 21:59:48,238 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,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 21:59:48,239 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 21:59:48,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:59:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1348064810, now seen corresponding path program 1 times [2024-05-07 21:59:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:59:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604765984] [2024-05-07 21:59:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:49,672 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 21:59:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:59:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604765984] [2024-05-07 21:59:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604765984] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:59:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:59:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2024-05-07 21:59:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577497931] [2024-05-07 21:59:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:59:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-07 21:59:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:59:49,739 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-05-07 21:59:49,739 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 37 treesize of output 27 [2024-05-07 21:59:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 4 times [2024-05-07 21:59:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:49,998 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 21:59:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:50,096 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 21:59:50,237 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-05-07 21:59:50,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 103 treesize of output 83 [2024-05-07 21:59:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 356184086, now seen corresponding path program 2 times [2024-05-07 21:59:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:50,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-07 21:59:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2024-05-07 21:59:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:59:50,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:59:50,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.560975609756097) internal successors, (187), 42 states have internal predecessors, (187), 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 21:59:50,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:50,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-07 21:59:50,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:59:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-07 21:59:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-07 21:59:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48 [2024-05-07 21:59:56,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 21:59:56,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:59:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -491030938, now seen corresponding path program 1 times [2024-05-07 21:59:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:59:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003731075] [2024-05-07 21:59:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:59:57,702 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 21:59:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:59:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003731075] [2024-05-07 21:59:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003731075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:59:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:59:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-05-07 21:59:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427868200] [2024-05-07 21:59:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:59:57,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-07 21:59:57,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:59:57,770 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-05-07 21:59:57,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2024-05-07 21:59:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 5 times [2024-05-07 21:59:58,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:58,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:59,129 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-05-07 21:59:59,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 80 [2024-05-07 21:59:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 356184086, now seen corresponding path program 3 times [2024-05-07 21:59:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:59:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:59:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:59,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:59:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:59:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-07 21:59:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-05-07 21:59:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:59:59,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:59:59,465 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 21:59:59,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 21:59:59,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-07 21:59:59,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-07 21:59:59,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:00:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 22:00:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-07 22:00:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-07 22:00:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 22:00:02,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable49 [2024-05-07 22:00:02,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 22:00:02,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:00:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 357556893, now seen corresponding path program 1 times [2024-05-07 22:00:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:00:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809214979] [2024-05-07 22:00:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:05,392 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 22:00:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:00:05,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809214979] [2024-05-07 22:00:05,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809214979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:00:05,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:00:05,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2024-05-07 22:00:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398423438] [2024-05-07 22:00:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:00:05,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-07 22:00:05,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:00:05,506 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-05-07 22:00:05,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 31 [2024-05-07 22:00:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 6 times [2024-05-07 22:00:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:05,873 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 22:00:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:05,915 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 22:00:06,105 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-05-07 22:00:06,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 112 treesize of output 88 [2024-05-07 22:00:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 356184086, now seen corresponding path program 4 times [2024-05-07 22:00:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:00:06,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:00:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:00:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-05-07 22:00:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2700, Unknown=0, NotChecked=0, Total=2862 [2024-05-07 22:00:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:00:06,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:00:06,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.096153846153846) internal successors, (213), 53 states have internal predecessors, (213), 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 22:00:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 22:00:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-07 22:00:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-07 22:00:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-07 22:00:06,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 22:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-07 22:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-07 22:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 22:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-07 22:00:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55 [2024-05-07 22:00:15,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 22:00:15,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:00:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1315832491, now seen corresponding path program 1 times [2024-05-07 22:00:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:00:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19736076] [2024-05-07 22:00:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:16,917 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 22:00:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:00:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19736076] [2024-05-07 22:00:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19736076] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 22:00:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972990271] [2024-05-07 22:00:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 22:00:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:00:16,918 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 22:00:16,919 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 22:00:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:17,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2024-05-07 22:00:17,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 22:00:17,128 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 22:00:17,138 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-07 22:00:17,138 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 22:00:17,328 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-05-07 22:00:17,329 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 22:00:17,497 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 22:00:17,842 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 22:00:17,858 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 22:00:18,016 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 22:00:18,085 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-05-07 22:00:18,085 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 22:00:18,270 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 22:00:18,424 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 22:00:18,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 22:00:18,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1985 Int)) (or (< (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| v_ArrVal_1983) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1985) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork0_~val~1#1| 2))) is different from false [2024-05-07 22:00:18,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1985 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_1983) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1985) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 22:00:23,236 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1985 Int)) (or (< |reader_twoThread1of1ForFork0_~val~1#1| 2) (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_1982) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1983) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1985) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 22:00:23,247 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1985 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_1982) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1983) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1985) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 22:00:23,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork0_~val~1#1| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1985 Int)) (or (< |reader_twoThread1of1ForFork0_~val~1#1| 2) (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_1982) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_1983) |c_reader_twoThread1of1ForFork0_~#read~0#1.base|) (+ (* |reader_twoThread1of1ForFork0_~val~1#1| 4) (- 4) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) v_ArrVal_1985) |c_reader_twoThread1of1ForFork0_~#read~0#1.offset|) 1))) is different from false [2024-05-07 22:00:23,731 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 183 treesize of output 179 [2024-05-07 22:00:23,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 22:00:23,737 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 78 treesize of output 76 [2024-05-07 22:00:23,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 22:00:23,741 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 132 treesize of output 124 [2024-05-07 22:00:23,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 22:00:23,744 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 108 treesize of output 104 [2024-05-07 22:00:23,748 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 68 treesize of output 64 [2024-05-07 22:00:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-05-07 22:00:24,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972990271] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 22:00:24,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 22:00:24,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 24] total 74 [2024-05-07 22:00:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047739331] [2024-05-07 22:00:24,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 22:00:24,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-05-07 22:00:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:00:24,271 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-05-07 22:00:24,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 83 [2024-05-07 22:00:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 356184086, now seen corresponding path program 5 times [2024-05-07 22:00:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:00:24,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:00:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:00:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-05-07 22:00:24,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=4476, Unknown=60, NotChecked=700, Total=5550 [2024-05-07 22:00:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:00:24,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:00:24,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 6.608108108108108) internal successors, (489), 74 states have internal predecessors, (489), 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 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-07 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-07 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-07 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-07 22:00:24,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:00:32,068 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 35 treesize of output 29 [2024-05-07 22:00:32,091 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 27 [2024-05-07 22:00:32,783 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 22:00:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-05-07 22:00:32,959 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 22:00:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152051, now seen corresponding path program 1 times [2024-05-07 22:00:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:34,181 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 22:00:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:34,343 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 22:00:34,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-07 22:00:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=961, Invalid=10169, Unknown=0, NotChecked=0, Total=11130 [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-07 22:00:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-07 22:00:36,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-07 22:00:36,829 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,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-05-07 22:00:36,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 22:00:36,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:00:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2023151598, now seen corresponding path program 1 times [2024-05-07 22:00:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:00:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112296607] [2024-05-07 22:00:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:00:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:44,469 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 22:00:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:00:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112296607] [2024-05-07 22:00:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112296607] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 22:00:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069114679] [2024-05-07 22:00:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:00:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 22:00:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:00:44,471 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 22:00:44,472 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 22:00:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:00:44,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 176 conjunts are in the unsatisfiable core [2024-05-07 22:00:44,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 22:00:44,735 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 22:00:44,778 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 22:00:44,778 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 22:00:44,844 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-05-07 22:00:44,844 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 22:00:45,057 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 22:00:45,139 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 22:00:45,254 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 22:00:45,680 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-05-07 22:00:45,681 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 22:00:45,953 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 22:00:47,508 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-05-07 22:00:47,508 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 22:00:47,722 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 22:00:48,419 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 22:00:48,424 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 22:00:48,697 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 22:00:49,822 INFO L349 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2024-05-07 22:00:49,822 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 22:00:50,032 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 22:00:50,035 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 22:00:50,600 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2024-05-07 22:00:50,601 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 22:00:50,706 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 22:00:50,708 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 22:00:50,800 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 34 treesize of output 30 [2024-05-07 22:00:50,810 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 31 treesize of output 43 [2024-05-07 22:00:52,640 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-05-07 22:00:52,640 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 22:00:52,861 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 22:00:52,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 22:00:55,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4))) (let ((.cse4 (not .cse9)) (.cse1 (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)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2210 .cse2))) (or (= 4 .cse0) (not (= (store .cse1 .cse2 .cse0) v_ArrVal_2210)) (< .cse0 1) (< 4 .cse0) (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse4) (or .cse4 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse5 (select v_ArrVal_2210 .cse2))) (or (not (= (store .cse1 .cse2 .cse5) v_ArrVal_2210)) (< (+ 3 .cse5) 0) (< 0 .cse5) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |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)))))))) (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 .cse1 .cse8 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse2 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 .cse9 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2210 .cse2))) (or (< (+ 3 .cse10) 0) (< 0 .cse10) (not (= (store (store .cse1 .cse8 (select v_ArrVal_2210 .cse8)) .cse2 .cse10) v_ArrVal_2210)) (< 0 (let ((.cse11 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2210 .cse2))) (or (= 4 .cse12) (< .cse12 1) (< 4 .cse12) (not (= (store (store .cse1 .cse8 (select v_ArrVal_2210 .cse8)) .cse2 .cse12) v_ArrVal_2210)) (< 0 (let ((.cse13 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse9)))) is different from false [2024-05-07 22:00:56,683 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))) (let ((.cse14 (select .cse2 .cse3))) (let ((.cse10 (= .cse14 4))) (let ((.cse0 (not .cse10)) (.cse7 (+ (* .cse14 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2210 .cse3))) (or (= 4 .cse1) (not (= (store .cse2 .cse3 .cse1) v_ArrVal_2210)) (< .cse1 1) (< 4 .cse1) (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))))))) (or .cse0 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse5 (select v_ArrVal_2210 .cse3))) (or (not (= (store .cse2 .cse3 .cse5) v_ArrVal_2210)) (< (+ 3 .cse5) 0) (< 0 .cse5) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |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)))))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2210 .cse3))) (or (not (= (store (store .cse2 .cse7 (select v_ArrVal_2210 .cse7)) .cse3 .cse8) v_ArrVal_2210)) (< (+ 3 .cse8) 0) (< 0 .cse8) (< 0 (let ((.cse9 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse10) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse11 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store (store .cse2 .cse7 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ (* (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))) (or .cse10 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2210 .cse3))) (or (not (= (store (store .cse2 .cse7 (select v_ArrVal_2210 .cse7)) .cse3 .cse12) v_ArrVal_2210)) (= 4 .cse12) (< .cse12 1) (< 4 .cse12) (< 0 (let ((.cse13 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))))))))) is different from false [2024-05-07 22:00:57,541 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 ((.cse7 (= .cse14 4))) (let ((.cse6 (not .cse7)) (.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_2210 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2210 .cse3))) (or (< (+ 3 .cse4) 0) (< 0 .cse4) (not (= (store .cse1 .cse3 .cse4) v_ArrVal_2210)) (< 0 (let ((.cse5 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_2210) |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))))))) .cse6) (or .cse7 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2210 .cse3))) (or (< (+ 3 .cse8) 0) (< 0 .cse8) (not (= v_ArrVal_2210 (store (store .cse1 .cse2 (select v_ArrVal_2210 .cse2)) .cse3 .cse8))) (< 0 (let ((.cse9 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2210 .cse3))) (or (< 4 .cse10) (= .cse10 4) (not (= (store .cse1 .cse3 .cse10) v_ArrVal_2210)) (< .cse10 1) (< 0 (let ((.cse11 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse6) (or .cse7 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2210 .cse3))) (or (< 4 .cse12) (= .cse12 4) (not (= v_ArrVal_2210 (store (store .cse1 .cse2 (select v_ArrVal_2210 .cse2)) .cse3 .cse12))) (< .cse12 1) (< 0 (let ((.cse13 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))))))))) is different from false [2024-05-07 22:00:59,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|)) (.cse3 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20))) (let ((.cse14 (select .cse1 .cse3))) (let ((.cse4 (= .cse14 4))) (let ((.cse2 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse14 4) 4)) (.cse11 (not .cse4))) (and (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#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| (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (or .cse4 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse6 (select v_ArrVal_2210 .cse3))) (or (< 0 (let ((.cse5 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse5 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse6) (not (= v_ArrVal_2210 (store (store .cse1 .cse2 (select v_ArrVal_2210 .cse2)) .cse3 .cse6))) (< (+ 3 .cse6) 0))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2210 .cse3))) (or (< 0 (let ((.cse7 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |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))))) (= .cse8 4) (< 4 .cse8) (not (= v_ArrVal_2210 (store (store .cse1 .cse2 (select v_ArrVal_2210 .cse2)) .cse3 .cse8))) (< .cse8 1)))) .cse4) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2210 .cse3))) (or (< 0 (let ((.cse9 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (< 0 .cse10) (not (= (store .cse1 .cse3 .cse10) v_ArrVal_2210)) (< (+ 3 .cse10) 0)))) .cse11) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse13 (select v_ArrVal_2210 .cse3))) (or (< 0 (let ((.cse12 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))) (= .cse13 4) (< 4 .cse13) (not (= (store .cse1 .cse3 .cse13) v_ArrVal_2210)) (< .cse13 1)))) .cse11)))))) is different from false [2024-05-07 22:01:02,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (mod (+ |c_ULTIMATE.start_ring_enqueue_#t~mem7#1| 1) 4))) (let ((.cse4 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse17 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse19 (= .cse18 0)) (.cse20 (+ 2 |c_ULTIMATE.start_ring_enqueue_#t~mem7#1|))) (and (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse16 .cse17 .cse18)))) (let ((.cse2 (select .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse15 (select .cse2 .cse4))) (let ((.cse8 (= .cse15 4))) (let ((.cse3 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse15 4) 4)) (.cse7 (not .cse8))) (and (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse0 (select (store .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (store .cse2 .cse3 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse4 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse6 (select v_ArrVal_2210 .cse4))) (or (< 0 (let ((.cse5 (select (store .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |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 (= v_ArrVal_2210 (store .cse2 .cse4 .cse6))) (< 0 .cse6) (< (+ 3 .cse6) 0)))) .cse7) (or .cse8 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2210 .cse4))) (or (< 0 (let ((.cse9 (select (store .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= v_ArrVal_2210 (store (store .cse2 .cse3 (select v_ArrVal_2210 .cse3)) .cse4 .cse10))) (< 0 .cse10) (< (+ 3 .cse10) 0))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2210 .cse4))) (or (< 0 (let ((.cse11 (select (store .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= v_ArrVal_2210 (store (store .cse2 .cse3 (select v_ArrVal_2210 .cse3)) .cse4 .cse12))) (= .cse12 4) (< 4 .cse12) (< .cse12 1)))) .cse8) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2210 .cse4))) (or (< 0 (let ((.cse13 (select (store .cse1 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= v_ArrVal_2210 (store .cse2 .cse4 .cse14))) (= .cse14 4) (< 4 .cse14) (< .cse14 1)))) .cse7))))))) (and (not .cse19) (<= .cse20 0))) (or (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse16 .cse17 (+ .cse18 (- 4)))))) (let ((.cse21 (select .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse35 (select .cse21 .cse4))) (let ((.cse26 (= .cse35 4))) (let ((.cse28 (not .cse26)) (.cse22 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse35 4) 4))) (and (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse23 (select v_ArrVal_2210 .cse4))) (or (not (= (store (store .cse21 .cse22 (select v_ArrVal_2210 .cse22)) .cse4 .cse23) v_ArrVal_2210)) (= .cse23 4) (< 4 .cse23) (< 0 (let ((.cse24 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse23 1)))) .cse26) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse27 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (store .cse21 .cse22 |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|) .cse4 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse27 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))) (or .cse28 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse29 (select v_ArrVal_2210 .cse4))) (or (= .cse29 4) (< 4 .cse29) (< 0 (let ((.cse30 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse30 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= (store .cse21 .cse4 .cse29) v_ArrVal_2210)) (< .cse29 1))))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse31 (select v_ArrVal_2210 .cse4))) (or (< 0 .cse31) (< 0 (let ((.cse32 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse32 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse32 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= (store .cse21 .cse4 .cse31) v_ArrVal_2210)) (< (+ 3 .cse31) 0)))) .cse28) (or .cse26 (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse33 (select v_ArrVal_2210 .cse4))) (or (not (= (store (store .cse21 .cse22 (select v_ArrVal_2210 .cse22)) .cse4 .cse33) v_ArrVal_2210)) (< 0 .cse33) (< 0 (let ((.cse34 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse34 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ 3 .cse33) 0))))))))))) .cse19 (< 0 .cse20))))) is different from false [2024-05-07 22:03:24,645 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse2 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20)) (.cse9 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse8 .cse7) 4)))) (and (forall ((v_ArrVal_2206 Int)) (let ((.cse6 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse0 (+ (select .cse6 .cse7) 1))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse6 .cse7 (mod .cse0 4))))) (let ((.cse1 (select .cse5 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (< .cse0 0) (not (= (select .cse1 .cse2) 4)) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2210 .cse2))) (or (not (= (store .cse1 .cse2 .cse3) v_ArrVal_2210)) (< 0 .cse3) (< 0 (let ((.cse4 (select (store .cse5 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |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)))) (< (+ 3 .cse3) 0)))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse16 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse15 (select .cse16 .cse7))) (let ((.cse14 (mod (+ .cse15 1) 4))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse16 .cse7 (+ (- 4) .cse14))))) (let ((.cse10 (select .cse13 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse11 (select v_ArrVal_2210 .cse2))) (or (not (= v_ArrVal_2210 (store .cse10 .cse2 .cse11))) (< 0 .cse11) (< 0 (let ((.cse12 (select (store .cse13 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< (+ 3 .cse11) 0)))) (not (= (select .cse10 .cse2) 4)) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse14 0) (< 0 (+ .cse15 2))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse21 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse17 (+ (select .cse21 .cse7) 1))) (or (< .cse17 0) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse18 (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse21 .cse7 (mod .cse17 4))))) (store .cse19 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse20 (select .cse19 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse20 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 4 (* (select .cse20 .cse2) 4)) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse2 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse18 (+ (* (select .cse18 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse28 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse27 (select .cse28 .cse7))) (let ((.cse26 (mod (+ .cse27 1) 4))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse28 .cse7 (+ (- 4) .cse26))))) (let ((.cse22 (select .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse23 (select v_ArrVal_2210 .cse2))) (or (not (= v_ArrVal_2210 (store .cse22 .cse2 .cse23))) (= .cse23 4) (< 4 .cse23) (< 0 (let ((.cse24 (select (store .cse25 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< .cse23 1)))) (not (= (select .cse22 .cse2) 4)) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse26 0) (< 0 (+ .cse27 2))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse33 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse33 .cse7 0)))) (let ((.cse32 (select .cse30 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse31 (select v_ArrVal_2210 .cse2))) (or (< 0 (let ((.cse29 (select (store .cse30 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse29 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= .cse31 4) (< 4 .cse31) (not (= v_ArrVal_2210 (store .cse32 .cse2 .cse31))) (< .cse31 1)))) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (select .cse32 .cse2) 4)) (not (= (mod (+ (select .cse33 .cse7) 1) 4) 0))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse39 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse34 (+ (select .cse39 .cse7) 1))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse39 .cse7 (mod .cse34 4))))) (let ((.cse35 (select .cse38 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (< .cse34 0) (not (= (select .cse35 .cse2) 4)) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse36 (select v_ArrVal_2210 .cse2))) (or (= .cse36 4) (< 4 .cse36) (not (= (store .cse35 .cse2 .cse36) v_ArrVal_2210)) (< 0 (let ((.cse37 (select (store .cse38 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse37 (+ (* (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse36 1)))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse44 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse44 .cse7 0)))) (let ((.cse43 (select .cse41 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse42 (select v_ArrVal_2210 .cse2))) (or (< 0 (let ((.cse40 (select (store .cse41 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse40 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse40 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< 0 .cse42) (< (+ 3 .cse42) 0) (not (= v_ArrVal_2210 (store .cse43 .cse2 .cse42)))))) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (select .cse43 .cse2) 4)) (not (= (mod (+ (select .cse44 .cse7) 1) 4) 0))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse53 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse52 (select .cse53 .cse7))) (let ((.cse46 (mod (+ .cse52 1) 4))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse53 .cse7 (+ (- 4) .cse46))))) (let ((.cse47 (select .cse51 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse45 (select .cse47 .cse2))) (or (= .cse45 4) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse46 0) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse49 (select v_ArrVal_2210 .cse2))) (or (not (= (store (let ((.cse48 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse45 4) 4))) (store .cse47 .cse48 (select v_ArrVal_2210 .cse48))) .cse2 .cse49) v_ArrVal_2210)) (< 0 .cse49) (< 0 (let ((.cse50 (select (store .cse51 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse50 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse50 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< (+ 3 .cse49) 0)))) (< 0 (+ .cse52 2)))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse61 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse55 (+ (select .cse61 .cse7) 1))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse61 .cse7 (mod .cse55 4))))) (let ((.cse57 (select .cse60 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse54 (select .cse57 .cse2))) (or (= .cse54 4) (< .cse55 0) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse56 (select v_ArrVal_2210 .cse2))) (or (< 0 .cse56) (not (= (store (let ((.cse58 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 4 (* .cse54 4)))) (store .cse57 .cse58 (select v_ArrVal_2210 .cse58))) .cse2 .cse56) v_ArrVal_2210)) (< 0 (let ((.cse59 (select (store .cse60 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse59 (+ (* (select .cse59 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< (+ 3 .cse56) 0))))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse65 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse67 (select .cse65 .cse7))) (let ((.cse66 (mod (+ .cse67 1) 4))) (or (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse62 (select (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse65 .cse7 (+ (- 4) .cse66))))) (store .cse63 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse64 (select .cse63 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse64 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse64 .cse2) 4) 4) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse2 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse62 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse62 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4)))))) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse66 0) (< 0 (+ .cse67 2))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse76 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse75 (select .cse76 .cse7))) (let ((.cse74 (mod (+ .cse75 1) 4))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse76 .cse7 (+ (- 4) .cse74))))) (let ((.cse68 (select .cse73 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse70 (select .cse68 .cse2))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse71 (select v_ArrVal_2210 .cse2))) (or (not (= (store (let ((.cse69 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse70 4) 4))) (store .cse68 .cse69 (select v_ArrVal_2210 .cse69))) .cse2 .cse71) v_ArrVal_2210)) (= .cse71 4) (< 4 .cse71) (< 0 (let ((.cse72 (select (store .cse73 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse72 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse72 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< .cse71 1)))) (= .cse70 4) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse74 0) (< 0 (+ .cse75 2)))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse80 (store .cse8 .cse9 v_ArrVal_2206))) (or (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((|writer_fnThread1of1ForFork1_ring_enqueue_~x#1| Int)) (<= 1 (let ((.cse77 (select (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse80 .cse7 0)))) (store .cse78 |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store (let ((.cse79 (select .cse78 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse79 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse79 .cse2) 4) 4) |writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) .cse2 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse77 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 (select .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4))))) (not (= (mod (+ (select .cse80 .cse7) 1) 4) 0))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse88 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse82 (+ (select .cse88 .cse7) 1))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse88 .cse7 (mod .cse82 4))))) (let ((.cse84 (select .cse87 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse81 (select .cse84 .cse2))) (or (= .cse81 4) (< .cse82 0) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse83 (select v_ArrVal_2210 .cse2))) (or (= .cse83 4) (< 4 .cse83) (not (= (store (let ((.cse85 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 4 (* .cse81 4)))) (store .cse84 .cse85 (select v_ArrVal_2210 .cse85))) .cse2 .cse83) v_ArrVal_2210)) (< 0 (let ((.cse86 (select (store .cse87 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse86 (+ (* (select .cse86 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse83 1))))))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse95 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse95 .cse7 0)))) (let ((.cse91 (select .cse90 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse93 (select .cse91 .cse2))) (or (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse94 (select v_ArrVal_2210 .cse2))) (or (< 0 (let ((.cse89 (select (store .cse90 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse89 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse89 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= v_ArrVal_2210 (store (let ((.cse92 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse93 4) 4))) (store .cse91 .cse92 (select v_ArrVal_2210 .cse92))) .cse2 .cse94))) (= .cse94 4) (< 4 .cse94) (< .cse94 1)))) (= .cse93 4) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (mod (+ (select .cse95 .cse7) 1) 4) 0)))))))) (forall ((v_ArrVal_2206 Int)) (let ((.cse97 (store .cse8 .cse9 v_ArrVal_2206))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse97 .cse7 0)))) (let ((.cse100 (select .cse99 |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (let ((.cse96 (select .cse100 .cse2))) (or (= .cse96 4) (< v_ArrVal_2206 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (mod (+ (select .cse97 .cse7) 1) 4) 0)) (forall ((v_ArrVal_2210 (Array Int Int))) (let ((.cse102 (select v_ArrVal_2210 .cse2))) (or (< 0 (let ((.cse98 (select (store .cse99 |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_2210) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse98 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse98 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= v_ArrVal_2210 (store (let ((.cse101 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* .cse96 4) 4))) (store .cse100 .cse101 (select v_ArrVal_2210 .cse101))) .cse2 .cse102))) (< 0 .cse102) (< (+ 3 .cse102) 0))))))))))))) is different from true [2024-05-07 22:05:03,561 WARN L293 SmtUtils]: Spent 13.93s 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 22:06:44,535 WARN L293 SmtUtils]: Spent 15.09s 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 22:08:44,038 WARN L293 SmtUtils]: Spent 18.98s 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) [2024-05-07 22:09:46,332 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-07 22:09:46,333 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-07 22:09:46,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-05-07 22:09:46,343 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 22:09:46,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 22:09:46,534 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-05-07 22:09:46,539 INFO L158 Benchmark]: Toolchain (without parser) took 680978.82ms. Allocated memory was 275.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 203.8MB in the beginning and 725.4MB in the end (delta: -521.6MB). Peak memory consumption was 726.1MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.18ms. Allocated memory is still 275.8MB. Free memory was 203.6MB in the beginning and 225.6MB in the end (delta: -22.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.06ms. Allocated memory is still 275.8MB. Free memory was 225.6MB in the beginning and 222.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: Boogie Preprocessor took 49.64ms. Allocated memory is still 275.8MB. Free memory was 222.5MB in the beginning and 219.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: RCFGBuilder took 457.83ms. Allocated memory is still 275.8MB. Free memory was 219.9MB in the beginning and 195.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,539 INFO L158 Benchmark]: TraceAbstraction took 679790.40ms. Allocated memory was 275.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 194.2MB in the beginning and 725.4MB in the end (delta: -531.2MB). Peak memory consumption was 716.8MB. Max. memory is 8.0GB. [2024-05-07 22:09:46,540 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.08ms. Allocated memory is still 179.3MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 622.18ms. Allocated memory is still 275.8MB. Free memory was 203.6MB in the beginning and 225.6MB in the end (delta: -22.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.06ms. Allocated memory is still 275.8MB. Free memory was 225.6MB in the beginning and 222.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.64ms. Allocated memory is still 275.8MB. Free memory was 222.5MB in the beginning and 219.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 457.83ms. Allocated memory is still 275.8MB. Free memory was 219.9MB in the beginning and 195.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 679790.40ms. Allocated memory was 275.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 194.2MB in the beginning and 725.4MB in the end (delta: -531.2MB). Peak memory consumption was 716.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-07 22:09:46,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...