/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 546 -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 07:07:47,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 07:07:47,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 07:07:47,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 07:07:47,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 07:07:47,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 07:07:47,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 07:07:47,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 07:07:47,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 07:07:47,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 07:07:47,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 07:07:47,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 07:07:47,924 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 07:07:47,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 07:07:47,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 07:07:47,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 07:07:47,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 07:07:47,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 07:07:47,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 07:07:47,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 07:07:47,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 07:07:47,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 07:07:47,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 07:07:47,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 07:07:47,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 07:07:47,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 07:07:47,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 07:07:47,939 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 07:07:47,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 07:07:47,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 07:07:47,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 07:07:47,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 07:07:47,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 07:07:47,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 07:07:47,940 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 07:07:47,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 07:07:47,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 07:07:47,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 07:07:47,941 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 07:07:47,941 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 -> 546 [2024-04-05 07:07:48,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 07:07:48,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 07:07:48,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 07:07:48,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 07:07:48,182 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 07:07:48,183 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 07:07:49,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 07:07:49,419 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 07:07:49,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 07:07:49,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3be9bddaf/afef8721d42b47e89f4b6d9af5f624aa/FLAGd2c5df352 [2024-04-05 07:07:49,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3be9bddaf/afef8721d42b47e89f4b6d9af5f624aa [2024-04-05 07:07:49,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 07:07:49,450 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 07:07:49,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 07:07:49,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 07:07:49,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 07:07:49,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b517e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49, skipping insertion in model container [2024-04-05 07:07:49,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,492 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 07:07:49,763 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 07:07:49,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 07:07:49,777 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 07:07:49,815 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 07:07:49,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 07:07:49,839 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 07:07:49,840 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 07:07:49,845 INFO L206 MainTranslator]: Completed translation [2024-04-05 07:07:49,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49 WrapperNode [2024-04-05 07:07:49,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 07:07:49,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 07:07:49,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 07:07:49,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 07:07:49,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,895 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-04-05 07:07:49,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 07:07:49,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 07:07:49,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 07:07:49,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 07:07:49,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 07:07:49,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 07:07:49,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 07:07:49,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 07:07:49,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (1/1) ... [2024-04-05 07:07:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 07:07:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:49,984 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 07:07:50,051 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 07:07:50,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-05 07:07:50,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 07:07:50,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 07:07:50,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 07:07:50,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 07:07:50,075 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 07:07:50,187 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 07:07:50,189 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 07:07:50,333 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 07:07:50,400 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 07:07:50,400 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 07:07:50,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:07:50 BoogieIcfgContainer [2024-04-05 07:07:50,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 07:07:50,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 07:07:50,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 07:07:50,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 07:07:50,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 07:07:49" (1/3) ... [2024-04-05 07:07:50,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c8fb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:07:50, skipping insertion in model container [2024-04-05 07:07:50,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:49" (2/3) ... [2024-04-05 07:07:50,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c8fb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:07:50, skipping insertion in model container [2024-04-05 07:07:50,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:07:50" (3/3) ... [2024-04-05 07:07:50,409 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-04-05 07:07:50,415 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 07:07:50,422 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 07:07:50,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 07:07:50,423 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 07:07:50,459 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:07:50,488 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:07:50,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:07:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:50,491 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 07:07:50,506 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 07:07:50,518 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:07:50,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:50,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:07:50,534 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;@235c8043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:07:50,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 07:07:50,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 07:07:50,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 790974196, now seen corresponding path program 1 times [2024-04-05 07:07:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406433734] [2024-04-05 07:07:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:50,740 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 07:07:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406433734] [2024-04-05 07:07:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406433734] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:07:50,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718653960] [2024-04-05 07:07:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:07:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:07:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:07:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:50,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:50,841 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 07:07:50,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:50,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 07:07:50,872 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 07:07:50,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 623441482, now seen corresponding path program 1 times [2024-04-05 07:07:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110778420] [2024-04-05 07:07:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:51,222 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 07:07:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:51,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110778420] [2024-04-05 07:07:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110778420] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 07:07:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528692909] [2024-04-05 07:07:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:51,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 07:07:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 07:07:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-04-05 07:07:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:51,226 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 07:07:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:51,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 07:07:51,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 07:07:51,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1929615467, now seen corresponding path program 1 times [2024-04-05 07:07:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206550261] [2024-04-05 07:07:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:51,933 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 07:07:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206550261] [2024-04-05 07:07:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206550261] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 07:07:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563513998] [2024-04-05 07:07:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 07:07:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 07:07:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 07:07:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:51,936 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 07:07:51,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:51,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:51,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-05 07:07:52,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 07:07:52,156 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 07:07:52,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 540436402, now seen corresponding path program 1 times [2024-04-05 07:07:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443322437] [2024-04-05 07:07:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:52,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 07:07:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:52,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 07:07:52,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 07:07:52,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-04-05 07:07:52,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-04-05 07:07:52,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-04-05 07:07:52,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 07:07:52,204 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 07:07:52,206 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 07:07:52,206 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 07:07:52,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:07:52,234 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:07:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:07:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:52,276 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 07:07:52,277 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 07:07:52,280 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:07:52,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:07:52,284 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;@235c8043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:07:52,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 07:07:52,294 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 07:07:52,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1856933464, now seen corresponding path program 1 times [2024-04-05 07:07:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:52,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047752865] [2024-04-05 07:07:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:52,305 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 07:07:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047752865] [2024-04-05 07:07:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047752865] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:52,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:07:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929994308] [2024-04-05 07:07:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:52,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:07:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:07:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:07:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,307 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:52,307 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 07:07:52,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 07:07:52,320 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 07:07:52,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442431, now seen corresponding path program 1 times [2024-04-05 07:07:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570258563] [2024-04-05 07:07:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:52,414 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 07:07:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570258563] [2024-04-05 07:07:52,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570258563] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:52,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:52,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 07:07:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43597369] [2024-04-05 07:07:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 07:07:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 07:07:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 07:07:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:52,416 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 07:07:52,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 07:07:52,472 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 07:07:52,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 715489871, now seen corresponding path program 1 times [2024-04-05 07:07:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685654998] [2024-04-05 07:07:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:52,772 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 07:07:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685654998] [2024-04-05 07:07:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685654998] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 07:07:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758631449] [2024-04-05 07:07:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 07:07:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 07:07:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 07:07:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:52,774 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 07:07:52,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:52,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:52,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 07:07:52,975 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 07:07:52,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash -232196713, now seen corresponding path program 1 times [2024-04-05 07:07:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457235953] [2024-04-05 07:07:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:53,598 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 07:07:53,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457235953] [2024-04-05 07:07:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457235953] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:07:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082297083] [2024-04-05 07:07:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:53,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:07:53,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:53,603 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 07:07:53,640 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 07:07:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:53,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2024-04-05 07:07:53,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:07:53,810 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:07:53,810 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 07:07:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 07:07:53,925 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:07:53,925 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 07:07:54,055 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 07:07:54,058 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 07:07:54,151 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 07:07:54,198 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 07:07:54,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:07:54,251 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 07:07:54,742 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 89 treesize of output 81 [2024-04-05 07:07:54,749 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 26 [2024-04-05 07:07:54,752 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 44 treesize of output 40 [2024-04-05 07:07:54,871 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 07:07:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082297083] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:07:54,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:07:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2024-04-05 07:07:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325182741] [2024-04-05 07:07:54,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:07:54,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 07:07:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:54,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 07:07:54,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=846, Unknown=11, NotChecked=60, Total=1056 [2024-04-05 07:07:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:54,874 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 07:07:54,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:54,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:54,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:07:55,352 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 07:07:55,543 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 07:07:55,544 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 07:07:55,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1951612766, now seen corresponding path program 1 times [2024-04-05 07:07:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768614718] [2024-04-05 07:07:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:56,226 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 07:07:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768614718] [2024-04-05 07:07:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768614718] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:07:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975738280] [2024-04-05 07:07:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:56,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:07:56,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:56,228 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 07:07:56,248 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 07:07:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:56,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 07:07:56,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:07:56,334 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:07:56,334 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 07:07:56,365 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:07:56,366 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 07:07:56,424 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 07:07:56,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:07:56,455 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 07:07:56,560 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 07:07:56,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:07:56,574 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 07:07:56,576 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 07:07:56,609 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 07:07:56,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:07:56,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:07:56,835 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 07:07:56,838 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 07:07:56,845 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 07:07:57,018 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 07:07:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975738280] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:07:57,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:07:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 07:07:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913460342] [2024-04-05 07:07:57,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:07:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 07:07:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 07:07:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=736, Unknown=6, NotChecked=0, Total=870 [2024-04-05 07:07:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:57,021 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 07:07:57,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:57,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:57,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:07:57,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:07:57,428 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 07:07:57,607 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 07:07:57,607 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 07:07:57,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1062705217, now seen corresponding path program 1 times [2024-04-05 07:07:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19036360] [2024-04-05 07:07:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:57,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 07:07:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:57,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 07:07:57,657 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 07:07:57,657 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-05 07:07:57,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-05 07:07:57,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-05 07:07:57,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-05 07:07:57,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 07:07:57,658 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-05 07:07:57,659 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 07:07:57,659 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 07:07:57,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:07:57,678 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:07:57,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:07:57,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:57,679 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 07:07:57,710 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:07:57,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:07:57,711 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;@235c8043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:07:57,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 07:07:57,714 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 07:07:57,715 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 07:07:57,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -42688683, now seen corresponding path program 1 times [2024-04-05 07:07:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486629393] [2024-04-05 07:07:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:57,724 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 07:07:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486629393] [2024-04-05 07:07:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486629393] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:07:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488765603] [2024-04-05 07:07:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:57,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:07:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:07:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:07:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:57,726 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 07:07:57,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 07:07:57,756 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 07:07:57,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash 417728457, now seen corresponding path program 1 times [2024-04-05 07:07:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3903754] [2024-04-05 07:07:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:57,868 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 07:07:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:57,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3903754] [2024-04-05 07:07:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3903754] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 07:07:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667999101] [2024-04-05 07:07:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 07:07:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 07:07:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 07:07:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:57,870 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 07:07:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:57,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 07:07:57,922 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 07:07:57,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1782599532, now seen corresponding path program 1 times [2024-04-05 07:07:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542478408] [2024-04-05 07:07:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:58,154 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 07:07:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542478408] [2024-04-05 07:07:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542478408] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 07:07:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193493644] [2024-04-05 07:07:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:58,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 07:07:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:58,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 07:07:58,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 07:07:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:58,156 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:58,156 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 07:07:58,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:58,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:07:58,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:07:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 07:07:58,375 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 07:07:58,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -267004783, now seen corresponding path program 1 times [2024-04-05 07:07:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560112614] [2024-04-05 07:07:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:58,928 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 07:07:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560112614] [2024-04-05 07:07:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560112614] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:07:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107616596] [2024-04-05 07:07:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:58,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:07:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:58,930 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 07:07:58,953 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 07:07:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:59,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 07:07:59,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:07:59,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:07:59,082 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 07:07:59,131 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 07:07:59,172 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:07:59,173 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 07:07:59,279 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 07:07:59,447 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 07:07:59,612 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 07:07:59,750 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 07:07:59,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:07:59,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_293) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 07:08:00,330 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 07:08:00,331 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 07:08:00,336 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 07:08:00,337 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 07:08:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2024-04-05 07:08:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107616596] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:08:00,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:08:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2024-04-05 07:08:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050265009] [2024-04-05 07:08:00,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:08:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 07:08:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 07:08:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=833, Unknown=10, NotChecked=60, Total=1056 [2024-04-05 07:08:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:00,398 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 07:08:00,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:00,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:00,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:08:00,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-05 07:08:01,134 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 07:08:01,134 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 07:08:01,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash -737606014, now seen corresponding path program 1 times [2024-04-05 07:08:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221045297] [2024-04-05 07:08:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:01,615 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 07:08:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221045297] [2024-04-05 07:08:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221045297] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810919075] [2024-04-05 07:08:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:01,620 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 07:08:01,670 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 07:08:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:01,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2024-04-05 07:08:01,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:01,786 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:08:01,786 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 07:08:01,839 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 07:08:01,887 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:08:01,887 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 07:08:02,047 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 07:08:02,195 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 07:08:02,318 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 07:08:02,442 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:08:02,442 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 07:08:02,588 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 07:08:02,600 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:08:02,601 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 07:08:02,646 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 07:08:02,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:08:03,013 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_8 (Array Int 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 ((.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_8) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-04-05 07:08:17,890 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 07:08:17,891 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 129 treesize of output 69 [2024-04-05 07:08:17,904 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 07:08:17,904 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 108 treesize of output 88 [2024-04-05 07:08:17,923 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 58 treesize of output 52 [2024-04-05 07:08:17,928 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 32 treesize of output 28 [2024-04-05 07:08:20,586 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 07:08:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810919075] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:08:20,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:08:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 43 [2024-04-05 07:08:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212605849] [2024-04-05 07:08:20,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:08:20,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-04-05 07:08:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:20,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-04-05 07:08:20,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1506, Unknown=28, NotChecked=82, Total=1892 [2024-04-05 07:08:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:20,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:20,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.441860465116279) internal successors, (148), 44 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 07:08:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:08:20,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:08:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:08:22,252 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 07:08:22,433 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 07:08:22,433 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 07:08:22,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash -928964791, now seen corresponding path program 1 times [2024-04-05 07:08:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145701179] [2024-04-05 07:08:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:23,446 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 07:08:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145701179] [2024-04-05 07:08:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145701179] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704747692] [2024-04-05 07:08:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:23,447 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 07:08:23,449 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 07:08:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:23,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-04-05 07:08:23,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:23,678 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:08:23,679 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 07:08:23,749 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 07:08:23,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:08:23,804 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 07:08:23,959 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 07:08:24,191 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:08:24,191 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 07:08:24,398 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:08:24,398 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 07:08:24,621 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:08:24,621 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 07:08:24,695 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 07:08:24,724 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 07:08:24,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:08:24,813 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 07:08:25,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (or (= .cse0 4294967295) (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (= .cse0 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or .cse1 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_423 (Array Int Int))) (< (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_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)) (not .cse1))))))) is different from false [2024-04-05 07:08:26,305 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 07:08:26,893 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 07:08:28,291 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 07:08:28,293 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 232163 treesize of output 227748 [2024-04-05 07:08:28,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:08:28,422 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 943 treesize of output 955 [2024-04-05 07:08:28,454 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 07:08:28,481 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 130 treesize of output 114 [2024-04-05 07:08:28,678 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 07:08:28,804 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 07:08:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704747692] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:08:28,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:08:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2024-04-05 07:08:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869556648] [2024-04-05 07:08:28,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:08:28,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 07:08:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 07:08:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1947, Unknown=36, NotChecked=380, Total=2652 [2024-04-05 07:08:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:28,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:28,806 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 07:08:28,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:28,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:28,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:28,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:08:28,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:08:28,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:08:31,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-04-05 07:08:31,519 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 07:08:31,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 07:08:31,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1454667501, now seen corresponding path program 1 times [2024-04-05 07:08:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66704488] [2024-04-05 07:08:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:32,162 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 07:08:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66704488] [2024-04-05 07:08:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66704488] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907174880] [2024-04-05 07:08:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:32,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:32,164 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 07:08:32,191 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 07:08:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:32,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 07:08:32,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:32,309 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:08:32,309 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 07:08:32,442 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:08:32,442 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 07:08:32,603 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 07:08:32,715 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:08:32,716 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 07:08:32,884 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 07:08:33,013 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:08:33,013 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 07:08:33,171 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 07:08:33,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:08:33,188 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 07:08:33,192 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 07:08:33,241 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 07:08:33,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:08:33,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:08:33,587 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 07:08:33,589 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 07:08:33,600 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 07:08:33,934 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 07:08:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907174880] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:08:33,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:08:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2024-04-05 07:08:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076134941] [2024-04-05 07:08:33,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:08:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 07:08:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 07:08:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=835, Unknown=3, NotChecked=0, Total=992 [2024-04-05 07:08:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:33,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:33,936 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 07:08:33,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:33,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:33,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:08:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:08:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:08:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 07:08:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:08:34,805 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 07:08:34,998 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 07:08:34,999 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 07:08:34,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:34,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1094034385, now seen corresponding path program 1 times [2024-04-05 07:08:34,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:34,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134512475] [2024-04-05 07:08:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:08:35,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 07:08:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:08:35,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 07:08:35,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 07:08:35,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 07:08:35,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 07:08:35,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 07:08:35,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 07:08:35,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 07:08:35,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-05 07:08:35,061 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 07:08:35,062 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 07:08:35,062 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 07:08:35,085 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:08:35,087 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:08:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:08:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:35,090 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 07:08:35,091 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 07:08:35,095 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:08:35,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:35,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:08:35,095 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;@235c8043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:08:35,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-05 07:08:35,102 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 07:08:35,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1788341269, now seen corresponding path program 1 times [2024-04-05 07:08:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191269302] [2024-04-05 07:08:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:35,112 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 07:08:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191269302] [2024-04-05 07:08:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191269302] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:08:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:08:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:08:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454265445] [2024-04-05 07:08:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:08:35,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:08:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:35,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:08:35,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:08:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:35,113 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 07:08:35,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-05 07:08:35,138 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 07:08:35,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -423966927, now seen corresponding path program 1 times [2024-04-05 07:08:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818501356] [2024-04-05 07:08:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:35,262 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 07:08:35,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818501356] [2024-04-05 07:08:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818501356] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:08:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:08:35,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 07:08:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346049682] [2024-04-05 07:08:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:08:35,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 07:08:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 07:08:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 07:08:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:35,264 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 07:08:35,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:08:35,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-05 07:08:35,341 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 07:08:35,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1513268162, now seen corresponding path program 1 times [2024-04-05 07:08:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:35,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512540981] [2024-04-05 07:08:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:35,605 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 07:08:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512540981] [2024-04-05 07:08:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512540981] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:08:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:08:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 07:08:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726662135] [2024-04-05 07:08:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:08:35,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 07:08:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 07:08:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 07:08:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:35,606 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 07:08:35,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:08:35,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:35,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-05 07:08:35,865 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 07:08:35,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847127, now seen corresponding path program 1 times [2024-04-05 07:08:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065925574] [2024-04-05 07:08:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:36,242 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 07:08:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:36,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065925574] [2024-04-05 07:08:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065925574] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:36,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448625905] [2024-04-05 07:08:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:36,245 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 07:08:36,273 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 07:08:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:36,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 07:08:36,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:36,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:08:36,441 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 07:08:36,502 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 07:08:36,676 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 07:08:36,677 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 07:08:36,832 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:08:36,832 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 07:08:36,921 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 07:08:36,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:08:36,983 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 07:08:41,391 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 07:08:41,392 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 07:08:41,400 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 07:08:41,400 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 07:08:41,406 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 07:08:41,458 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 07:08:41,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448625905] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:08:41,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:08:41,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 07:08:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001961237] [2024-04-05 07:08:41,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:08:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 07:08:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:08:41,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 07:08:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=793, Unknown=11, NotChecked=58, Total=992 [2024-04-05 07:08:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:41,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:08:41,460 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 07:08:41,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:41,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:41,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:41,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:08:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:08:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:08:42,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-04-05 07:08:42,341 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 07:08:42,342 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 07:08:42,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash -222757182, now seen corresponding path program 1 times [2024-04-05 07:08:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988246712] [2024-04-05 07:08:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:42,820 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 07:08:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988246712] [2024-04-05 07:08:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988246712] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066753841] [2024-04-05 07:08:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:42,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:42,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:42,822 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 07:08:42,838 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 07:08:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:42,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2024-04-05 07:08:42,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:43,014 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:08:43,014 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 07:08:43,077 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 07:08:43,142 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:08:43,143 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 07:08:43,325 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 07:08:43,460 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 07:08:43,599 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 07:08:43,765 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:08:43,766 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 07:08:43,904 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 07:08:43,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:08:43,915 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 07:08:43,952 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 07:08:43,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:09:05,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:09:05,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:09:05,605 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 466 treesize of output 442 [2024-04-05 07:09:05,617 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 07:09:05,623 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 07:09:05,651 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 118 treesize of output 116 [2024-04-05 07:09:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:09:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066753841] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:09:10,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:09:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-05 07:09:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570437261] [2024-04-05 07:09:10,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:09:10,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-05 07:09:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:09:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-05 07:09:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1638, Unknown=52, NotChecked=0, Total=1980 [2024-04-05 07:09:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:10,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:09:10,270 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 07:09:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:09:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:09:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:09:11,687 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 07:09:11,879 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 07:09:11,879 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 07:09:11,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:09:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -759787727, now seen corresponding path program 1 times [2024-04-05 07:09:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:09:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532660354] [2024-04-05 07:09:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:09:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:12,804 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 07:09:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:09:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532660354] [2024-04-05 07:09:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532660354] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:09:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466053041] [2024-04-05 07:09:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:12,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:09:12,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:09:12,805 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 07:09:12,808 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 07:09:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:12,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-05 07:09:12,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:09:13,055 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:09:13,056 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 07:09:13,150 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 07:09:13,239 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:09:13,239 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 07:09:13,459 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 07:09:13,764 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 07:09:14,140 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:09:14,140 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 07:09:14,353 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 07:09:14,353 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 07:09:14,571 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 07:09:14,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:09:17,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786))) (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) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| .cse0) |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse3 4294967296))))))) is different from false [2024-04-05 07:09:18,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| 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_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store (store .cse5 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse0 4294967296)) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |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 07:09:19,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:09:19,569 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 07:09:19,570 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 9129 treesize of output 8647 [2024-04-05 07:09:19,640 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-04-05 07:09:19,641 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 436 treesize of output 414 [2024-04-05 07:09:19,655 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 07:09:19,666 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 07:09:19,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:09:19,693 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 07:09:19,714 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 07:09:19,777 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 07:09:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 9 refuted. 8 times theorem prover too weak. 4 trivial. 18 not checked. [2024-04-05 07:09:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466053041] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:09:19,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:09:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 20] total 53 [2024-04-05 07:09:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680743824] [2024-04-05 07:09:19,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:09:19,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-05 07:09:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:09:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-05 07:09:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2140, Unknown=70, NotChecked=198, Total=2756 [2024-04-05 07:09:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:19,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:09:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.452830188679245) internal successors, (236), 53 states have internal predecessors, (236), 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 07:09:19,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:19,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:19,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:19,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:09:19,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:09:19,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:09:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:09:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:09:23,084 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 07:09:23,278 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 07:09:23,279 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 07:09:23,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:09:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1161605635, now seen corresponding path program 1 times [2024-04-05 07:09:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:09:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815156502] [2024-04-05 07:09:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:09:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:23,904 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 07:09:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:09:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815156502] [2024-04-05 07:09:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815156502] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:09:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796113558] [2024-04-05 07:09:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:09:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:09:23,905 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 07:09:23,930 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 07:09:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:24,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 07:09:24,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:09:24,065 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:09:24,065 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 07:09:24,169 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:09:24,169 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 07:09:24,337 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 07:09:24,446 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:09:24,446 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 07:09:24,593 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 07:09:24,663 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:09:24,663 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 07:09:24,794 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 07:09:24,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:09:24,837 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 07:09:24,840 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 07:09:24,922 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 07:09:24,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:09:25,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:09:25,369 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 07:09:25,372 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 07:09:25,380 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 07:09:25,748 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 07:09:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796113558] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:09:25,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:09:25,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-04-05 07:09:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759252257] [2024-04-05 07:09:25,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:09:25,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-05 07:09:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:09:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-05 07:09:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1016, Unknown=5, NotChecked=0, Total=1190 [2024-04-05 07:09:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:25,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:09:25,750 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 07:09:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:09:25,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:09:25,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:09:25,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:09:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:09:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:09:27,192 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 07:09:27,386 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 07:09:27,386 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 07:09:27,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:09:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -371588503, now seen corresponding path program 1 times [2024-04-05 07:09:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:09:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801872033] [2024-04-05 07:09:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:09:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:28,832 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 07:09:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:09:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801872033] [2024-04-05 07:09:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801872033] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:09:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867545100] [2024-04-05 07:09:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:09:28,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:09:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:09:28,834 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 07:09:28,835 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 07:09:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:09:28,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 07:09:29,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:09:29,084 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:09:29,084 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 07:09:29,148 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 07:09:29,192 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:09:29,192 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 07:09:29,358 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 07:09:29,552 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 07:09:29,875 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:09:29,875 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 07:09:30,218 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 07:09:30,218 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 07:09:30,717 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:09:30,717 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 07:09:30,970 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 07:09:30,971 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 07:09:31,086 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 07:09:31,123 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 07:09:31,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:09:39,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (+ .cse12 1)) (.cse5 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12))) (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 ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))))) (store .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse0 |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 .cse3 4294967296) .cse4)))))) .cse5) (or (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 ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (let ((.cse7 (store (select .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse6 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse9 1))))) (store .cse6 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse6 |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 .cse9 4294967296) .cse4))))))) (not .cse5))))) is different from false [2024-04-05 07:09:39,821 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 07:09:44,218 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)) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961))) (let ((.cse7 (select .cse4 |c_~#value~0.base|))) (let ((.cse1 (select .cse7 |c_~#value~0.offset|))) (let ((.cse6 (store .cse4 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse2 (store (select .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse5 (select (store .cse6 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse3 (store .cse5 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |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 07:09:45,974 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))) (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|) 0 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 07:09:49,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:10:39,537 WARN L293 SmtUtils]: Spent 48.99s 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 07:10:39,537 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 07:10:39,542 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 5184257 treesize of output 4709032 [2024-04-05 07:10:40,576 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 07:10:40,578 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 42643 treesize of output 40843 [2024-04-05 07:10:40,844 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 4662 treesize of output 4598 [2024-04-05 07:10:40,907 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 913 treesize of output 833 [2024-04-05 07:10:41,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:10:41,096 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 07:10:41,139 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 07:10:47,058 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 07:10:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 20 refuted. 4 times theorem prover too weak. 0 trivial. 18 not checked. [2024-04-05 07:10:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867545100] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:10:47,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:10:47,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2024-04-05 07:10:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269098571] [2024-04-05 07:10:47,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:10:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-05 07:10:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:10:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-05 07:10:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=3738, Unknown=73, NotChecked=524, Total=4830 [2024-04-05 07:10:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:10:47,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:10:47,292 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 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:10:47,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:10:47,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:10:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:10:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:10:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:10:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:10:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:10:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 07:10:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:10:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-05 07:10:54,697 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 07:10:54,900 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 07:10:54,901 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 07:10:54,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:10:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash -325667869, now seen corresponding path program 1 times [2024-04-05 07:10:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:10:54,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693900854] [2024-04-05 07:10:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:10:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:10:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:10:55,560 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 07:10:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:10:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693900854] [2024-04-05 07:10:55,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693900854] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:10:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928438757] [2024-04-05 07:10:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:10:55,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:10:55,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:10:55,562 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 07:10:55,564 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 07:10:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:10:55,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2024-04-05 07:10:55,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:10:55,840 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:10:55,841 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 07:10:55,917 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 07:10:56,001 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:10:56,002 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 07:10:56,183 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 07:10:56,334 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 07:10:56,492 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 07:10:56,612 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:10:56,612 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 07:10:56,958 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 07:10:56,977 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:10:56,977 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 07:10:57,178 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 07:10:57,276 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 07:10:57,353 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-04-05 07:10:57,353 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 07:10:57,617 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:10:57,617 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 07:10:57,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:10:57,856 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:10:57,856 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 07:10:58,032 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-04-05 07:10:58,032 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 07:10:58,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:10:58,119 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 07:10:58,255 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 07:10:58,258 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 07:10:58,300 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 07:10:58,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:10:58,913 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087))) (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_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 07:10:59,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (mod |c_thr1Thread3of4ForFork0_~v~0#1| 4294967296)) (.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse12 (mod (select .cse11 |c_~#value~0.offset|) 4294967296))) (.cse1 (+ .cse12 1))) (and (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse2 (select .cse4 |c_~#value~0.offset|))) (< (mod .cse2 4294967296) (mod (select (select (store (store .cse3 |c_~#value~0.base| (store .cse4 |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)))))))) .cse5) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| |c_thr1Thread3of4ForFork0_~vn~0#1|)))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of4ForFork0_~#casret~0#1.base|) |c_thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (store .cse10 |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse7))) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse6 (select .cse8 |c_~#value~0.offset|))) (< (mod .cse6 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not .cse5) (< (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)))))))) is different from false [2024-04-05 07:10:59,827 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_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (select .cse6 |c_~#value~0.offset|))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ 1 .cse4))))) (let ((.cse1 (store (select .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (let ((.cse3 (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1))) (or (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse2 (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |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| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1))))))))) is different from false [2024-04-05 07:10:59,916 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_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse3 (store .cse7 |c_~#value~0.offset| (+ .cse5 1)))) (let ((.cse4 (store .cse6 |c_~#value~0.base| .cse3))) (let ((.cse1 (store (select .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |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| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)))))))))) is different from false [2024-04-05 07:11:00,030 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_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse3 (store .cse7 |c_~#value~0.offset| (+ .cse5 1)))) (let ((.cse4 (store .cse6 |c_~#value~0.base| .cse3))) (let ((.cse1 (store (select .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |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| |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (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 (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)))))))))) is different from false [2024-04-05 07:11:02,113 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_34 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse8))) |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse9 (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_34)) (.cse4 (store .cse9 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse4))) (let ((.cse2 (store (select .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1))) (or (let ((.cse3 (select (store (store (store .cse1 |c_~#value~0.base| .cse4) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 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 .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)))))))))))) is different from false [2024-04-05 07:11:03,458 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_34 (Array Int Int)) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |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 (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 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 .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1))))))))))))) is different from false [2024-04-05 07:11:03,720 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_34 (Array Int Int)) (v_ArrVal_1071 Int) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int) (v_ArrVal_1072 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |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 (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 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 .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1))))))))))))) is different from false [2024-04-05 07:11:04,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse16 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse15 |c_~#value~0.offset|) 4294967296)))) (and (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_34 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (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 ((.cse5 (select .cse12 |c_~#value~0.offset|))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse4 (store .cse12 |c_~#value~0.offset| (+ .cse5 1)))) (let ((.cse11 (select (store (store (store .cse3 |c_~#value~0.base| .cse4) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse10))) (let ((.cse6 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.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)) (< (mod (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse4) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse5 4294967296) 1)) (not (= (select (store (store .cse6 |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)) (not (= (select .cse6 |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| .cse1) |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| .cse1) |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)))))))))))))))) (not .cse16)) (or .cse16 (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_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse21 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse21 |c_~#value~0.base|))) (let ((.cse23 (select .cse30 |c_~#value~0.offset|))) (let ((.cse22 (store .cse30 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse20 (select .cse28 |c_~#value~0.offset|))) (let ((.cse25 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse27 (store .cse28 |c_~#value~0.offset| (+ .cse20 1)))) (let ((.cse18 (store (store .cse25 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse27))) (let ((.cse19 (store (select .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1)) (.cse17 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (not (= (select (store (store .cse17 |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 .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse20 4294967296) 1)) (< (mod (select (select (store (store .cse21 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (let ((.cse26 (select (store (store (store .cse25 |c_~#value~0.base| .cse27) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse24 (select .cse26 |c_~#value~0.offset|))) (< (mod .cse24 4294967296) (mod (select (select (store (store (store (store .cse25 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| (+ .cse24 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)))))))))))))))))) is different from false [2024-04-05 07:11:04,303 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse16 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse15 |c_~#value~0.offset|) 4294967296)))) (and (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_34 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (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_34) |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_34)) (.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_34) |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)))))))))))))))) (not .cse16)) (or .cse16 (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_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse21 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse21 |c_~#value~0.base|))) (let ((.cse23 (select .cse30 |c_~#value~0.offset|))) (let ((.cse22 (store .cse30 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse20 (select .cse28 |c_~#value~0.offset|))) (let ((.cse25 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse27 (store .cse28 |c_~#value~0.offset| (+ .cse20 1)))) (let ((.cse18 (store (store .cse25 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse27))) (let ((.cse19 (store (select .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1)) (.cse17 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (or (not (= (select (store (store .cse17 |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 .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse20 4294967296) 1)) (< (mod (select (select (store (store .cse21 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (let ((.cse26 (select (store (store (store .cse25 |c_~#value~0.base| .cse27) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse24 (select .cse26 |c_~#value~0.offset|))) (< (mod .cse24 4294967296) (mod (select (select (store (store (store (store .cse25 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| (+ .cse24 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)))))))))))))))))) is different from false [2024-04-05 07:11:04,490 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_34 (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 ((.cse10 (select .cse12 |c_~#value~0.offset|))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse9 (store .cse12 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse11 (select (store (store (store .cse8 |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store .cse8 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34)) (.cse7 (store .cse11 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse7))) (let ((.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29|) 0 1)) (.cse3 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071))) (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 .cse3 |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 ((.cse6 (select (store (store (store .cse5 |c_~#value~0.base| .cse7) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse6 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_29| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select .cse3 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse9) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_32| v_DerPreprocessor_34) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1)))))))))))))) is different from false [2024-04-05 07:11:11,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:11:31,140 WARN L293 SmtUtils]: Spent 18.84s 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 07:11:31,140 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 07:11:31,143 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 260665 treesize of output 251018 [2024-04-05 07:11:31,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:11:31,930 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 18613 treesize of output 18543 [2024-04-05 07:11:32,377 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 4892 treesize of output 4726 [2024-04-05 07:11:32,472 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 4726 treesize of output 4438 [2024-04-05 07:11:32,568 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 2562 treesize of output 2378 [2024-04-05 07:11:32,691 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 3683 treesize of output 3429 [2024-04-05 07:11:32,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 152 treesize of output 140 [2024-04-05 07:11:33,146 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 2053 treesize of output 2051 [2024-04-05 07:12:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 13 times theorem prover too weak. 0 trivial. 25 not checked. [2024-04-05 07:12:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928438757] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:12:55,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:12:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 31] total 71 [2024-04-05 07:12:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695459140] [2024-04-05 07:12:55,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:12:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-04-05 07:12:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:12:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-04-05 07:12:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3109, Unknown=80, NotChecked=1408, Total=5112 [2024-04-05 07:12:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:12:55,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:12:55,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.9295774647887325) internal successors, (279), 72 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 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-05 07:12:55,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 07:13:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 07:13:03,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-04-05 07:13:04,067 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 07:13:04,067 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 07:13:04,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -491038927, now seen corresponding path program 1 times [2024-04-05 07:13:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704420467] [2024-04-05 07:13:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:13:04,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 07:13:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:13:04,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 07:13:04,168 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 07:13:04,168 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-05 07:13:04,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-05 07:13:04,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-05 07:13:04,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-05 07:13:04,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-05 07:13:04,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-05 07:13:04,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-04-05 07:13:04,170 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 07:13:04,171 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 07:13:04,171 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 07:13:04,197 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:13:04,203 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:13:04,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:13:04,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:04,204 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 07:13:04,212 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 07:13:04,223 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:13:04,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:04,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:13:04,224 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;@235c8043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:13:04,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 07:13:04,229 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 07:13:04,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1616899814, now seen corresponding path program 1 times [2024-04-05 07:13:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205907976] [2024-04-05 07:13:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:04,236 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 07:13:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:04,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205907976] [2024-04-05 07:13:04,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205907976] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:13:04,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:13:04,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:13:04,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99108367] [2024-04-05 07:13:04,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:13:04,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:13:04,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:13:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:13:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,237 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:04,237 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 07:13:04,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-04-05 07:13:04,283 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 07:13:04,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash -970814200, now seen corresponding path program 1 times [2024-04-05 07:13:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043023381] [2024-04-05 07:13:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:04,461 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 07:13:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043023381] [2024-04-05 07:13:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043023381] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:13:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:13:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 07:13:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395630536] [2024-04-05 07:13:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:13:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 07:13:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 07:13:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 07:13:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,463 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:04,463 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 07:13:04,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:13:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-04-05 07:13:04,604 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 07:13:04,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1108440751, now seen corresponding path program 1 times [2024-04-05 07:13:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:04,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81810931] [2024-04-05 07:13:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:04,990 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 07:13:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81810931] [2024-04-05 07:13:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81810931] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:13:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:13:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 07:13:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462684549] [2024-04-05 07:13:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:13:04,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 07:13:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 07:13:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 07:13:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:04,992 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 07:13:04,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:04,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 07:13:04,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:05,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-04-05 07:13:05,595 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 07:13:05,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1386114128, now seen corresponding path program 1 times [2024-04-05 07:13:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:05,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037573119] [2024-04-05 07:13:05,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:06,375 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 07:13:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037573119] [2024-04-05 07:13:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037573119] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:13:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124358154] [2024-04-05 07:13:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:13:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:06,378 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 07:13:06,379 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 07:13:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:06,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 07:13:06,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:13:06,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:13:06,746 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 07:13:06,851 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 07:13:07,198 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 07:13:07,198 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 07:13:07,544 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:13:07,545 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 07:13:07,819 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 07:13:07,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:13:07,990 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 07:13:12,768 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 07:13:12,768 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 07:13:12,777 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 07:13:12,777 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 07:13:12,785 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 07:13:12,901 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 07:13:12,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124358154] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:13:12,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:13:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 07:13:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090931642] [2024-04-05 07:13:12,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:13:12,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 07:13:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 07:13:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=795, Unknown=9, NotChecked=58, Total=992 [2024-04-05 07:13:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:12,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:12,903 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 07:13:12,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:12,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:12,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:12,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:13:14,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-04-05 07:13:14,437 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 07:13:14,438 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 07:13:14,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -755467422, now seen corresponding path program 1 times [2024-04-05 07:13:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917550939] [2024-04-05 07:13:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:15,376 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 07:13:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917550939] [2024-04-05 07:13:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917550939] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:13:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347462014] [2024-04-05 07:13:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:13:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:15,377 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 07:13:15,379 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 07:13:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:15,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 07:13:15,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:13:15,605 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:13:15,606 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 07:13:15,694 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:13:15,694 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 07:13:15,890 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 07:13:15,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:13:15,980 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 07:13:16,286 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 07:13:16,296 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 07:13:16,316 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 07:13:16,322 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 07:13:16,438 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 07:13:16,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:13:17,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:13:17,135 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 07:13:17,139 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 07:13:17,148 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 07:13:17,580 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 07:13:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347462014] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:13:17,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:13:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 07:13:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93074299] [2024-04-05 07:13:17,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:13:17,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 07:13:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 07:13:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=741, Unknown=3, NotChecked=0, Total=870 [2024-04-05 07:13:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:17,582 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:17,582 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 07:13:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:13:17,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:13:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:13:19,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-04-05 07:13:19,239 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 07:13:19,240 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 07:13:19,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 435043912, now seen corresponding path program 1 times [2024-04-05 07:13:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380023377] [2024-04-05 07:13:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:20,526 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 07:13:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380023377] [2024-04-05 07:13:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380023377] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:13:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027856747] [2024-04-05 07:13:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:20,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:13:20,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:20,527 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 07:13:20,529 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 07:13:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:20,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-05 07:13:20,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:13:20,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:13:20,847 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 07:13:20,926 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 07:13:21,206 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 07:13:21,210 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 07:13:21,461 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:13:21,461 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 07:13:21,816 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:13:21,816 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 07:13:22,085 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:13:22,085 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 07:13:22,360 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 07:13:22,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:13:25,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (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) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |c_thr1Thread1of5ForFork0_~vn~0#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|))) (or (= 4294967295 (mod .cse1 4294967296)) (< (mod (select (select (store (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|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse8 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse10 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse0)))) is different from false [2024-04-05 07:13:26,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= (mod (select .cse6 |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) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of5ForFork0_~v~0#1| 1))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse3 4294967296)))))))) (not .cse7)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1412 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (or (= (mod .cse8 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse10 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1412) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse7)))) is different from false [2024-04-05 07:13:26,085 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) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| 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 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= (mod .cse0 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |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 07:13:26,138 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) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| 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 |thr1Thread1of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse3 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= (mod .cse0 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |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 07:13:27,987 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 07:13:27,988 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 72259 treesize of output 69152 [2024-04-05 07:13:28,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:13:28,100 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 637 treesize of output 651 [2024-04-05 07:13:28,127 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 07:13:28,145 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 07:13:28,534 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 07:13:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 26 refuted. 14 times theorem prover too weak. 15 trivial. 12 not checked. [2024-04-05 07:13:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027856747] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:13:30,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:13:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 20] total 54 [2024-04-05 07:13:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127878369] [2024-04-05 07:13:30,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:13:30,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-04-05 07:13:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-04-05 07:13:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2058, Unknown=60, NotChecked=396, Total=2862 [2024-04-05 07:13:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:30,724 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:30,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.777777777777778) internal successors, (258), 54 states have internal predecessors, (258), 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 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:13:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:13:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:13:34,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-04-05 07:13:34,839 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 07:13:34,840 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 07:13:34,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1686100594, now seen corresponding path program 1 times [2024-04-05 07:13:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312470894] [2024-04-05 07:13:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:35,944 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 07:13:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312470894] [2024-04-05 07:13:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312470894] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:13:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838582543] [2024-04-05 07:13:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:13:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:35,945 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 07:13:35,947 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 07:13:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:36,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 07:13:36,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:13:36,222 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:13:36,222 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 07:13:36,431 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:13:36,431 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 07:13:36,702 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 07:13:36,880 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 07:13:36,880 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 07:13:37,190 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 07:13:37,316 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:13:37,316 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 07:13:37,672 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 07:13:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:13:37,696 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 07:13:37,702 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 07:13:37,840 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 07:13:37,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:13:38,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:13:38,580 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 07:13:38,585 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 07:13:38,594 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 07:13:39,271 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 07:13:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838582543] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:13:39,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:13:39,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-04-05 07:13:39,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126642672] [2024-04-05 07:13:39,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:13:39,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 07:13:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:13:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 07:13:39,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2024-04-05 07:13:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:39,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:13:39,273 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 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 07:13:39,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:13:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:13:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:13:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:13:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:13:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:13:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:13:41,640 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 07:13:41,839 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 07:13:41,842 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 07:13:41,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:13:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1793026736, now seen corresponding path program 1 times [2024-04-05 07:13:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:13:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701691558] [2024-04-05 07:13:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:13:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:44,110 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 07:13:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:13:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701691558] [2024-04-05 07:13:44,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701691558] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:13:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132619239] [2024-04-05 07:13:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:13:44,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:13:44,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:13:44,112 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 07:13:44,113 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 07:13:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:13:44,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 07:13:44,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:13:44,608 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:13:44,608 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 07:13:44,756 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 07:13:44,878 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:13:44,878 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 07:13:45,231 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 07:13:45,840 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 07:13:46,568 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:13:46,568 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 07:13:47,039 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 07:13:47,039 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 07:13:47,740 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:13:47,741 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 07:13:48,242 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 07:13:48,242 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 07:13:48,777 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 07:13:48,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:14:02,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse5 (+ .cse12 1))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_46 (Array Int Int)) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_46))) (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 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse4 4294967296) .cse5))))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse8 (store (select .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse6 4294967296) .cse5) (< (mod (select (select (store (let ((.cse7 (store (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |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 07:14:23,332 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)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1590 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#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_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store (store .cse10 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590)) (.cse1 (select .cse8 |c_~#value~0.offset|))) (let ((.cse7 (store .cse5 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse3 (store (select .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse0 (select .cse6 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread3of5ForFork0_~#casret~0#1.base|) |thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) |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 07:14:26,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:15:00,624 WARN L293 SmtUtils]: Spent 32.71s 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 07:15:00,624 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 07:15:00,632 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 35073675 treesize of output 34320726 [2024-04-05 07:15:01,884 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 07:15:01,885 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 30929 treesize of output 29951 [2024-04-05 07:15:02,070 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 4174 treesize of output 4166 [2024-04-05 07:15:02,131 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 787 treesize of output 727 [2024-04-05 07:15:02,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:15:02,319 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 07:15:02,360 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 07:15:04,223 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 07:15:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 27 refuted. 28 times theorem prover too weak. 4 trivial. 8 not checked. [2024-04-05 07:15:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132619239] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:15:04,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:15:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 25] total 72 [2024-04-05 07:15:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774753288] [2024-04-05 07:15:04,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:15:04,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-04-05 07:15:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:15:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-04-05 07:15:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=4096, Unknown=134, NotChecked=274, Total=5112 [2024-04-05 07:15:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:04,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:15:04,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.236111111111111) internal successors, (305), 72 states have internal predecessors, (305), 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 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:15:04,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:15:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 07:15:15,420 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 07:15:15,611 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 07:15:15,611 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 07:15:15,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:15:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1163445853, now seen corresponding path program 1 times [2024-04-05 07:15:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:15:15,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194554814] [2024-04-05 07:15:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:15:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:15:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:15:16,373 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 07:15:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:15:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194554814] [2024-04-05 07:15:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194554814] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:15:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826812668] [2024-04-05 07:15:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:15:16,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:15:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:15:16,374 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 07:15:16,375 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 07:15:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:15:16,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 07:15:16,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:15:16,667 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:15:16,667 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 07:15:16,755 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:15:16,755 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 07:15:16,897 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 07:15:16,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:15:16,987 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 07:15:17,115 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 07:15:17,188 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:15:17,188 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 07:15:17,299 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 07:15:17,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:15:17,352 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 07:15:17,581 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 07:15:17,590 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 07:15:17,740 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 07:15:17,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:15:18,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:15:18,153 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 07:15:18,155 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 07:15:18,162 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 07:15:18,758 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 07:15:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826812668] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:15:18,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:15:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-04-05 07:15:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010645490] [2024-04-05 07:15:18,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:15:18,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-05 07:15:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:15:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-05 07:15:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2024-04-05 07:15:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:18,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:15:18,761 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 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 07:15:18,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:15:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-05 07:15:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 07:15:22,969 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 07:15:23,169 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 07:15:23,169 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 07:15:23,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:15:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 614498696, now seen corresponding path program 1 times [2024-04-05 07:15:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:15:23,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447824895] [2024-04-05 07:15:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:15:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:15:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:15:25,940 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 07:15:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:15:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447824895] [2024-04-05 07:15:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447824895] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:15:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393824301] [2024-04-05 07:15:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:15:25,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:15:25,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:15:25,942 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 07:15:25,944 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 07:15:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:15:26,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-05 07:15:26,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:15:26,420 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 07:15:26,421 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 07:15:26,555 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 07:15:26,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 07:15:26,624 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 07:15:26,951 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 07:15:27,343 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 07:15:27,343 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 07:15:27,882 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:15:27,882 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 07:15:28,291 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:15:28,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 07:15:28,854 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:15:28,854 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 07:15:29,254 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:15:29,255 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 07:15:29,834 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 07:15:29,834 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 07:15:30,221 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 07:15:30,222 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 07:15:30,396 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 07:15:30,488 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 07:15:30,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:15:30,727 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 07:15:52,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (+ .cse24 1)) (.cse14 (= (mod (select .cse13 |c_~#value~0.offset|) 4294967296) .cse24))) (and (or (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))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 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|) 0 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) .cse3) (< (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)))))))))))) (not .cse14)) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_54 (Array Int 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))) (let ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_54))) (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|) 0 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 (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< (mod .cse20 4294967296) (+ (mod .cse21 4294967296) 1)))))))))))) .cse14)))) is different from false [2024-04-05 07:15:55,095 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))) (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse13 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse1))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse5 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse3 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse7 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |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 .cse7 4294967296) (+ (mod .cse8 4294967296) 1))))))))))))))) is different from false [2024-04-05 07:15:55,256 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))) (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse13 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse1))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse5 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse3 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse7 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |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 .cse7 4294967296) (+ (mod .cse8 4294967296) 1))))))))))))))) is different from false [2024-04-05 07:15:55,462 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))) (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|) 0 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 07:16:01,782 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))) (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 ((.cse8 (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| (+ .cse8 1)))) (let ((.cse6 (store (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base| .cse13))) (let ((.cse7 (store (select .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store .cse12 |c_~#value~0.base| .cse13) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse9 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse3 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse9 1))))) (let ((.cse1 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse10 |thr1Thread3of5ForFork0_~#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 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |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 (store .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)) (< (mod .cse5 4294967296) (+ (mod .cse9 4294967296) 1))))))))))))))))) is different from false [2024-04-05 07:20:50,908 WARN L293 SmtUtils]: Spent 4.34m on a formula simplification. DAG size of input: 90 DAG size of output: 54 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 07:20:50,908 INFO L349 Elim1Store]: treesize reduction 100, result has 46.2 percent of original size [2024-04-05 07:20:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 1677547498 treesize of output 1578102223 [2024-04-05 07:21:20,123 WARN L293 SmtUtils]: Spent 29.14s on a formula simplification. DAG size of input: 16735 DAG size of output: 1070 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-05 07:21:24,723 INFO L349 Elim1Store]: treesize reduction 100, result has 46.2 percent of original size [2024-04-05 07:21:24,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 558074 treesize of output 542817 [2024-04-05 07:21:41,601 WARN L293 SmtUtils]: Spent 16.87s on a formula simplification. DAG size of input: 1569 DAG size of output: 824 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-05 07:21:44,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 07:21:44,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 352887 treesize of output 352957 [2024-04-05 07:22:00,818 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 843 DAG size of output: 707 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-05 07:22:03,555 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 324712 treesize of output 324708 Received shutdown request... [2024-04-05 07:22:05,357 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 07:22:05,357 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 07:22:05,357 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 07:22:05,357 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 07:22:05,357 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 07:22:05,357 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 07:22:05,357 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 07:22:05,363 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-04-05 07:22:05,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-04-05 07:22:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:22:05,569 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 127 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-35-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-1 context. [2024-04-05 07:22:05,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-05 07:22:05,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-04-05 07:22:05,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-04-05 07:22:05,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-05 07:22:05,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-05 07:22:05,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-05 07:22:05,571 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 07:22:05,574 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 5 thread instances [2024-04-05 07:22:05,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 07:22:05,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 07:22:05 BasicIcfg [2024-04-05 07:22:05,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 07:22:05,577 INFO L158 Benchmark]: Toolchain (without parser) took 856127.12ms. Allocated memory was 239.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 167.1MB in the beginning and 892.7MB in the end (delta: -725.6MB). Peak memory consumption was 892.9MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,577 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 239.1MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 07:22:05,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.85ms. Allocated memory is still 239.1MB. Free memory was 167.1MB in the beginning and 147.1MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 239.1MB. Free memory was 147.1MB in the beginning and 145.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,577 INFO L158 Benchmark]: Boogie Preprocessor took 27.73ms. Allocated memory is still 239.1MB. Free memory was 145.0MB in the beginning and 144.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,577 INFO L158 Benchmark]: RCFGBuilder took 478.17ms. Allocated memory is still 239.1MB. Free memory was 143.6MB in the beginning and 124.1MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,578 INFO L158 Benchmark]: TraceAbstraction took 855172.61ms. Allocated memory was 239.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.0MB in the beginning and 892.7MB in the end (delta: -769.7MB). Peak memory consumption was 848.9MB. Max. memory is 8.0GB. [2024-04-05 07:22:05,578 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 239.1MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 393.85ms. Allocated memory is still 239.1MB. Free memory was 167.1MB in the beginning and 147.1MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.57ms. Allocated memory is still 239.1MB. Free memory was 147.1MB in the beginning and 145.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.73ms. Allocated memory is still 239.1MB. Free memory was 145.0MB in the beginning and 144.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 478.17ms. Allocated memory is still 239.1MB. Free memory was 143.6MB in the beginning and 124.1MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 855172.61ms. Allocated memory was 239.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.0MB in the beginning and 892.7MB in the end (delta: -769.7MB). Peak memory consumption was 848.9MB. 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 170, independent conditional: 21, independent unconditional: 149, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 170, independent conditional: 21, independent unconditional: 149, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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: 72, independent: 72, independent conditional: 1, independent unconditional: 71, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 467, independent conditional: 68, independent unconditional: 399, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 1, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 1, Positive unconditional cache size: 71, 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: 72, independent: 72, independent conditional: 1, independent unconditional: 71, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 467, independent conditional: 68, independent unconditional: 399, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 1, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 1, Positive unconditional cache size: 71, 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: 120, independent: 120, independent conditional: 7, independent unconditional: 113, 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: 120, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 909, independent conditional: 130, independent unconditional: 779, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 120, unknown conditional: 7, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 7, Positive unconditional cache size: 113, 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: 120, independent: 120, independent conditional: 7, independent unconditional: 113, 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: 120, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 909, independent conditional: 130, independent unconditional: 779, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 120, unknown conditional: 7, unknown unconditional: 113] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 7, Positive unconditional cache size: 113, 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: 145, independent: 145, independent conditional: 1, independent unconditional: 144, 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: 145, independent: 145, independent conditional: 0, independent unconditional: 145, 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: 1541, independent conditional: 227, independent unconditional: 1314, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 145, unknown conditional: 1, unknown unconditional: 144] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 1, Positive unconditional cache size: 144, 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: 145, independent: 145, independent conditional: 1, independent unconditional: 144, 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: 145, independent: 145, independent conditional: 0, independent unconditional: 145, 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: 1541, independent conditional: 227, independent unconditional: 1314, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 145, unknown conditional: 1, unknown unconditional: 144] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 1, Positive unconditional cache size: 144, 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 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2326, independent: 1891, independent conditional: 1806, independent unconditional: 85, dependent: 435, dependent conditional: 417, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1891, independent: 1891, independent conditional: 1806, independent unconditional: 85, 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: 1891, independent: 1891, independent conditional: 1806, independent unconditional: 85, 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: 1891, independent: 1891, independent conditional: 1806, independent unconditional: 85, 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: 1891, independent: 1891, independent conditional: 498, independent unconditional: 1393, 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: 1891, independent: 1891, independent conditional: 239, independent unconditional: 1652, 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: 1891, independent: 1891, independent conditional: 239, independent unconditional: 1652, 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: 211, independent: 211, independent conditional: 12, independent unconditional: 199, 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: 211, independent: 211, independent conditional: 0, independent unconditional: 211, 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: 1891, independent: 1680, independent conditional: 227, independent unconditional: 1453, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 211, unknown conditional: 12, unknown unconditional: 199] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 211, Positive conditional cache size: 12, Positive unconditional cache size: 199, 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: 259, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1891, independent: 1891, independent conditional: 498, independent unconditional: 1393, 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: 1891, independent: 1891, independent conditional: 239, independent unconditional: 1652, 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: 1891, independent: 1891, independent conditional: 239, independent unconditional: 1652, 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: 211, independent: 211, independent conditional: 12, independent unconditional: 199, 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: 211, independent: 211, independent conditional: 0, independent unconditional: 211, 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: 1891, independent: 1680, independent conditional: 227, independent unconditional: 1453, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 211, unknown conditional: 12, unknown unconditional: 199] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 211, Positive conditional cache size: 12, Positive unconditional cache size: 199, 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: 259 ], Independence queries for same thread: 435 - TimeoutResultAtElement [Line: 736]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 127 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-35-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 730]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 127 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-35-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-62-2-2-2-2-3-2-2-2-3-2-3-2-2-3-2-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 70 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 92 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 431 ConstructedInterpolants, 47 QuantifiedInterpolants, 4853 SizeOfPredicates, 16 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 57/89 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 964 ConstructedInterpolants, 315 QuantifiedInterpolants, 25945 SizeOfPredicates, 53 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 182/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 269.1s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 23.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 243.6s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1686 ConstructedInterpolants, 569 QuantifiedInterpolants, 176745 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1539 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 445/830 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 541.4s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 24.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 111.6s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1856 ConstructedInterpolants, 450 QuantifiedInterpolants, 72256 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1689 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 819/1160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown