/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 18:59:36,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 18:59:36,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 18:59:36,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 18:59:36,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 18:59:36,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 18:59:36,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 18:59:36,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 18:59:36,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 18:59:36,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 18:59:36,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 18:59:36,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 18:59:36,499 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 18:59:36,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 18:59:36,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 18:59:36,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 18:59:36,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 18:59:36,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 18:59:36,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 18:59:36,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 18:59:36,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 18:59:36,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-05 18:59:36,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 18:59:36,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 18:59:36,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 18:59:36,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 18:59:36,733 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 18:59:36,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 18:59:37,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 18:59:38,000 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 18:59:38,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 18:59:38,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/91da7b8c3/9a2ff2733263492d841d429ef04278b2/FLAG1c9862139 [2024-04-05 18:59:38,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/91da7b8c3/9a2ff2733263492d841d429ef04278b2 [2024-04-05 18:59:38,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 18:59:38,035 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 18:59:38,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 18:59:38,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 18:59:38,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 18:59:38,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38, skipping insertion in model container [2024-04-05 18:59:38,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,080 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 18:59:38,359 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-ext/02_inc_cas.i[30873,30886] [2024-04-05 18:59:38,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 18:59:38,378 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 18:59:38,425 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-ext/02_inc_cas.i[30873,30886] [2024-04-05 18:59:38,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 18:59:38,453 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 18:59:38,453 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 18:59:38,459 INFO L206 MainTranslator]: Completed translation [2024-04-05 18:59:38,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38 WrapperNode [2024-04-05 18:59:38,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 18:59:38,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 18:59:38,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 18:59:38,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 18:59:38,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,510 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-04-05 18:59:38,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 18:59:38,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 18:59:38,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 18:59:38,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 18:59:38,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 18:59:38,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 18:59:38,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 18:59:38,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 18:59:38,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (1/1) ... [2024-04-05 18:59:38,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 18:59:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:38,581 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-04-05 18:59:38,600 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-04-05 18:59:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-05 18:59:38,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 18:59:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 18:59:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 18:59:38,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 18:59:38,642 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 18:59:38,748 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 18:59:38,750 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 18:59:38,857 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 18:59:38,927 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 18:59:38,927 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 18:59:38,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:59:38 BoogieIcfgContainer [2024-04-05 18:59:38,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 18:59:38,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 18:59:38,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 18:59:38,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 18:59:38,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:59:38" (1/3) ... [2024-04-05 18:59:38,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cc9a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:59:38, skipping insertion in model container [2024-04-05 18:59:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:59:38" (2/3) ... [2024-04-05 18:59:38,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cc9a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:59:38, skipping insertion in model container [2024-04-05 18:59:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:59:38" (3/3) ... [2024-04-05 18:59:38,935 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-04-05 18:59:38,943 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 18:59:38,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 18:59:38,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 18:59:38,951 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 18:59:39,019 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 18:59:39,050 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 18:59:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 18:59:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:39,064 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-04-05 18:59:39,065 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-04-05 18:59:39,093 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 18:59:39,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:39,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 18:59:39,122 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;@47d4dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 18:59:39,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 18:59:39,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 18:59:39,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash 790974196, now seen corresponding path program 1 times [2024-04-05 18:59:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:39,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139999169] [2024-04-05 18:59:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139999169] [2024-04-05 18:59:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139999169] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 18:59:39,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000229397] [2024-04-05 18:59:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:39,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 18:59:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 18:59:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 18:59:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-04-05 18:59:39,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 18:59:39,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 18:59:39,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash 623441482, now seen corresponding path program 1 times [2024-04-05 18:59:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799852958] [2024-04-05 18:59:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799852958] [2024-04-05 18:59:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799852958] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 18:59:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095926570] [2024-04-05 18:59:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 18:59:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:39,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 18:59:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-04-05 18:59:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:39,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-04-05 18:59:39,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:39,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 18:59:39,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 18:59:39,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1929615467, now seen corresponding path program 1 times [2024-04-05 18:59:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797158072] [2024-04-05 18:59:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797158072] [2024-04-05 18:59:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797158072] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:40,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 18:59:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052847147] [2024-04-05 18:59:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:40,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 18:59:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:40,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 18:59:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 18:59:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,584 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:40,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-04-05 18:59:40,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:40,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-05 18:59:40,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 18:59:40,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 18:59:40,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 540436402, now seen corresponding path program 1 times [2024-04-05 18:59:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363284233] [2024-04-05 18:59:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 18:59:40,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 18:59:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 18:59:40,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 18:59:40,850 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 18:59:40,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-04-05 18:59:40,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-04-05 18:59:40,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-04-05 18:59:40,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 18:59:40,855 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 18:59:40,857 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 18:59:40,857 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 18:59:40,873 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 18:59:40,875 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 18:59:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 18:59:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:40,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 18:59:40,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 18:59:40,924 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 18:59:40,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:40,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 18:59:40,925 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;@47d4dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 18:59:40,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 18:59:40,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:40,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1856933464, now seen corresponding path program 1 times [2024-04-05 18:59:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214427651] [2024-04-05 18:59:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214427651] [2024-04-05 18:59:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214427651] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 18:59:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738481094] [2024-04-05 18:59:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 18:59:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 18:59:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 18:59:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,947 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:40,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-04-05 18:59:40,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:40,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 18:59:40,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:40,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442431, now seen corresponding path program 1 times [2024-04-05 18:59:40,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240120380] [2024-04-05 18:59:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 18:59:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240120380] [2024-04-05 18:59:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240120380] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 18:59:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352976505] [2024-04-05 18:59:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:41,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 18:59:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 18:59:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 18:59:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:41,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-04-05 18:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 18:59:41,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:41,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 715489871, now seen corresponding path program 1 times [2024-04-05 18:59:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844456629] [2024-04-05 18:59:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:41,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844456629] [2024-04-05 18:59:41,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844456629] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 18:59:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924634675] [2024-04-05 18:59:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:41,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 18:59:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 18:59:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 18:59:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:41,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-04-05 18:59:41,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:41,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:41,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 18:59:41,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:41,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -232196713, now seen corresponding path program 1 times [2024-04-05 18:59:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430612242] [2024-04-05 18:59:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:42,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430612242] [2024-04-05 18:59:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430612242] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:59:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983892466] [2024-04-05 18:59:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:42,262 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-04-05 18:59:42,290 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-04-05 18:59:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:42,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2024-04-05 18:59:42,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:59:42,481 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 18:59:42,482 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-04-05 18:59:42,538 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-04-05 18:59:42,609 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 18:59:42,609 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-04-05 18:59:42,748 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 18:59:42,751 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 16 treesize of output 11 [2024-04-05 18:59:42,825 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-04-05 18:59:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:42,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:59:42,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_120) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 18:59:43,453 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 180 treesize of output 168 [2024-04-05 18:59:43,460 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 17 treesize of output 15 [2024-04-05 18:59:43,464 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 28 treesize of output 24 [2024-04-05 18:59:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-05 18:59:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983892466] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:59:43,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:59:43,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2024-04-05 18:59:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937078098] [2024-04-05 18:59:43,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:59:43,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 18:59:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 18:59:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=845, Unknown=11, NotChecked=60, Total=1056 [2024-04-05 18:59:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:43,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:43,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 states have internal predecessors, (136), 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-04-05 18:59:43,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:43,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:43,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:43,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 18:59:44,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 18:59:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:44,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:44,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1951612766, now seen corresponding path program 1 times [2024-04-05 18:59:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:44,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153713794] [2024-04-05 18:59:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153713794] [2024-04-05 18:59:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153713794] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:59:44,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695362326] [2024-04-05 18:59:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:44,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:44,938 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-04-05 18:59:44,965 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-04-05 18:59:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:45,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 18:59:45,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:59:45,049 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 18:59:45,049 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 19 treesize of output 16 [2024-04-05 18:59:45,087 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 18:59:45,087 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 19 treesize of output 16 [2024-04-05 18:59:45,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-04-05 18:59:45,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 18:59:45,182 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 11 treesize of output 11 [2024-04-05 18:59:45,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 18:59:45,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:59:45,335 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-05 18:59:45,337 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 18 treesize of output 13 [2024-04-05 18:59:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 18:59:45,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:59:45,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:59:45,624 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 18:59:45,628 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 53 treesize of output 37 [2024-04-05 18:59:45,637 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 17 treesize of output 15 [2024-04-05 18:59:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 18:59:45,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695362326] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:59:45,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:59:45,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 18:59:45,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083422165] [2024-04-05 18:59:45,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:59:45,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 18:59:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:45,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 18:59:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=737, Unknown=5, NotChecked=0, Total=870 [2024-04-05 18:59:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:45,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:45,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 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-04-05 18:59:45,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:45,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:45,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:45,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 18:59:45,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 18:59:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 18:59:46,209 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-04-05 18:59:46,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:46,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 18:59:46,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1062705217, now seen corresponding path program 1 times [2024-04-05 18:59:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596334485] [2024-04-05 18:59:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 18:59:46,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 18:59:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 18:59:46,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 18:59:46,468 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 18:59:46,468 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-05 18:59:46,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-05 18:59:46,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-05 18:59:46,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-05 18:59:46,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 18:59:46,471 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-05 18:59:46,471 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 18:59:46,471 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 18:59:46,501 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 18:59:46,505 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 18:59:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 18:59:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:46,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 18:59:46,512 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 18:59:46,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:46,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 18:59:46,513 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;@47d4dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 18:59:46,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 18:59:46,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 18:59:46,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash -42688683, now seen corresponding path program 1 times [2024-04-05 18:59:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64253283] [2024-04-05 18:59:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64253283] [2024-04-05 18:59:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64253283] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:46,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 18:59:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657619788] [2024-04-05 18:59:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:46,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 18:59:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:46,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 18:59:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 18:59:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:46,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-04-05 18:59:46,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 18:59:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 18:59:46,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 18:59:46,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash 417728457, now seen corresponding path program 1 times [2024-04-05 18:59:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:46,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234730593] [2024-04-05 18:59:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 18:59:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234730593] [2024-04-05 18:59:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234730593] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:46,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 18:59:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077412278] [2024-04-05 18:59:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:46,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 18:59:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 18:59:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 18:59:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:46,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-05 18:59:46,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:46,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 18:59:46,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 18:59:46,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1782599532, now seen corresponding path program 1 times [2024-04-05 18:59:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942583561] [2024-04-05 18:59:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942583561] [2024-04-05 18:59:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942583561] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:59:47,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:59:47,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 18:59:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819575431] [2024-04-05 18:59:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:59:47,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 18:59:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 18:59:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 18:59:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:47,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-04-05 18:59:47,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:47,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 18:59:47,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 18:59:47,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 18:59:47,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash -267004783, now seen corresponding path program 1 times [2024-04-05 18:59:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103496925] [2024-04-05 18:59:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 18:59:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103496925] [2024-04-05 18:59:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103496925] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:59:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354640758] [2024-04-05 18:59:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:47,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:47,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 18:59:47,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-05 18:59:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:47,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 18:59:47,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:59:47,968 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 18:59:47,969 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-04-05 18:59:48,017 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-04-05 18:59:48,062 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 18:59:48,062 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-04-05 18:59:48,188 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 35 treesize of output 18 [2024-04-05 18:59:48,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 18:59:48,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 18:59:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 18:59:48,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:59:49,323 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 18:59:49,324 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 18:59:49,331 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 18:59:49,331 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 42 treesize of output 30 [2024-04-05 18:59:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 8 refuted. 9 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 18:59:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354640758] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:59:49,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:59:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2024-04-05 18:59:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313438844] [2024-04-05 18:59:49,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:59:49,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 18:59:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:59:49,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 18:59:49,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=876, Unknown=16, NotChecked=0, Total=1056 [2024-04-05 18:59:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:49,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:59:49,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.363636363636363) internal successors, (177), 33 states have internal predecessors, (177), 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-04-05 18:59:49,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:49,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:49,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:49,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:59:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:59:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:59:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 18:59:49,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-04-05 18:59:50,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-04-05 18:59:50,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 18:59:50,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:59:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -737606014, now seen corresponding path program 1 times [2024-04-05 18:59:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:59:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587940181] [2024-04-05 18:59:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:59:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:59:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587940181] [2024-04-05 18:59:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587940181] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:59:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331453305] [2024-04-05 18:59:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:59:50,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:50,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:59:50,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 18:59:50,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-05 18:59:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:59:50,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2024-04-05 18:59:50,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:59:50,893 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 18:59:50,893 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-04-05 18:59:50,944 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-04-05 18:59:50,993 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 18:59:50,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 18:59:51,133 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 35 treesize of output 18 [2024-04-05 18:59:51,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 18:59:51,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 18:59:51,485 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 18:59:51,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2024-04-05 18:59:51,646 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 18:59:51,658 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 18:59:51,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2024-04-05 18:59:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 18:59:51,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:59:52,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_347 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_9 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_347))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_346) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_20|) 0)))) is different from false [2024-04-05 18:59:58,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_347 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_346) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse4 |c_~#value~0.offset| (+ 1 (select .cse4 |c_~#value~0.offset|))))))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_347) |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_347) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2024-04-05 19:00:12,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:00:12,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:00:12,084 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 934 treesize of output 880 [2024-04-05 19:00:12,098 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 86 treesize of output 78 [2024-04-05 19:00:12,105 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 164 treesize of output 152 [2024-04-05 19:00:12,123 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 115 treesize of output 113 [2024-04-05 19:00:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 0 trivial. 2 not checked. [2024-04-05 19:00:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331453305] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:00:13,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:00:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-05 19:00:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746404173] [2024-04-05 19:00:13,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:00:13,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-05 19:00:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-05 19:00:13,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1506, Unknown=25, NotChecked=166, Total=1980 [2024-04-05 19:00:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:13,314 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:13,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.3636363636363638) internal successors, (148), 45 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 19:00:13,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:13,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:13,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:13,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 19:00:13,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:00:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:00:14,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-05 19:00:14,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-04-05 19:00:14,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:00:14,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -928964791, now seen corresponding path program 1 times [2024-04-05 19:00:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988349501] [2024-04-05 19:00:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988349501] [2024-04-05 19:00:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988349501] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:00:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151557897] [2024-04-05 19:00:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:15,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:15,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:00:15,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:00:15,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-05 19:00:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:15,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-04-05 19:00:15,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:00:15,878 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:00:15,879 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 19 treesize of output 16 [2024-04-05 19:00:15,938 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-04-05 19:00:15,982 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:00:15,982 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 11 treesize of output 11 [2024-04-05 19:00:16,110 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 35 treesize of output 18 [2024-04-05 19:00:16,291 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 19:00:16,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2024-04-05 19:00:16,501 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:00:16,501 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:00:16,710 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:00:16,710 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 19:00:16,786 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 23 treesize of output 11 [2024-04-05 19:00:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:16,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:00:16,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:00:18,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse0) |thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| .cse0) |thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse3 4294967296) 4294967295)))))) is different from false [2024-04-05 19:00:18,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse3 4294967296) 4294967295))))))) is different from false [2024-04-05 19:00:19,834 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-04-05 19:00:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 21795 treesize of output 17244 [2024-04-05 19:00:19,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:00:19,869 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1095 treesize of output 1071 [2024-04-05 19:00:19,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:00:19,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3186 treesize of output 3104 [2024-04-05 19:00:19,958 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 556 treesize of output 552 [2024-04-05 19:00:19,973 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 28 treesize of output 24 [2024-04-05 19:00:19,993 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 6 treesize of output 4 [2024-04-05 19:00:20,287 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 6 treesize of output 4 [2024-04-05 19:00:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-04-05 19:00:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151557897] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:00:20,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:00:20,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2024-04-05 19:00:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359784035] [2024-04-05 19:00:20,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:00:20,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 19:00:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 19:00:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2009, Unknown=62, NotChecked=288, Total=2652 [2024-04-05 19:00:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:20,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:20,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.019230769230769) internal successors, (209), 52 states have internal predecessors, (209), 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-04-05 19:00:20,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:20,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:20,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:20,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:00:20,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:00:20,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:00:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 19:00:22,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-04-05 19:00:22,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:22,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:00:22,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1454667501, now seen corresponding path program 1 times [2024-04-05 19:00:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:22,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045469975] [2024-04-05 19:00:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 19:00:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045469975] [2024-04-05 19:00:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045469975] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:00:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178793474] [2024-04-05 19:00:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:00:23,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:00:23,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-04-05 19:00:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:23,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 19:00:23,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:00:23,231 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:00:23,232 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-04-05 19:00:23,316 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:00:23,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:00:23,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:00:23,500 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:00:23,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:00:23,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:00:23,720 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:00:23,721 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-04-05 19:00:23,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 19:00:23,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:00:23,857 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-05 19:00:23,860 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 18 treesize of output 13 [2024-04-05 19:00:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:00:23,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:00:24,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:00:24,139 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 19:00:24,141 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 53 treesize of output 37 [2024-04-05 19:00:24,175 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 17 treesize of output 15 [2024-04-05 19:00:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:00:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178793474] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:00:24,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:00:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2024-04-05 19:00:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464131280] [2024-04-05 19:00:24,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:00:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 19:00:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 19:00:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=834, Unknown=4, NotChecked=0, Total=992 [2024-04-05 19:00:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:24,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:24,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 6.225806451612903) internal successors, (193), 32 states have internal predecessors, (193), 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-04-05 19:00:24,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 19:00:24,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:00:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 19:00:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 19:00:25,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-04-05 19:00:25,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-04-05 19:00:25,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:00:25,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1094034385, now seen corresponding path program 1 times [2024-04-05 19:00:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006586027] [2024-04-05 19:00:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:00:25,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:00:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:00:25,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:00:25,275 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:00:25,275 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 19:00:25,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 19:00:25,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 19:00:25,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 19:00:25,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 19:00:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-05 19:00:25,277 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 19:00:25,278 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:00:25,278 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 19:00:25,298 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 19:00:25,302 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:00:25,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:00:25,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:00:25,303 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:00:25,310 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:00:25,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:00:25,310 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;@47d4dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:00:25,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-05 19:00:25,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-04-05 19:00:25,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:00:25,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1788341269, now seen corresponding path program 1 times [2024-04-05 19:00:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865338017] [2024-04-05 19:00:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865338017] [2024-04-05 19:00:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865338017] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:00:25,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:00:25,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:00:25,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897688284] [2024-04-05 19:00:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:00:25,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:00:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:00:25,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:00:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:25,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-04-05 19:00:25,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-05 19:00:25,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:00:25,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash -423966927, now seen corresponding path program 1 times [2024-04-05 19:00:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034867078] [2024-04-05 19:00:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 19:00:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:25,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034867078] [2024-04-05 19:00:25,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034867078] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:00:25,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:00:25,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:00:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037781794] [2024-04-05 19:00:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:00:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:00:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:00:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:00:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:25,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-04-05 19:00:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 19:00:25,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-05 19:00:25,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:00:25,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1513268162, now seen corresponding path program 1 times [2024-04-05 19:00:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:25,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854347315] [2024-04-05 19:00:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854347315] [2024-04-05 19:00:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854347315] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:00:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:00:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 19:00:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961796805] [2024-04-05 19:00:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:00:25,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 19:00:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 19:00:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 19:00:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:25,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-04-05 19:00:25,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 19:00:25,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:25,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-05 19:00:25,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:00:25,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847127, now seen corresponding path program 1 times [2024-04-05 19:00:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468030322] [2024-04-05 19:00:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 19:00:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468030322] [2024-04-05 19:00:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468030322] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:00:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798179501] [2024-04-05 19:00:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:00:26,370 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:00:26,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-04-05 19:00:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:26,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 19:00:26,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:00:26,549 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:00:26,550 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 11 treesize of output 11 [2024-04-05 19:00:26,582 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-04-05 19:00:26,728 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 19:00:26,728 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 19:00:26,840 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:00:26,840 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:00:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 19:00:26,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:00:26,960 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_645) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:00:30,855 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 19:00:30,855 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 19:00:30,860 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 19:00:30,861 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 42 treesize of output 30 [2024-04-05 19:00:30,863 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 7 treesize of output 5 [2024-04-05 19:00:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 4 not checked. [2024-04-05 19:00:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798179501] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:00:30,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:00:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 19:00:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914101574] [2024-04-05 19:00:30,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:00:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 19:00:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:00:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 19:00:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=784, Unknown=20, NotChecked=58, Total=992 [2024-04-05 19:00:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:30,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:00:30,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 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-04-05 19:00:30,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:30,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:30,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:30,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:00:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:00:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:00:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:00:31,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-04-05 19:00:31,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:31,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:00:31,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:00:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -222757182, now seen corresponding path program 1 times [2024-04-05 19:00:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:00:31,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379572164] [2024-04-05 19:00:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:00:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:32,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:00:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379572164] [2024-04-05 19:00:32,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379572164] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:00:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240792067] [2024-04-05 19:00:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:00:32,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:00:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:00:32,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:00:32,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-04-05 19:00:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:00:32,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2024-04-05 19:00:32,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:00:32,467 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:00:32,467 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-04-05 19:00:32,520 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-04-05 19:00:32,580 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:00:32,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:00:32,731 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 35 treesize of output 18 [2024-04-05 19:00:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:00:32,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 19:00:33,110 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:00:33,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2024-04-05 19:00:33,256 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 19:00:33,267 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 19:00:33,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2024-04-05 19:00:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:00:33,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:00:55,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:00:55,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:00:55,864 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 934 treesize of output 880 [2024-04-05 19:00:55,875 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 86 treesize of output 78 [2024-04-05 19:00:55,882 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 164 treesize of output 152 [2024-04-05 19:00:55,898 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 115 treesize of output 113 [2024-04-05 19:01:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:01:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240792067] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:01:00,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:01:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-05 19:01:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518190536] [2024-04-05 19:01:00,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:01:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-05 19:01:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:01:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-05 19:01:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1646, Unknown=39, NotChecked=0, Total=1980 [2024-04-05 19:01:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:00,764 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:01:00,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.3636363636363638) internal successors, (148), 45 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 19:01:00,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:00,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:00,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:00,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:01:00,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:01:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:01:02,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-04-05 19:01:02,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-04-05 19:01:02,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:01:02,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:01:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash -759787727, now seen corresponding path program 1 times [2024-04-05 19:01:02,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:01:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232047628] [2024-04-05 19:01:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:01:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:01:03,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:01:03,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232047628] [2024-04-05 19:01:03,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232047628] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:01:03,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255373728] [2024-04-05 19:01:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:03,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:01:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:01:03,136 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:01:03,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-04-05 19:01:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:03,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-05 19:01:03,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:01:03,407 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:01:03,407 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-04-05 19:01:03,471 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-04-05 19:01:03,530 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:01:03,530 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-04-05 19:01:03,673 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 35 treesize of output 18 [2024-04-05 19:01:03,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 19:01:04,277 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 19:01:04,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 19:01:04,483 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 19:01:04,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 19:01:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:01:04,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:01:04,930 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_792 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_793 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2024-04-05 19:01:05,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (or (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 19:01:05,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (or (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 19:01:05,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (or (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) .cse5))) (and (or (not .cse0) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (or (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (= 4294967295 .cse5))) is different from false [2024-04-05 19:01:05,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)))))))) is different from false [2024-04-05 19:01:06,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse7 |c_~#value~0.offset| (+ 1 (select .cse7 |c_~#value~0.offset|))))))) (let ((.cse5 (store (select .cse6 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base| .cse3) |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 19:01:08,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:01:08,890 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 19:01:08,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 32359 treesize of output 31761 [2024-04-05 19:01:09,069 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 19:01:09,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1228 treesize of output 1166 [2024-04-05 19:01:09,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:01:09,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:01:09,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:01:09,129 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 127 treesize of output 137 [2024-04-05 19:01:09,175 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 244 treesize of output 240 [2024-04-05 19:01:09,191 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 50 treesize of output 46 [2024-04-05 19:01:09,209 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 295 treesize of output 279 [2024-04-05 19:01:09,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:01:09,249 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 19:01:09,272 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 6 treesize of output 4 [2024-04-05 19:01:09,325 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 6 treesize of output 4 [2024-04-05 19:01:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 8 refuted. 5 times theorem prover too weak. 0 trivial. 26 not checked. [2024-04-05 19:01:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255373728] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:01:09,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:01:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 22] total 55 [2024-04-05 19:01:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272219665] [2024-04-05 19:01:09,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:01:09,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-04-05 19:01:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:01:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-04-05 19:01:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1976, Unknown=34, NotChecked=594, Total=2970 [2024-04-05 19:01:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:09,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:01:09,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.345454545454546) internal successors, (239), 55 states have internal predecessors, (239), 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-04-05 19:01:09,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:09,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:09,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:09,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:01:09,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:01:09,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:01:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:01:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 19:01:12,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-04-05 19:01:13,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-04-05 19:01:13,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:01:13,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:01:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1161605635, now seen corresponding path program 1 times [2024-04-05 19:01:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:01:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210862114] [2024-04-05 19:01:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:01:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 19:01:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:01:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210862114] [2024-04-05 19:01:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210862114] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:01:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512484946] [2024-04-05 19:01:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:01:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:01:13,731 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:01:13,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-04-05 19:01:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:13,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 19:01:13,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:01:13,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:01:13,894 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-04-05 19:01:14,005 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:01:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:01:14,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:01:14,267 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:01:14,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:01:14,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:01:14,485 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:01:14,485 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-04-05 19:01:14,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 19:01:14,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 19:01:14,622 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 33 treesize of output 16 [2024-04-05 19:01:14,624 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 0 case distinctions, treesize of input 16 treesize of output 13 [2024-04-05 19:01:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:01:14,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:01:14,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:01:14,939 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 19:01:14,942 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 53 treesize of output 37 [2024-04-05 19:01:14,948 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 14 treesize of output 12 [2024-04-05 19:01:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:01:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512484946] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:01:15,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:01:15,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-04-05 19:01:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092654204] [2024-04-05 19:01:15,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:01:15,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-05 19:01:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:01:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-05 19:01:15,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1017, Unknown=4, NotChecked=0, Total=1190 [2024-04-05 19:01:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:15,260 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:01:15,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.676470588235294) internal successors, (193), 35 states have internal predecessors, (193), 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-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 19:01:15,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-05 19:01:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:01:16,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-04-05 19:01:16,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-04-05 19:01:16,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:01:16,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:01:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -371588503, now seen corresponding path program 1 times [2024-04-05 19:01:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:01:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717219929] [2024-04-05 19:01:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:01:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:01:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:01:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717219929] [2024-04-05 19:01:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717219929] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:01:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107693228] [2024-04-05 19:01:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:01:18,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:01:18,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:01:18,081 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:01:18,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-04-05 19:01:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:01:18,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 19:01:18,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:01:18,337 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:01:18,337 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-04-05 19:01:18,416 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-04-05 19:01:18,474 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:01:18,474 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-04-05 19:01:18,656 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 35 treesize of output 18 [2024-04-05 19:01:18,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 19:01:19,249 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 19:01:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 19:01:19,576 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 19:01:19,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 35 [2024-04-05 19:01:20,031 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 19:01:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 19:01:20,293 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 19:01:20,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 19:01:20,428 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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-05 19:01:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:01:20,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:01:20,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_973 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:01:34,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (= (mod (select .cse12 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse5 (+ .cse0 1))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse1 (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))))) (store .cse1 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse4 4294967296) .cse5)))))) .cse6) (or (not .cse6) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (let ((.cse9 (store (select .cse11 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse11 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base|))) (let ((.cse7 (select .cse10 |c_~#value~0.offset|))) (or (< (mod .cse7 4294967296) .cse5) (< (mod (select (select (store (let ((.cse8 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse7 1))))) (store .cse8 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse8 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))))) is different from false [2024-04-05 19:01:50,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_961 (Array Int Int)) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse11 |c_~#value~0.offset| (+ 1 (select .cse11 |c_~#value~0.offset|))))))) (let ((.cse9 (store (select .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store (store .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961) |c_~#value~0.base|)) (.cse0 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961)) (.cse6 (select .cse8 |c_~#value~0.offset|))) (let ((.cse7 (store .cse3 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))))) (let ((.cse1 (store (select .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse5 4294967296) (+ (mod .cse6 4294967296) 1)))))))))))) is different from false [2024-04-05 19:01:52,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:02:22,177 WARN L293 SmtUtils]: Spent 29.45s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 19:02:22,177 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 19:02:22,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 29191741 treesize of output 27393504 [2024-04-05 19:02:22,962 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 19:02:22,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13163 treesize of output 12191 [2024-04-05 19:02:23,143 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 498 treesize of output 418 [2024-04-05 19:02:23,207 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 538 treesize of output 474 [2024-04-05 19:02:23,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:02:23,350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 19:02:23,379 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 6 treesize of output 4 [2024-04-05 19:02:52,639 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 6 treesize of output 4 [2024-04-05 19:02:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-04-05 19:02:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107693228] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:02:52,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:02:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2024-04-05 19:02:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183720279] [2024-04-05 19:02:52,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:02:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-05 19:02:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:02:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-05 19:02:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=3825, Unknown=113, NotChecked=396, Total=4830 [2024-04-05 19:02:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:02:52,933 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:02:52,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.9714285714285715) internal successors, (278), 70 states have internal predecessors, (278), 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-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:02:52,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:02:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 19:02:59,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-04-05 19:02:59,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:02:59,822 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:02:59,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:02:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash -325667869, now seen corresponding path program 1 times [2024-04-05 19:02:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:02:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916842593] [2024-04-05 19:02:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:02:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:02:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:03:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:03:00,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:03:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916842593] [2024-04-05 19:03:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916842593] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:03:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161350802] [2024-04-05 19:03:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:03:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:03:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:03:00,613 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:03:00,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-04-05 19:03:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:03:00,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2024-04-05 19:03:00,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:03:00,897 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:03:00,897 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-04-05 19:03:00,966 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-04-05 19:03:01,039 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:03:01,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:03:01,192 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 35 treesize of output 18 [2024-04-05 19:03:01,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:03:01,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 19:03:01,558 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:03:01,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:03:01,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 19:03:01,876 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 19:03:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:03:02,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:03:02,075 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-04-05 19:03:02,128 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-04-05 19:03:02,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2024-04-05 19:03:02,301 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:03:02,302 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:03:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:03:02,462 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 19:03:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 25 [2024-04-05 19:03:02,588 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-04-05 19:03:02,588 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 37 treesize of output 45 [2024-04-05 19:03:02,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:03:02,656 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 11 treesize of output 11 [2024-04-05 19:03:02,757 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 19:03:02,759 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-04-05 19:03:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:03:02,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:03:02,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread4of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse1) (or (forall ((v_DerPreprocessor_30 (Array Int Int))) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread4of4ForFork0_~vn~0#1|)) |c_thr1Thread4of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse1))))) is different from false [2024-04-05 19:03:10,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (select .cse10 |c_~#value~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse4))) |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (let ((.cse9 (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse9 |c_~#value~0.offset|))) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_33)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (< (mod (select (select (store .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (not (= (select (store (store |c_#valid| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse6 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse5 4294967296) (mod (select (select (store (store (store (store .cse6 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))) is different from false [2024-04-05 19:03:15,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse8 |c_~#value~0.base|))) (let ((.cse10 (select .cse12 |c_~#value~0.offset|))) (let ((.cse9 (store .cse12 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse7 (select .cse11 |c_~#value~0.offset|))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse5 (store .cse11 |c_~#value~0.offset| (+ .cse7 1)))) (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse5))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse3 (store (select .cse6 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse4 (select (store (store (store .cse2 |c_~#value~0.base| .cse5) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (< (mod .cse1 4294967296) (mod (select (select (store (store (store (store .cse2 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ .cse1 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse6 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse7 4294967296) 1)) (< (mod (select (select (store (store .cse8 |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1))))))))))))) is different from false [2024-04-05 19:03:16,605 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse30 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse14 (select .cse9 |c_~#value~0.base|))) (let ((.cse11 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (store .cse14 |c_~#value~0.offset| (+ .cse11 1)))) (let ((.cse12 (select (store (store (store .cse13 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (let ((.cse3 (store .cse13 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse6 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse6))) (let ((.cse1 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse4 (store (select .cse7 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse5 (select (store (store (store .cse3 |c_~#value~0.base| .cse6) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse2 (select .cse5 |c_~#value~0.offset|))) (< (mod .cse2 4294967296) (mod (select (select (store (store (store (store .cse3 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse2 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse7 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)) (< (mod (select (select (store (store .cse9 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse11 4294967296) 1))))))))))))))) (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (let ((.cse28 (store (select .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse27 (select (store (store .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse18 (select .cse27 |c_~#value~0.offset|))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28)) (.cse17 (store .cse27 |c_~#value~0.offset| (+ .cse18 1)))) (let ((.cse26 (select (store (store (store .cse16 |c_~#value~0.base| .cse17) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse21 (select .cse26 |c_~#value~0.offset|))) (let ((.cse23 (store .cse16 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse25 (store .cse26 |c_~#value~0.offset| (+ .cse21 1)))) (let ((.cse19 (store (store .cse23 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse25))) (let ((.cse15 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse20 (store (select .cse19 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse17) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse18 4294967296) 1)) (not (= (select .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse19 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse20) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse21 4294967296) 1)) (let ((.cse24 (select (store (store (store .cse23 |c_~#value~0.base| .cse25) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse22 (select .cse24 |c_~#value~0.offset|))) (< (mod .cse22 4294967296) (mod (select (select (store (store (store (store .cse23 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| (+ .cse22 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) (not .cse0))))) is different from false [2024-04-05 19:03:16,726 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse30 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse14 (select .cse9 |c_~#value~0.base|))) (let ((.cse11 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (store .cse14 |c_~#value~0.offset| (+ .cse11 1)))) (let ((.cse12 (select (store (store (store .cse13 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (let ((.cse3 (store .cse13 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse6 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse6))) (let ((.cse1 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse4 (store (select .cse7 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse5 (select (store (store (store .cse3 |c_~#value~0.base| .cse6) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse2 (select .cse5 |c_~#value~0.offset|))) (< (mod .cse2 4294967296) (mod (select (select (store (store (store (store .cse3 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse2 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse7 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)) (< (mod (select (select (store (store .cse9 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse11 4294967296) 1))))))))))))))) (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (let ((.cse28 (store (select .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse27 (select (store (store .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse23 (select .cse27 |c_~#value~0.offset|))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28)) (.cse22 (store .cse27 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse26 (select (store (store (store .cse21 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse25 (select .cse26 |c_~#value~0.offset|))) (let ((.cse17 (store .cse21 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse20 (store .cse26 |c_~#value~0.offset| (+ .cse25 1)))) (let ((.cse24 (store (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse20))) (let ((.cse15 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse18 (store (select .cse24 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse19 (select (store (store (store .cse17 |c_~#value~0.base| .cse20) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse16 (select .cse19 |c_~#value~0.offset|))) (< (mod .cse16 4294967296) (mod (select (select (store (store (store (store .cse17 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| (+ .cse16 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (< (mod (select (select (store .cse24 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse18) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse25 4294967296) 1)))))))))))))) (not .cse0))))) is different from false [2024-04-05 19:03:16,890 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse15 |c_~#value~0.offset| (+ 1 (select .cse15 |c_~#value~0.offset|))))))) (let ((.cse13 (store (select .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store (store .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse6 (select .cse12 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse5 (store .cse12 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse11 (select (store (store (store .cse4 |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse3 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse4 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse10))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse2 (store (select .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (< (mod (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (let ((.cse9 (select (store (store (store .cse8 |c_~#value~0.base| .cse10) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse7 (select .cse9 |c_~#value~0.offset|))) (< (mod .cse7 4294967296) (mod (select (select (store (store (store (store .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) is different from false [2024-04-05 19:03:32,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:04:27,269 WARN L293 SmtUtils]: Spent 53.63s on a formula simplification. DAG size of input: 42 DAG size of output: 32 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 19:04:27,269 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 19:04:27,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1366384 treesize of output 1317793 [2024-04-05 19:04:27,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:04:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6743 treesize of output 6747 [2024-04-05 19:04:28,130 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 2632 treesize of output 2556 [2024-04-05 19:04:28,200 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 5948 treesize of output 5718 [2024-04-05 19:04:28,375 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 2346 treesize of output 2322 [2024-04-05 19:04:28,467 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 152 treesize of output 140 [2024-04-05 19:04:28,563 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 3426 treesize of output 3106 [2024-04-05 19:04:28,806 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 4113 treesize of output 4111 [2024-04-05 19:04:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 23 times theorem prover too weak. 0 trivial. 10 not checked. [2024-04-05 19:04:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161350802] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:04:37,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:04:37,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 30] total 70 [2024-04-05 19:04:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450059718] [2024-04-05 19:04:37,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:04:37,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-04-05 19:04:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-04-05 19:04:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=3525, Unknown=119, NotChecked=786, Total=4970 [2024-04-05 19:04:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:37,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:37,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.9857142857142858) internal successors, (279), 71 states have internal predecessors, (279), 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-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 19:04:37,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 19:04:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 19:04:47,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-04-05 19:04:47,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-04-05 19:04:47,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:04:47,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -491038927, now seen corresponding path program 1 times [2024-04-05 19:04:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198835331] [2024-04-05 19:04:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:04:47,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:04:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:04:47,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:04:47,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:04:47,946 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-05 19:04:47,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-05 19:04:47,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-05 19:04:47,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-05 19:04:47,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-05 19:04:47,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-05 19:04:47,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-04-05 19:04:47,948 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 19:04:47,948 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:04:47,948 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 19:04:47,974 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 19:04:47,976 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:04:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:04:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:04:47,993 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:04:48,059 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:04:48,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:48,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:04:48,060 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;@47d4dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:04:48,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 19:04:48,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-04-05 19:04:48,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:48,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1616899814, now seen corresponding path program 1 times [2024-04-05 19:04:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622522366] [2024-04-05 19:04:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:04:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:48,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622522366] [2024-04-05 19:04:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622522366] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:04:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:04:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:04:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616317855] [2024-04-05 19:04:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:04:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:04:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:04:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:04:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:48,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-04-05 19:04:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-04-05 19:04:48,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:48,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -970814200, now seen corresponding path program 1 times [2024-04-05 19:04:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198960079] [2024-04-05 19:04:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-04-05 19:04:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198960079] [2024-04-05 19:04:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198960079] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:04:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:04:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:04:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539072518] [2024-04-05 19:04:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:04:48,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:04:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:04:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:04:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-04-05 19:04:48,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 19:04:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-04-05 19:04:48,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:48,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1108440751, now seen corresponding path program 1 times [2024-04-05 19:04:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:48,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854920] [2024-04-05 19:04:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:04:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854920] [2024-04-05 19:04:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854920] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:04:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:04:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 19:04:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275862820] [2024-04-05 19:04:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:04:48,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 19:04:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 19:04:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 19:04:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:48,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-04-05 19:04:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 19:04:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:49,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-04-05 19:04:49,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:49,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1386114128, now seen corresponding path program 1 times [2024-04-05 19:04:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57277735] [2024-04-05 19:04:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 19:04:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57277735] [2024-04-05 19:04:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57277735] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:04:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656677521] [2024-04-05 19:04:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:04:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:04:49,477 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:04:49,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-04-05 19:04:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:49,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 19:04:49,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:04:49,742 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:04:49,743 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 11 treesize of output 11 [2024-04-05 19:04:49,794 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-04-05 19:04:49,983 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 19:04:49,983 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 19:04:50,127 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:04:50,127 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:04:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 19:04:50,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:04:50,298 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1262) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:04:54,534 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 19:04:54,534 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 19:04:54,539 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 19:04:54,539 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 42 treesize of output 30 [2024-04-05 19:04:54,540 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 7 treesize of output 5 [2024-04-05 19:04:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 4 not checked. [2024-04-05 19:04:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656677521] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:04:54,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:04:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 19:04:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958309626] [2024-04-05 19:04:54,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:04:54,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 19:04:54,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 19:04:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=793, Unknown=11, NotChecked=58, Total=992 [2024-04-05 19:04:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:54,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:54,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.46875) internal successors, (175), 32 states have internal predecessors, (175), 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-04-05 19:04:54,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:54,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:54,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:54,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 19:04:55,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-04-05 19:04:55,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-04-05 19:04:55,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:55,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -755467422, now seen corresponding path program 1 times [2024-04-05 19:04:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071958885] [2024-04-05 19:04:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:04:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071958885] [2024-04-05 19:04:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071958885] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:04:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543821299] [2024-04-05 19:04:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:56,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:04:56,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:04:56,220 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:04:56,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-04-05 19:04:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:56,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 19:04:56,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:04:56,414 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:04:56,414 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 19 treesize of output 16 [2024-04-05 19:04:56,457 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:04:56,458 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-04-05 19:04:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-04-05 19:04:56,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:04:56,614 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 11 treesize of output 11 [2024-04-05 19:04:56,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 19:04:56,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 19:04:56,787 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 33 treesize of output 16 [2024-04-05 19:04:56,789 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 0 case distinctions, treesize of input 16 treesize of output 13 [2024-04-05 19:04:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:04:56,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:04:57,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:04:57,254 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 19:04:57,255 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 53 treesize of output 37 [2024-04-05 19:04:57,262 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 14 treesize of output 12 [2024-04-05 19:04:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:04:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543821299] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:04:57,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:04:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 19:04:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915046657] [2024-04-05 19:04:57,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:04:57,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 19:04:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:04:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 19:04:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=741, Unknown=3, NotChecked=0, Total=870 [2024-04-05 19:04:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:57,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:04:57,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 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-04-05 19:04:57,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:57,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:57,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:57,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 19:04:57,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:04:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:04:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:04:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:04:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:04:58,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-04-05 19:04:58,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:04:58,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:04:58,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:04:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 435043912, now seen corresponding path program 1 times [2024-04-05 19:04:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:04:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525786574] [2024-04-05 19:04:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:04:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 19:04:59,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:04:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525786574] [2024-04-05 19:04:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525786574] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:04:59,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767055462] [2024-04-05 19:04:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:04:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:04:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:04:59,567 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:04:59,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-04-05 19:04:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:04:59,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-05 19:04:59,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:04:59,849 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:04:59,849 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 11 treesize of output 11 [2024-04-05 19:04:59,905 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-04-05 19:05:00,102 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 19:05:00,102 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 19:05:00,290 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:05:00,291 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:05:00,536 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:05:00,536 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:05:00,767 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:05:00,767 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 19:05:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 19:05:00,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:05:01,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1412 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:05:01,258 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1412 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_1410 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2024-04-05 19:05:01,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (or (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) .cse0)))) is different from false [2024-04-05 19:05:01,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (or (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse5))) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) .cse1) (or (not .cse1) (forall ((v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (store .cse3 |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (= 4294967295 .cse5))) is different from false [2024-04-05 19:05:02,042 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (= (mod .cse0 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) is different from false [2024-04-05 19:05:03,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread1of5ForFork0_~v~0#1| 1))))) (let ((.cse5 (store (select .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (not .cse8)) (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (let ((.cse13 (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse9 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse9 1)))) (store (store .cse11 |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (= 4294967295 (mod .cse9 4294967296)) (< (mod (select (select (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) .cse8)))) is different from false [2024-04-05 19:05:03,101 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse7 |c_~#value~0.offset| (+ 1 (select .cse7 |c_~#value~0.offset|))))))) (let ((.cse5 (store (select .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store (store .cse6 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse1 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 19:05:03,772 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (v_ArrVal_1400 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1400))) (let ((.cse6 (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (store .cse8 |c_~#value~0.offset| (+ (select .cse8 |c_~#value~0.offset|) 1))))) (let ((.cse5 (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread1of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse5)) (.cse3 (store .cse4 |c_~#value~0.offset| (+ .cse1 1)))) (store (store .cse2 |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse3) |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse1 4294967296)) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))) is different from false [2024-04-05 19:05:06,251 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 19:05:06,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78370 treesize of output 75559 [2024-04-05 19:05:06,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:05:06,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 756 treesize of output 766 [2024-04-05 19:05:06,504 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 786 treesize of output 746 [2024-04-05 19:05:06,528 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 514 treesize of output 506 [2024-04-05 19:05:06,554 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 73 treesize of output 69 [2024-04-05 19:05:06,805 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 6 treesize of output 4 [2024-04-05 19:05:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 8 refuted. 1 times theorem prover too weak. 4 trivial. 54 not checked. [2024-04-05 19:05:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767055462] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:05:07,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:05:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 22] total 56 [2024-04-05 19:05:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808601512] [2024-04-05 19:05:07,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:05:07,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-04-05 19:05:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:05:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-04-05 19:05:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1883, Unknown=76, NotChecked=792, Total=3080 [2024-04-05 19:05:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:07,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:05:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.714285714285714) internal successors, (264), 56 states have internal predecessors, (264), 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-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:05:07,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:05:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:05:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:05:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:05:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 19:05:10,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-04-05 19:05:10,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-04-05 19:05:10,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:05:10,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:05:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1686100594, now seen corresponding path program 1 times [2024-04-05 19:05:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:05:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257067801] [2024-04-05 19:05:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:05:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:05:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:05:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 19:05:11,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:05:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257067801] [2024-04-05 19:05:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257067801] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:05:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397407944] [2024-04-05 19:05:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:05:11,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:05:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:05:11,525 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:05:11,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-04-05 19:05:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:05:11,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 19:05:11,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:05:11,729 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:05:11,730 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-04-05 19:05:11,849 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:05:11,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:05:12,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:05:12,130 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 19:05:12,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 19:05:12,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 19:05:12,354 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:05:12,354 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-04-05 19:05:12,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 19:05:12,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 19:05:12,507 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 33 treesize of output 16 [2024-04-05 19:05:12,509 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 0 case distinctions, treesize of input 16 treesize of output 13 [2024-04-05 19:05:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:05:12,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:05:12,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:05:12,961 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 19:05:12,963 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 53 treesize of output 37 [2024-04-05 19:05:12,973 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 14 treesize of output 12 [2024-04-05 19:05:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 19:05:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397407944] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:05:13,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:05:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-04-05 19:05:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883018137] [2024-04-05 19:05:13,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:05:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 19:05:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:05:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 19:05:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1080, Unknown=3, NotChecked=0, Total=1260 [2024-04-05 19:05:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:13,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:05:13,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.571428571428571) internal successors, (195), 36 states have internal predecessors, (195), 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-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-05 19:05:13,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 19:05:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 19:05:14,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-04-05 19:05:15,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:05:15,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:05:15,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:05:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1793026736, now seen corresponding path program 1 times [2024-04-05 19:05:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:05:15,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470312928] [2024-04-05 19:05:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:05:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:05:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:05:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:05:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:05:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470312928] [2024-04-05 19:05:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470312928] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:05:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816621187] [2024-04-05 19:05:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:05:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:05:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:05:16,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:05:16,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-04-05 19:05:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:05:16,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 19:05:16,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:05:16,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 19:05:16,894 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-04-05 19:05:16,983 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-04-05 19:05:17,049 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 19:05:17,049 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-04-05 19:05:17,273 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 35 treesize of output 18 [2024-04-05 19:05:17,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 19:05:17,961 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 19:05:17,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 19:05:18,319 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 19:05:18,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 35 [2024-04-05 19:05:18,790 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 19:05:18,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 19:05:19,081 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 19:05:19,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 19:05:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:05:19,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:05:19,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:05:19,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_47))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of5ForFork0_~vn~0#1|)))) (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 19:05:20,771 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) is different from false [2024-04-05 19:05:21,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#value~0.base|)) (.cse15 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse6 (= (mod (select .cse14 |c_~#value~0.offset|) 4294967296) .cse15)) (.cse1 (+ .cse15 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse2 (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#value~0.base|))) (store .cse5 |c_~#value~0.offset| (+ (select .cse5 |c_~#value~0.offset|) 1))))) (store (store .cse0 |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) .cse6) (or (not .cse6) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse12 (store (select .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse7 (store .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12))) (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12)) (.cse10 (let ((.cse11 (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse11 |c_~#value~0.offset| (+ (select .cse11 |c_~#value~0.offset|) 1))))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< (mod (select (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))) is different from false [2024-04-05 19:05:21,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#value~0.base|)) (.cse15 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse6 (= (mod (select .cse14 |c_~#value~0.offset|) 4294967296) .cse15)) (.cse1 (+ .cse15 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse2 (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#value~0.base|))) (store .cse5 |c_~#value~0.offset| (+ (select .cse5 |c_~#value~0.offset|) 1))))) (store (store .cse0 |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| .cse3) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) .cse6) (or (not .cse6) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse12 (store (select .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (store .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12))) (let ((.cse7 (let ((.cse9 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12)) (.cse10 (let ((.cse11 (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse11 |c_~#value~0.offset| (+ (select .cse11 |c_~#value~0.offset|) 1))))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse10) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1))))))))))) is different from false [2024-04-05 19:05:21,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= (mod (select .cse15 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse2 (+ .cse0 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse3 (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse4 (let ((.cse6 (select .cse5 |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse1 |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse5 |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) .cse7) (or (not .cse7) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse13 (store (select .cse14 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (store .cse14 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse13))) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse13)) (.cse11 (let ((.cse12 (select (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ (select .cse12 |c_~#value~0.offset|) 1))))) (store (store .cse10 |c_~#value~0.base| .cse11) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse11) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2))))))))))))) is different from false [2024-04-05 19:05:28,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ 1 (select .cse12 |c_~#value~0.offset|))))))) (let ((.cse10 (store (select .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse8))) (let ((.cse2 (store (select .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (let ((.cse4 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2)) (.cse5 (let ((.cse6 (select (store (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)))))))))))) is different from false [2024-04-05 19:05:32,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 19:06:04,451 WARN L293 SmtUtils]: Spent 27.83s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 19:06:04,452 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 19:06:04,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 413278132 treesize of output 406722891 [2024-04-05 19:06:07,641 INFO L349 Elim1Store]: treesize reduction 137, result has 35.1 percent of original size [2024-04-05 19:06:07,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 297661 treesize of output 290416 [2024-04-05 19:06:08,516 INFO L349 Elim1Store]: treesize reduction 52, result has 35.0 percent of original size [2024-04-05 19:06:08,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 12284 treesize of output 12083 [2024-04-05 19:06:09,116 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 19:06:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7063 treesize of output 7089 [2024-04-05 19:06:09,479 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 538 treesize of output 474 [2024-04-05 19:06:09,609 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 1898 treesize of output 1674 [2024-04-05 19:06:09,767 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 498 treesize of output 418 [2024-04-05 19:06:10,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:06:10,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-04-05 19:06:10,379 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 6 treesize of output 4 [2024-04-05 19:06:17,254 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 6 treesize of output 4 [2024-04-05 19:06:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 14 refuted. 17 times theorem prover too weak. 0 trivial. 36 not checked. [2024-04-05 19:06:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816621187] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:06:18,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:06:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 28] total 75 [2024-04-05 19:06:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038782900] [2024-04-05 19:06:18,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:06:18,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-04-05 19:06:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:06:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-04-05 19:06:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=3828, Unknown=121, NotChecked=966, Total=5550 [2024-04-05 19:06:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:18,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:06:18,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.1066666666666665) internal successors, (308), 75 states have internal predecessors, (308), 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-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 19:06:18,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:29,136 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse71 (select .cse70 |c_~#value~0.offset|))) (let ((.cse19 (mod .cse71 4294967296))) (let ((.cse13 (+ .cse19 1)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse70 |c_~#value~0.offset| (+ 1 .cse71))))) (and (or (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_1600 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse10 (store (select .cse11 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse8))) (let ((.cse2 (store (select .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (let ((.cse4 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2)) (.cse5 (let ((.cse6 (select (store (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1))))))))))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse18 (store (select .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (store .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse18))) (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse18)) (.cse16 (let ((.cse17 (select (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ (select .cse17 |c_~#value~0.offset|) 1))))) (store (store .cse15 |c_~#value~0.base| .cse16) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse16) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (< (mod (select (select (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) (= (select |c_#valid| 3) 1) (or (< .cse19 (+ (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296) 1)) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse20 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse21 (let ((.cse23 (select .cse22 |c_~#value~0.base|))) (store .cse23 |c_~#value~0.offset| (+ (select .cse23 |c_~#value~0.offset|) 1))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse21) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse22 |c_~#value~0.base| .cse21) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse20 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse20 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590))) (let ((.cse33 (select .cse32 |c_~#value~0.base|))) (let ((.cse26 (select .cse33 |c_~#value~0.offset|))) (let ((.cse31 (store .cse33 |c_~#value~0.offset| (+ .cse26 1)))) (let ((.cse24 (store .cse32 |c_~#value~0.base| .cse31))) (let ((.cse25 (store (select .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse27 (let ((.cse28 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25)) (.cse29 (let ((.cse30 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse31) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse30 |c_~#value~0.offset| (+ (select .cse30 |c_~#value~0.offset|) 1))))) (store (store .cse28 |c_~#value~0.base| .cse29) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse28 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse29) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse26 4294967296) 1)) (< (mod (select (select (store .cse27 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse27 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|v_ULTIMATE.start_main_~#t~0#1.base_61| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (let ((.cse46 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1585))) (let ((.cse45 (let ((.cse47 (select .cse46 |c_~#value~0.base|))) (store .cse47 |c_~#value~0.offset| (+ (select .cse47 |c_~#value~0.offset|) 1))))) (let ((.cse44 (store (select (store .cse46 |c_~#value~0.base| .cse45) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse45) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse44) |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse36 (select .cse43 |c_~#value~0.offset|))) (let ((.cse41 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse44)) (.cse42 (store .cse43 |c_~#value~0.offset| (+ .cse36 1)))) (let ((.cse34 (store (store .cse41 |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1590) |c_~#value~0.base| .cse42))) (let ((.cse35 (store (select .cse34 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse37 (let ((.cse38 (store .cse41 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35)) (.cse39 (let ((.cse40 (select (store (store (store .cse41 |c_~#value~0.base| .cse42) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35) |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse40 |c_~#value~0.offset| (+ (select .cse40 |c_~#value~0.offset|) 1))))) (store (store .cse38 |c_~#value~0.base| .cse39) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse38 |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1595) |c_~#value~0.base| .cse39) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_61|) 0)) (< (mod (select (select (store .cse34 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse36 4294967296) 1)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_61| 1) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse37 |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse37 |v_ULTIMATE.start_main_~#t~0#1.base_61| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))) (<= 0 (div |c_thr1Thread4of5ForFork0_~v~0#1| 4294967296)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1585))) (let ((.cse59 (let ((.cse61 (select .cse60 |c_~#value~0.base|))) (store .cse61 |c_~#value~0.offset| (+ (select .cse61 |c_~#value~0.offset|) 1))))) (let ((.cse58 (store (select (store .cse60 |c_~#value~0.base| .cse59) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse59) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse58) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse50 (select .cse57 |c_~#value~0.offset|))) (let ((.cse55 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse58)) (.cse56 (store .cse57 |c_~#value~0.offset| (+ .cse50 1)))) (let ((.cse48 (store (store .cse55 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse56))) (let ((.cse49 (store (select .cse48 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse51 (let ((.cse52 (store .cse55 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse49)) (.cse53 (let ((.cse54 (select (store (store (store .cse55 |c_~#value~0.base| .cse56) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse49) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse54 |c_~#value~0.offset| (+ (select .cse54 |c_~#value~0.offset|) 1))))) (store (store .cse52 |c_~#value~0.base| .cse53) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse52 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse53) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse48 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse49) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse50 4294967296) 1)) (< (mod (select (select (store .cse51 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse51 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0))))))))))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (< .cse19 4294967295) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse62 (store .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1)))) (or (< (mod (select (select (store .cse62 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse62 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (<= |c_thr1Thread4of5ForFork0_~v~0#1| 3) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse68 (store (select .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse64 (store .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse68))) (let ((.cse63 (let ((.cse65 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse68)) (.cse66 (let ((.cse67 (select (store .cse64 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse67 |c_~#value~0.offset| (+ (select .cse67 |c_~#value~0.offset|) 1))))) (store (store .cse65 |c_~#value~0.base| .cse66) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse65 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse66) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse63 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse63 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse64 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13)))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse69 (store .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))) (or (< (mod (select (select (store .cse69 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse69 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))) is different from true [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:06:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 19:06:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 19:06:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 19:06:32,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-04-05 19:06:32,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-04-05 19:06:32,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:06:32,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:06:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1163445853, now seen corresponding path program 1 times [2024-04-05 19:06:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:06:32,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108382461] [2024-04-05 19:06:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:06:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:06:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:06:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 19:06:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:06:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108382461] [2024-04-05 19:06:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108382461] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:06:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621911035] [2024-04-05 19:06:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:06:33,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:06:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:06:33,165 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:06:33,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-04-05 19:06:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:06:33,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 19:06:33,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:06:33,458 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:06:33,458 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 19 treesize of output 16 [2024-04-05 19:06:33,504 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:06:33,504 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 19 treesize of output 16 [2024-04-05 19:06:33,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-04-05 19:06:33,610 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:06:33,611 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 19 treesize of output 16 [2024-04-05 19:06:33,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-04-05 19:06:33,735 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:06:33,736 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 19 treesize of output 16 [2024-04-05 19:06:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-04-05 19:06:33,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:06:33,824 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 11 treesize of output 11 [2024-04-05 19:06:33,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 19:06:33,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 19:06:33,955 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-05 19:06:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 19:06:34,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:06:34,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:06:34,373 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 19:06:34,376 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 53 treesize of output 37 [2024-04-05 19:06:34,382 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 17 treesize of output 15 [2024-04-05 19:06:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 19:06:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621911035] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:06:34,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:06:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-04-05 19:06:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295710417] [2024-04-05 19:06:34,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:06:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-05 19:06:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:06:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-05 19:06:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2024-04-05 19:06:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:34,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:06:34,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 8.066666666666666) internal successors, (242), 31 states have internal predecessors, (242), 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-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 19:06:34,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 19:06:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-05 19:06:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 19:06:38,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-04-05 19:06:38,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-04-05 19:06:38,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:06:38,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:06:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 614498696, now seen corresponding path program 1 times [2024-04-05 19:06:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:06:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365291015] [2024-04-05 19:06:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:06:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:06:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:06:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:06:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:06:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365291015] [2024-04-05 19:06:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365291015] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:06:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464157843] [2024-04-05 19:06:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:06:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:06:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:06:40,745 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:06:40,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-04-05 19:06:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:06:40,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-05 19:06:40,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:06:41,097 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 19:06:41,097 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 19 treesize of output 16 [2024-04-05 19:06:41,191 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-04-05 19:06:41,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 19:06:41,254 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 11 treesize of output 11 [2024-04-05 19:06:41,465 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 35 treesize of output 18 [2024-04-05 19:06:41,749 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 19:06:41,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2024-04-05 19:06:42,001 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:06:42,001 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:06:42,193 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:06:42,193 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:06:42,423 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:06:42,423 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:06:42,623 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:06:42,623 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 19:06:42,868 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 19:06:42,868 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 19:06:43,044 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 19:06:43,044 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 19:06:43,127 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 23 treesize of output 11 [2024-04-05 19:06:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:06:43,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:06:43,285 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 19:07:04,616 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse7 (select .cse2 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse6 (store .cse2 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))))) (let ((.cse0 (store (select .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse1 (store .cse3 |c_~#value~0.offset| (+ 1 .cse4)))) (store (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse4 4294967296) (+ (mod .cse5 4294967296) 1))))))))))) is different from false [2024-04-05 19:07:05,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse14 |c_~#value~0.offset|) 4294967296) .cse24)) (.cse9 (+ .cse24 1))) (and (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse12 (store (select .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (store .cse13 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12))) (let ((.cse11 (select (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse3 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse12))) (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse2 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse6 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse2 1))))) (let ((.cse4 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse7 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base|))) (let ((.cse1 (select .cse7 |c_~#value~0.offset|))) (or (< (mod .cse1 4294967296) (+ (mod .cse2 4294967296) 1)) (< (mod (select (select (store (let ((.cse5 (store .cse7 |c_~#value~0.offset| (+ .cse1 1)))) (store (store (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| .cse5) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| .cse5) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse9))))))))))))) (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse18 (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse23 (select .cse18 |c_~#value~0.base|))) (let ((.cse21 (select .cse23 |c_~#value~0.offset|))) (let ((.cse22 (store .cse18 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse21 1))))) (let ((.cse16 (store (select .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base|))) (let ((.cse20 (select .cse19 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse17 (store .cse19 |c_~#value~0.offset| (+ .cse20 1)))) (store (store (store .cse15 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse18 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse20 4294967296) (+ (mod .cse21 4294967296) 1)) (< (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse9))))))))))))))) is different from false [2024-04-05 19:07:05,348 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse23 |c_~#value~0.offset|) 4294967296) .cse24)) (.cse8 (+ .cse24 1))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse10 (select .cse4 |c_~#value~0.base|))) (let ((.cse7 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse4 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse7 1))))) (let ((.cse2 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|))) (let ((.cse6 (select .cse5 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse3 (store .cse5 |c_~#value~0.offset| (+ .cse6 1)))) (store (store (store .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse6 4294967296) (+ (mod .cse7 4294967296) 1)) (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8)))))))))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse22 (store |c_#memory_int| |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse21 (store (select .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse18 (store .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse20 (select (store .cse18 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse13 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse12 (select .cse20 |c_~#value~0.offset|))) (let ((.cse19 (store .cse16 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| (+ .cse12 1))))) (let ((.cse14 (store (select .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse17 (select (store .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base|))) (let ((.cse11 (select .cse17 |c_~#value~0.offset|))) (or (< (mod .cse11 4294967296) (+ (mod .cse12 4294967296) 1)) (< (mod (select (select (store (let ((.cse15 (store .cse17 |c_~#value~0.offset| (+ .cse11 1)))) (store (store (store .cse13 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse16 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8)))))))))))))))) is different from false [2024-04-05 19:07:10,192 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse13 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse3))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse2 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse7 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse5 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base|))) (let ((.cse0 (select .cse8 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (< (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))))) is different from false [2024-04-05 19:07:10,443 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse4 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse4 1)))) (let ((.cse2 (store .cse13 |c_~#value~0.base| .cse12))) (let ((.cse3 (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse5 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse8 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse6 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (< (mod (select (select (store (let ((.cse7 (store .cse9 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))))))) is different from false [2024-04-05 19:07:17,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse17 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ 1 (select .cse17 |c_~#value~0.offset|))))))) (let ((.cse15 (store (select .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse14 (select (store (store .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base|))) (let ((.cse4 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15)) (.cse13 (store .cse14 |c_~#value~0.offset| (+ .cse4 1)))) (let ((.cse2 (store (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base| .cse13))) (let ((.cse3 (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store .cse12 |c_~#value~0.base| .cse13) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse5 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse8 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse6 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (< (mod (select (select (store (let ((.cse7 (store .cse9 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))))))) is different from false [2024-04-05 19:12:50,330 WARN L293 SmtUtils]: Spent 5.35m on a formula simplification. DAG size of input: 129 DAG size of output: 66 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 19:12:50,330 INFO L349 Elim1Store]: treesize reduction 201, result has 35.4 percent of original size [2024-04-05 19:12:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 164091122 treesize of output 142932179 [2024-04-05 19:13:26,528 WARN L293 SmtUtils]: Spent 36.17s on a formula simplification. DAG size of input: 9341 DAG size of output: 1303 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2024-04-05 19:13:55,993 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:55,994 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:55,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:55,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:55,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:56,001 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:56,006 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 19:13:56,999 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 [2024-04-05 19:13:57,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Forceful destruction successful, exit code 0 [2024-04-05 19:13:57,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-04-05 19:13:57,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-04-05 19:13:57,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2024-04-05 19:13:57,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-04-05 19:13:57,195 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-05 19:13:57,234 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 137 [2024-04-05 19:13:57,235 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-04-05 19:13:57,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-04-05 19:13:57,235 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) 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:337) 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: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2024-04-05 19:13:57,238 INFO L158 Benchmark]: Toolchain (without parser) took 859203.24ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 974.1MB). Free memory was 103.0MB in the beginning and 428.0MB in the end (delta: -325.0MB). Peak memory consumption was 704.8MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,238 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 19:13:57,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.49ms. Allocated memory is still 166.7MB. Free memory was 102.9MB in the beginning and 134.5MB in the end (delta: -31.6MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 166.7MB. Free memory was 134.5MB in the beginning and 132.5MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,239 INFO L158 Benchmark]: Boogie Preprocessor took 34.98ms. Allocated memory is still 166.7MB. Free memory was 132.5MB in the beginning and 131.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,239 INFO L158 Benchmark]: RCFGBuilder took 382.16ms. Allocated memory is still 166.7MB. Free memory was 131.0MB in the beginning and 112.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,239 INFO L158 Benchmark]: TraceAbstraction took 858307.78ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 974.1MB). Free memory was 111.0MB in the beginning and 428.0MB in the end (delta: -317.0MB). Peak memory consumption was 711.8MB. Max. memory is 8.0GB. [2024-04-05 19:13:57,239 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.49ms. Allocated memory is still 166.7MB. Free memory was 102.9MB in the beginning and 134.5MB in the end (delta: -31.6MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 166.7MB. Free memory was 134.5MB in the beginning and 132.5MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.98ms. Allocated memory is still 166.7MB. Free memory was 132.5MB in the beginning and 131.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 382.16ms. Allocated memory is still 166.7MB. Free memory was 131.0MB in the beginning and 112.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 858307.78ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 974.1MB). Free memory was 111.0MB in the beginning and 428.0MB in the end (delta: -317.0MB). Peak memory consumption was 711.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 288, independent: 216, independent conditional: 183, independent unconditional: 33, dependent: 72, dependent conditional: 58, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 183, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 183, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 183, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 35, independent unconditional: 181, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 216, independent: 169, independent conditional: 21, independent unconditional: 148, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 35, independent unconditional: 181, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 216, independent: 169, independent conditional: 21, independent unconditional: 148, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14 ], Independence queries for same thread: 72 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 682, independent: 539, independent conditional: 493, independent unconditional: 46, dependent: 143, dependent conditional: 128, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 493, independent unconditional: 46, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 493, independent unconditional: 46, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 493, independent unconditional: 46, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 121, independent unconditional: 418, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 539, independent: 539, independent conditional: 69, independent unconditional: 470, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 69, independent unconditional: 470, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, independent: 73, independent conditional: 1, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 539, independent: 466, independent conditional: 68, independent unconditional: 398, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 73, unknown conditional: 1, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 1, Positive unconditional cache size: 72, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 121, independent unconditional: 418, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 539, independent: 539, independent conditional: 69, independent unconditional: 470, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 539, independent: 539, independent conditional: 69, independent unconditional: 470, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, independent: 73, independent conditional: 1, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 539, independent: 466, independent conditional: 68, independent unconditional: 398, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 73, unknown conditional: 1, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 1, Positive unconditional cache size: 72, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52 ], Independence queries for same thread: 143 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1278, independent: 1029, independent conditional: 970, independent unconditional: 59, dependent: 249, dependent conditional: 233, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 970, independent unconditional: 59, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 970, independent unconditional: 59, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 970, independent unconditional: 59, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 258, independent unconditional: 771, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 137, independent unconditional: 892, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 137, independent unconditional: 892, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 5, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1029, independent: 912, independent conditional: 132, independent unconditional: 780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 117, unknown conditional: 5, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 5, Positive unconditional cache size: 112, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 121, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 258, independent unconditional: 771, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 137, independent unconditional: 892, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1029, independent: 1029, independent conditional: 137, independent unconditional: 892, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 5, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1029, independent: 912, independent conditional: 132, independent unconditional: 780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 117, unknown conditional: 5, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 5, Positive unconditional cache size: 112, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 121 ], Independence queries for same thread: 249 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2076, independent: 1686, independent conditional: 1614, independent unconditional: 72, dependent: 390, dependent conditional: 373, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 1614, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 1614, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 1614, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 446, independent unconditional: 1240, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 228, independent unconditional: 1458, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 228, independent unconditional: 1458, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 1, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1686, independent: 1545, independent conditional: 227, independent unconditional: 1318, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 141, unknown conditional: 1, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 1, Positive unconditional cache size: 140, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 218, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 446, independent unconditional: 1240, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 228, independent unconditional: 1458, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1686, independent: 1686, independent conditional: 228, independent unconditional: 1458, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 1, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1686, independent: 1545, independent conditional: 227, independent unconditional: 1318, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 141, unknown conditional: 1, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 1, Positive unconditional cache size: 140, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 218 ], Independence queries for same thread: 390 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown