/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 DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 01:12:40,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 01:12:40,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 01:12:40,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 01:12:40,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 01:12:40,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 01:12:40,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 01:12:40,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 01:12:40,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 01:12:40,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 01:12:40,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 01:12:40,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 01:12:40,517 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 01:12:40,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 01:12:40,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 01:12:40,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 01:12:40,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 01:12:40,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 01:12:40,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 01:12:40,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 01:12:40,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 01:12:40,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 01:12:40,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 01:12:40,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 01:12:40,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 01:12:40,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 01:12:40,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 01:12:40,522 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 01:12:40,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 01:12:40,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:12:40,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 01:12:40,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 01:12:40,524 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 01:12:40,524 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 -> DEFAULT [2024-04-04 01:12:40,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 01:12:40,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 01:12:40,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 01:12:40,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 01:12:40,753 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 01:12:40,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-04-04 01:12:41,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 01:12:42,036 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 01:12:42,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-04-04 01:12:42,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/500ff047d/48e0ef89e79a46b481dc9d1fdb975b16/FLAGbb684d304 [2024-04-04 01:12:42,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/500ff047d/48e0ef89e79a46b481dc9d1fdb975b16 [2024-04-04 01:12:42,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 01:12:42,065 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 01:12:42,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 01:12:42,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 01:12:42,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 01:12:42,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54686c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42, skipping insertion in model container [2024-04-04 01:12:42,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,115 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 01:12:42,336 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/04_incdec_cas.i[30285,30298] [2024-04-04 01:12:42,341 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/04_incdec_cas.i[30729,30742] [2024-04-04 01:12:42,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:12:42,351 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 01:12:42,377 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/04_incdec_cas.i[30285,30298] [2024-04-04 01:12:42,380 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/04_incdec_cas.i[30729,30742] [2024-04-04 01:12:42,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:12:42,406 INFO L206 MainTranslator]: Completed translation [2024-04-04 01:12:42,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42 WrapperNode [2024-04-04 01:12:42,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 01:12:42,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 01:12:42,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 01:12:42,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 01:12:42,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,452 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-04-04 01:12:42,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 01:12:42,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 01:12:42,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 01:12:42,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 01:12:42,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 01:12:42,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 01:12:42,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 01:12:42,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 01:12:42,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (1/1) ... [2024-04-04 01:12:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:12:42,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:42,521 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-04 01:12:42,535 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-04 01:12:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 01:12:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-04 01:12:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-04 01:12:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 01:12:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 01:12:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 01:12:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 01:12:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 01:12:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 01:12:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 01:12:42,562 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 01:12:42,677 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 01:12:42,678 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 01:12:42,854 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 01:12:43,068 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 01:12:43,068 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-04 01:12:43,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:12:43 BoogieIcfgContainer [2024-04-04 01:12:43,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 01:12:43,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 01:12:43,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 01:12:43,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 01:12:43,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 01:12:42" (1/3) ... [2024-04-04 01:12:43,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e09319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:12:43, skipping insertion in model container [2024-04-04 01:12:43,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:12:42" (2/3) ... [2024-04-04 01:12:43,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e09319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:12:43, skipping insertion in model container [2024-04-04 01:12:43,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:12:43" (3/3) ... [2024-04-04 01:12:43,076 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2024-04-04 01:12:43,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 01:12:43,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 01:12:43,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-04 01:12:43,091 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 01:12:43,168 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:12:43,208 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:12:43,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:12:43,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:43,213 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-04 01:12:43,214 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-04 01:12:43,239 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:12:43,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:43,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:12:43,254 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;@4c82f6cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 01:12:43,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-04 01:12:43,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 01:12:43,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2069504969, now seen corresponding path program 1 times [2024-04-04 01:12:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094958049] [2024-04-04 01:12:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:43,646 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-04 01:12:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094958049] [2024-04-04 01:12:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094958049] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:12:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90965007] [2024-04-04 01:12:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:43,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 01:12:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 01:12:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 01:12:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:43,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:43,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04 01:12:43,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:43,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 01:12:43,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 01:12:43,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1930054108, now seen corresponding path program 1 times [2024-04-04 01:12:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439915169] [2024-04-04 01:12:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:44,159 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-04 01:12:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439915169] [2024-04-04 01:12:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439915169] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 01:12:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257152414] [2024-04-04 01:12:44,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:44,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 01:12:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 01:12:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-04-04 01:12:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:44,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-04 01:12:44,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:44,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:44,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 01:12:44,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 01:12:44,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash 379580625, now seen corresponding path program 1 times [2024-04-04 01:12:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853541440] [2024-04-04 01:12:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:45,031 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-04 01:12:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853541440] [2024-04-04 01:12:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853541440] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:45,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-04 01:12:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595909364] [2024-04-04 01:12:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:45,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-04 01:12:45,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-04 01:12:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-04 01:12:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:45,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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-04 01:12:45,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:45,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:45,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 01:12:45,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 01:12:45,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1174053011, now seen corresponding path program 1 times [2024-04-04 01:12:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816870771] [2024-04-04 01:12:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:12:45,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:12:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:12:45,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-04 01:12:45,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-04 01:12:45,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-04 01:12:45,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-04 01:12:45,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-04 01:12:45,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-04 01:12:45,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-04 01:12:45,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-04 01:12:45,288 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-04 01:12:45,289 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-04 01:12:45,290 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-04 01:12:45,330 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:12:45,333 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:12:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:12:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:45,480 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-04 01:12:45,481 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-04 01:12:45,485 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:12:45,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:45,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:12:45,486 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;@4c82f6cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 01:12:45,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-04 01:12:45,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:45,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -77191831, now seen corresponding path program 1 times [2024-04-04 01:12:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077027423] [2024-04-04 01:12:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:45,528 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-04 01:12:45,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077027423] [2024-04-04 01:12:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077027423] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:45,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:12:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259386413] [2024-04-04 01:12:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:45,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 01:12:45,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 01:12:45,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 01:12:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:45,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04 01:12:45,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-04 01:12:45,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:45,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -277568332, now seen corresponding path program 1 times [2024-04-04 01:12:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557124159] [2024-04-04 01:12:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:45,690 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-04 01:12:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557124159] [2024-04-04 01:12:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557124159] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:45,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-04 01:12:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120430556] [2024-04-04 01:12:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:45,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 01:12:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 01:12:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-04-04 01:12:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:45,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-04 01:12:45,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:45,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-04 01:12:45,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:45,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1129166833, now seen corresponding path program 1 times [2024-04-04 01:12:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956716124] [2024-04-04 01:12:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:46,319 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-04 01:12:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956716124] [2024-04-04 01:12:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956716124] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-04 01:12:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939270948] [2024-04-04 01:12:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:46,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-04 01:12:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-04 01:12:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-04 01:12:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:46,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:46,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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-04 01:12:46,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:46,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:46,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:46,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-04 01:12:46,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:46,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1137574501, now seen corresponding path program 1 times [2024-04-04 01:12:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:46,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175645602] [2024-04-04 01:12:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:47,299 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-04 01:12:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175645602] [2024-04-04 01:12:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175645602] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:12:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968660921] [2024-04-04 01:12:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:12:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:47,323 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-04 01:12:47,401 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-04 01:12:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:47,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2024-04-04 01:12:47,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:12:47,685 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-04 01:12:47,686 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-04 01:12:47,747 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-04 01:12:47,856 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-04 01:12:47,856 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-04 01:12:48,053 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:12:48,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:12:48,060 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 14 treesize of output 11 [2024-04-04 01:12:48,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:12:48,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:12:48,185 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 0 case distinctions, treesize of input 28 treesize of output 11 [2024-04-04 01:12:48,187 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 5 treesize of output 3 [2024-04-04 01:12:48,275 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-04 01:12:48,338 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-04 01:12:48,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:12:48,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_132) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-04 01:12:49,316 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 238 treesize of output 234 [2024-04-04 01:12:49,326 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 102 treesize of output 98 [2024-04-04 01:12:49,330 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 98 treesize of output 90 [2024-04-04 01:12:49,480 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-04 01:12:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968660921] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:12:49,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:12:49,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 38 [2024-04-04 01:12:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314920482] [2024-04-04 01:12:49,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:12:49,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-04-04 01:12:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-04-04 01:12:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1164, Unknown=16, NotChecked=70, Total=1406 [2024-04-04 01:12:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:49,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:49,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.0) internal successors, (228), 38 states have internal predecessors, (228), 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-04 01:12:49,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:49,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:49,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:49,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-04 01:12:50,830 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-04 01:12:51,014 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-04 01:12:51,015 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:51,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1699917811, now seen corresponding path program 1 times [2024-04-04 01:12:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:51,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108681203] [2024-04-04 01:12:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:51,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:52,313 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-04 01:12:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:52,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108681203] [2024-04-04 01:12:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108681203] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:12:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769415528] [2024-04-04 01:12:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:12:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:52,315 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-04 01:12:52,357 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-04 01:12:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:52,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 32 conjunts are in the unsatisfiable core [2024-04-04 01:12:52,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:12:52,501 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-04 01:12:52,502 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-04 01:12:52,655 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-04 01:12:52,655 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-04 01:12:52,839 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-04 01:12:52,979 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-04 01:12:52,980 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-04 01:12:53,168 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:12:53,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 165 [2024-04-04 01:12:53,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-04-04 01:12:53,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:12:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2024-04-04 01:12:53,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:12:53,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:12:53,297 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-04-04 01:12:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 67 [2024-04-04 01:12:53,309 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-04 01:12:53,321 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-04 01:12:53,368 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-04 01:12:53,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:12:53,757 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 99 treesize of output 71 [2024-04-04 01:12:53,766 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 66 treesize of output 62 [2024-04-04 01:12:54,086 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-04 01:12:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769415528] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:12:54,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:12:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 40 [2024-04-04 01:12:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567668779] [2024-04-04 01:12:54,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:12:54,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-04-04 01:12:54,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:54,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-04-04 01:12:54,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1428, Unknown=4, NotChecked=0, Total=1640 [2024-04-04 01:12:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:54,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.6) internal successors, (224), 41 states have internal predecessors, (224), 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-04 01:12:54,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:54,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:54,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:54,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-04 01:12:54,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:12:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-04 01:12:55,092 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-04 01:12:55,285 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-04 01:12:55,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:12:55,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -967849354, now seen corresponding path program 1 times [2024-04-04 01:12:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:55,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384602067] [2024-04-04 01:12:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:12:55,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:12:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:12:55,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-04 01:12:55,390 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-04 01:12:55,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-04-04 01:12:55,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-04 01:12:55,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-04-04 01:12:55,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-04-04 01:12:55,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-04 01:12:55,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-04 01:12:55,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-04 01:12:55,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-04 01:12:55,391 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-04 01:12:55,392 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-04 01:12:55,392 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-04 01:12:55,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:12:55,451 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:12:55,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:12:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:55,466 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-04 01:12:55,471 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:12:55,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:55,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:12:55,472 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;@4c82f6cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 01:12:55,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-04-04 01:12:55,485 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-04 01:12:55,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:12:55,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1980909382, now seen corresponding path program 1 times [2024-04-04 01:12:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:55,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525013818] [2024-04-04 01:12:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:55,505 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-04 01:12:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525013818] [2024-04-04 01:12:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525013818] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:12:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524145823] [2024-04-04 01:12:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:55,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 01:12:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 01:12:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 01:12:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:55,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04 01:12:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-04 01:12:55,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:12:55,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1231836820, now seen corresponding path program 1 times [2024-04-04 01:12:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272585815] [2024-04-04 01:12:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:55,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:55,743 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-04 01:12:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272585815] [2024-04-04 01:12:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272585815] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-04 01:12:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102242057] [2024-04-04 01:12:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:55,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 01:12:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 01:12:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-04-04 01:12:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,745 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 01:12:55,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:55,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-04 01:12:55,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:12:55,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1263854286, now seen corresponding path program 1 times [2024-04-04 01:12:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156860118] [2024-04-04 01:12:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:56,189 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-04 01:12:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156860118] [2024-04-04 01:12:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156860118] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:12:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:12:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-04 01:12:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252768291] [2024-04-04 01:12:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:12:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-04 01:12:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-04 01:12:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-04 01:12:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:56,191 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:56,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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-04 01:12:56,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:56,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:12:56,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-04 01:12:56,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:12:56,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1802366523, now seen corresponding path program 1 times [2024-04-04 01:12:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431132137] [2024-04-04 01:12:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:56,890 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-04 01:12:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:12:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431132137] [2024-04-04 01:12:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431132137] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:12:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709883125] [2024-04-04 01:12:56,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:12:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:12:56,893 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-04 01:12:56,928 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-04 01:12:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:12:57,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-04 01:12:57,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:12:57,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-04 01:12:57,122 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-04 01:12:57,171 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-04 01:12:57,258 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-04 01:12:57,258 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-04 01:12:57,445 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:12:57,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:12:57,451 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 14 treesize of output 11 [2024-04-04 01:12:57,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:12:57,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:12:57,544 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-04 01:12:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:12:57,746 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 21 treesize of output 16 [2024-04-04 01:12:57,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 5 treesize of output 3 [2024-04-04 01:12:57,884 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-04 01:12:57,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:12:57,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_324) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-04 01:12:58,650 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 238 treesize of output 234 [2024-04-04 01:12:58,660 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 102 treesize of output 94 [2024-04-04 01:12:58,664 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 94 treesize of output 90 [2024-04-04 01:12:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2024-04-04 01:12:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709883125] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:12:58,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:12:58,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2024-04-04 01:12:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024410060] [2024-04-04 01:12:58,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:12:58,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-04-04 01:12:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:12:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-04-04 01:12:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1141, Unknown=18, NotChecked=70, Total=1406 [2024-04-04 01:12:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:58,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:12:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.421052631578948) internal successors, (244), 38 states have internal predecessors, (244), 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-04 01:12:58,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:58,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:58,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:58,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:12:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:12:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:12:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-04 01:12:59,558 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-04 01:12:59,755 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-04 01:12:59,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:12:59,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:12:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash -982120653, now seen corresponding path program 1 times [2024-04-04 01:12:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:12:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192158134] [2024-04-04 01:12:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:12:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:12:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:13:00,710 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-04 01:13:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:13:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192158134] [2024-04-04 01:13:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192158134] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:13:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637259078] [2024-04-04 01:13:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:13:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:13:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:13:00,712 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-04 01:13:00,744 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-04 01:13:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:13:00,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2024-04-04 01:13:00,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:13:00,963 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:13:00,963 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-04 01:13:00,985 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-04 01:13:01,052 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:13:01,052 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-04 01:13:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:13:01,277 INFO L349 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2024-04-04 01:13:01,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 268 [2024-04-04 01:13:01,300 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 22 treesize of output 18 [2024-04-04 01:13:01,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:13:01,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:13:01,394 INFO L349 Elim1Store]: treesize reduction 81, result has 17.3 percent of original size [2024-04-04 01:13:01,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 93 [2024-04-04 01:13:01,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-04 01:13:01,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2024-04-04 01:13:01,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2024-04-04 01:13:01,704 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-04-04 01:13:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 289 treesize of output 266 [2024-04-04 01:13:01,758 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-04-04 01:13:01,758 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 2 case distinctions, treesize of input 21 treesize of output 11 [2024-04-04 01:13:01,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:13:01,840 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 0 case distinctions, treesize of input 43 treesize of output 19 [2024-04-04 01:13:01,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:13:01,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-04-04 01:13:02,710 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-04 01:13:03,703 INFO L349 Elim1Store]: treesize reduction 80, result has 51.5 percent of original size [2024-04-04 01:13:03,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 379 treesize of output 408 [2024-04-04 01:13:03,717 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 138 treesize of output 136 [2024-04-04 01:13:03,739 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 5 treesize of output 3 [2024-04-04 01:13:12,544 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 5 treesize of output 3 [2024-04-04 01:13:12,578 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 5 treesize of output 3 [2024-04-04 01:13:13,458 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-04 01:13:13,475 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-04 01:13:13,719 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:13:13,720 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 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:13:13,725 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 14 treesize of output 11 [2024-04-04 01:13:13,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:13:13,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:13:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-04 01:13:13,802 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-04 01:13:13,870 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-04 01:13:13,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:13:14,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_390 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_390))) (store .cse1 |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse0)))) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) is different from false [2024-04-04 01:13:17,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod |c_thr1Thread1of3ForFork0_inc_#t~mem8#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_387 Int) (|~#inc_flag~0.base| Int) (v_ArrVal_390 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (|v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_387) |v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26|) 0)) (let ((.cse2 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_388))) (let ((.cse0 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (let ((.cse1 (store .cse2 |~#inc_flag~0.base| v_ArrVal_390))) (store .cse1 |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse0 1)))) |v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) .cse3) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_387 Int) (|~#inc_flag~0.base| Int) (v_ArrVal_390 (Array Int Int)) (|thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (|v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26| Int)) (or (let ((.cse8 (store |c_#memory_int| |~#inc_flag~0.base| v_ArrVal_384))) (let ((.cse6 (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_#t~mem8#1| 1)))) (let ((.cse7 (store .cse8 |c_~#value~0.base| .cse6))) (let ((.cse5 (store (select .cse7 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1))) (let ((.cse4 (select (select (store (store .cse7 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_388) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_388) |~#inc_flag~0.base| v_ArrVal_390) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_388) |~#inc_flag~0.base| v_ArrVal_390) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26| v_DerPreprocessor_31) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_387) |v_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base_26|) 0)))) (not .cse3)))) is different from false [2024-04-04 01:13:53,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 01:13:53,500 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 59484 treesize of output 57084 [2024-04-04 01:13:53,552 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 241 treesize of output 219 [2024-04-04 01:13:53,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 407 [2024-04-04 01:13:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 0 trivial. 2 not checked. [2024-04-04 01:13:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637259078] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:13:59,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:13:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2024-04-04 01:13:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120952291] [2024-04-04 01:13:59,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:13:59,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-04 01:13:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:13:59,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-04 01:13:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2137, Unknown=59, NotChecked=198, Total=2756 [2024-04-04 01:13:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:13:59,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:13:59,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.980769230769231) internal successors, (207), 53 states have internal predecessors, (207), 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-04 01:13:59,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:13:59,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:13:59,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:13:59,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-04 01:13:59,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-04 01:14:05,101 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-04 01:14:05,301 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-04 01:14:05,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:14:05,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -957582506, now seen corresponding path program 1 times [2024-04-04 01:14:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599516198] [2024-04-04 01:14:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:06,793 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-04 01:14:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599516198] [2024-04-04 01:14:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599516198] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:14:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602324876] [2024-04-04 01:14:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:06,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:14:06,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:14:06,796 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-04 01:14:06,797 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-04 01:14:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:06,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 41 conjunts are in the unsatisfiable core [2024-04-04 01:14:06,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:14:07,091 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:14:07,091 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-04 01:14:07,140 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-04 01:14:07,258 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:14:07,258 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-04 01:14:07,399 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:14:07,399 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 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:14:07,405 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 14 treesize of output 11 [2024-04-04 01:14:07,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:14:07,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:14:07,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-04 01:14:07,496 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-04-04 01:14:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 36 [2024-04-04 01:14:07,505 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 5 treesize of output 3 [2024-04-04 01:14:07,546 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3)) (let ((.cse0 (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 1)) (.cse1 (= |c_~#inc_flag~0.base| 3))) (or (and (exists ((v_DerPreprocessor_34 (Array Int Int))) (= (select (select (store (store |c_#memory_int| 3 v_DerPreprocessor_34) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|)) 3) |c_~#value~0.offset|) 1)) .cse0 .cse1) (and .cse0 (not .cse1))))) is different from true [2024-04-04 01:14:07,590 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (let ((.cse0 (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 1))) (or (and (exists ((v_DerPreprocessor_34 (Array Int Int))) (= (select (select (store (store |c_#memory_int| 3 v_DerPreprocessor_34) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|)) 3) |c_~#value~0.offset|) 1)) .cse0) (and .cse0 (not (= |c_~#inc_flag~0.base| 3))))) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3))) is different from true [2024-04-04 01:14:07,689 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-04 01:14:08,114 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-04 01:14:08,114 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 56 treesize of output 56 [2024-04-04 01:14:08,119 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 30 treesize of output 28 [2024-04-04 01:14:08,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-04 01:14:08,304 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-04 01:14:08,620 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:14:08,620 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 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:14:08,627 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 14 treesize of output 11 [2024-04-04 01:14:08,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:14:08,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-04 01:14:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:14:08,720 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 0 case distinctions, treesize of input 28 treesize of output 11 [2024-04-04 01:14:08,724 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 5 treesize of output 3 [2024-04-04 01:14:08,892 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-04 01:14:09,079 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-04 01:14:09,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:14:09,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_478) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-04 01:14:18,049 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 105 treesize of output 101 [2024-04-04 01:14:18,057 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 60 treesize of output 56 [2024-04-04 01:14:18,062 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 85 treesize of output 81 [2024-04-04 01:14:18,068 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 26 treesize of output 24 [2024-04-04 01:14:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-04-04 01:14:24,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602324876] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:14:24,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:14:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 20] total 55 [2024-04-04 01:14:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555855638] [2024-04-04 01:14:24,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:14:24,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-04-04 01:14:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-04-04 01:14:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2328, Unknown=30, NotChecked=306, Total=2970 [2024-04-04 01:14:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:24,123 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:24,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.490909090909091) internal successors, (302), 55 states have internal predecessors, (302), 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-04 01:14:24,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:24,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:24,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:24,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:24,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-04 01:14:24,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-04 01:14:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-04 01:14:30,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-04-04 01:14:30,304 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-04 01:14:30,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:14:30,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1161757199, now seen corresponding path program 1 times [2024-04-04 01:14:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106073219] [2024-04-04 01:14:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:14:33,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:33,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106073219] [2024-04-04 01:14:33,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106073219] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:14:33,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454558581] [2024-04-04 01:14:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:33,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:14:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:14:33,341 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-04 01:14:33,341 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-04 01:14:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:33,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 34 conjunts are in the unsatisfiable core [2024-04-04 01:14:33,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:14:33,661 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:14:33,662 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-04 01:14:33,798 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:14:33,798 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-04 01:14:34,023 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-04 01:14:34,239 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-04 01:14:34,239 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-04 01:14:34,498 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-04 01:14:34,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-04 01:14:34,692 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-04 01:14:35,425 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:14:35,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 165 [2024-04-04 01:14:35,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-04-04 01:14:35,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-04-04 01:14:35,626 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 0 case distinctions, treesize of input 69 treesize of output 48 [2024-04-04 01:14:36,398 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-04 01:14:36,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:14:37,713 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 99 treesize of output 71 [2024-04-04 01:14:37,722 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 74 treesize of output 70 [2024-04-04 01:14:39,363 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-04 01:14:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454558581] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:14:39,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:14:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11, 11] total 49 [2024-04-04 01:14:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898170476] [2024-04-04 01:14:39,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:14:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-04-04 01:14:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-04-04 01:14:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2181, Unknown=0, NotChecked=0, Total=2450 [2024-04-04 01:14:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:39,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:39,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 6.612244897959184) internal successors, (324), 50 states have internal predecessors, (324), 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-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-04 01:14:39,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-04-04 01:14:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-04 01:14:44,159 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-04 01:14:44,349 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-04 01:14:44,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-04-04 01:14:44,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1232779623, now seen corresponding path program 1 times [2024-04-04 01:14:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983688318] [2024-04-04 01:14:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:14:44,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:14:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:14:44,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-04 01:14:44,515 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-04 01:14:44,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-04-04 01:14:44,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-04-04 01:14:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-04 01:14:44,519 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-04 01:14:44,519 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-04 01:14:44,519 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-04 01:14:44,569 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:14:44,571 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:14:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:14:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:14:44,586 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-04 01:14:44,590 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:14:44,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:44,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:14:44,590 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;@4c82f6cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 01:14:44,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-04-04 01:14:44,593 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-04 01:14:44,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:14:44,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1950665702, now seen corresponding path program 1 times [2024-04-04 01:14:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755877450] [2024-04-04 01:14:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:44,632 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-04 01:14:44,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:44,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755877450] [2024-04-04 01:14:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755877450] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:14:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:14:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:14:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943112535] [2024-04-04 01:14:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:14:44,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 01:14:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 01:14:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 01:14:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:44,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04 01:14:44,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-04 01:14:44,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:14:44,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 183363900, now seen corresponding path program 1 times [2024-04-04 01:14:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731538422] [2024-04-04 01:14:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:44,907 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-04 01:14:44,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731538422] [2024-04-04 01:14:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731538422] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:14:44,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:14:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-04 01:14:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314158501] [2024-04-04 01:14:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:14:44,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 01:14:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:44,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 01:14:44,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-04-04 01:14:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:44,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 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-04 01:14:44,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:44,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:14:45,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-04 01:14:45,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:14:45,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1363873554, now seen corresponding path program 1 times [2024-04-04 01:14:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:45,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873508703] [2024-04-04 01:14:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:45,894 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-04 01:14:45,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:45,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873508703] [2024-04-04 01:14:45,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873508703] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:14:45,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:14:45,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-04 01:14:45,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259652659] [2024-04-04 01:14:45,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:14:45,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-04 01:14:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-04 01:14:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-04 01:14:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:45,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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-04 01:14:45,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:45,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-04 01:14:45,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:46,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-04 01:14:46,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:14:46,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 843477389, now seen corresponding path program 1 times [2024-04-04 01:14:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:46,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665373038] [2024-04-04 01:14:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:47,463 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-04 01:14:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665373038] [2024-04-04 01:14:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665373038] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:14:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191158582] [2024-04-04 01:14:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:14:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:14:47,486 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-04 01:14:47,511 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-04 01:14:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:47,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 32 conjunts are in the unsatisfiable core [2024-04-04 01:14:47,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:14:47,885 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-04 01:14:47,886 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-04 01:14:48,033 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-04 01:14:48,259 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-04 01:14:48,259 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-04 01:14:48,699 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-04 01:14:48,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-04 01:14:48,718 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 14 treesize of output 11 [2024-04-04 01:14:48,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:14:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:14:48,900 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 0 case distinctions, treesize of input 35 treesize of output 16 [2024-04-04 01:14:49,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:14:49,505 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 21 treesize of output 16 [2024-04-04 01:14:49,515 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 5 treesize of output 3 [2024-04-04 01:14:49,934 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-04 01:14:50,314 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-04 01:14:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-04-04 01:14:50,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:14:50,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_729) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-04 01:14:53,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2024-04-04 01:14:53,198 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-04 01:14:53,204 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-04 01:14:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 24 not checked. [2024-04-04 01:14:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191158582] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:14:53,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:14:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2024-04-04 01:14:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073119216] [2024-04-04 01:14:53,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:14:53,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-04-04 01:14:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:14:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-04-04 01:14:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1144, Unknown=17, NotChecked=70, Total=1406 [2024-04-04 01:14:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:53,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:14:53,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.842105263157896) internal successors, (374), 38 states have internal predecessors, (374), 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-04 01:14:53,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:53,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:53,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:53,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:14:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:14:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:14:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:14:56,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-04-04 01:14:56,532 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-04 01:14:56,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:14:56,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:14:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -139843853, now seen corresponding path program 1 times [2024-04-04 01:14:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:14:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676733619] [2024-04-04 01:14:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:14:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:58,065 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-04 01:14:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:14:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676733619] [2024-04-04 01:14:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676733619] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:14:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282912415] [2024-04-04 01:14:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:14:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:14:58,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:14:58,067 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-04 01:14:58,074 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-04 01:14:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:14:58,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-04 01:14:58,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:14:59,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:14:59,603 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2024-04-04 01:14:59,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 60 [2024-04-04 01:14:59,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-04 01:15:00,787 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2024-04-04 01:15:00,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2024-04-04 01:15:02,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 61 [2024-04-04 01:15:02,357 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 0 case distinctions, treesize of input 51 treesize of output 50 [2024-04-04 01:15:03,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2024-04-04 01:15:05,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:15:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:15:05,048 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-04 01:15:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-04-04 01:15:05,056 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 0 case distinctions, treesize of input 12 treesize of output 15 [2024-04-04 01:15:05,092 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 14 treesize of output 11 [2024-04-04 01:15:05,651 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2024-04-04 01:15:05,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2024-04-04 01:15:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:15:06,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:15:06,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-04-04 01:15:06,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:15:06,553 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 14 treesize of output 11 [2024-04-04 01:15:07,036 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-04 01:15:07,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:15:09,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 Int) (|thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (|v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793))) (let ((.cse3 (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse3 4294967296))) (or (= .cse0 4294967295) (< .cse0 (mod (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |c_~#inc_flag~0.base| v_ArrVal_796))) (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse3 1)))))) (store .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| (store (select .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) |thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_792) |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) 0))))))) is different from false [2024-04-04 01:15:09,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 Int) (|thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_793 (Array Int Int)) (|v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| Int) (v_ArrVal_796 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793))) (let ((.cse3 (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse3 4294967296))) (or (= .cse0 4294967295) (< .cse0 (mod (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |c_~#inc_flag~0.base| v_ArrVal_796))) (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse3 1)))))) (store .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| (store (select .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) |thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_792) |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) 0))))))) is different from false [2024-04-04 01:15:12,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (|~#inc_flag~0.offset| Int) (v_ArrVal_792 Int) (|thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| Int) (|thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_ArrVal_793 (Array Int Int)) (|v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| Int) (v_ArrVal_796 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_787)) (.cse7 (+ 1 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (let ((.cse3 (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) (.cse2 (store (select (let ((.cse6 (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| 1)))) (store .cse6 |c_~#value~0.base| (store (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset| .cse7))) |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.offset| 1))) (let ((.cse4 (select (select (store (store (store .cse5 |c_~#value~0.base| .cse3) |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_792) |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) 0)) (= 4294967295 .cse0) (< .cse0 (mod (select (select (let ((.cse1 (store (store (store (store |c_#memory_int| |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#inc_flag~0.base| v_ArrVal_796) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |c_thr1Thread1of4ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#inc_flag~0.base| v_ArrVal_796) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse4 1))))) (store .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26| (store (select .cse1 |v_thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.base_26|) |thr1Thread2of4ForFork0_inc_~#inc__casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2024-04-04 01:15:18,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:18,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:18,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:20,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:20,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:23,435 INFO L349 Elim1Store]: treesize reduction 214, result has 26.2 percent of original size [2024-04-04 01:15:23,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 26187479 treesize of output 24695985 [2024-04-04 01:15:25,075 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2024-04-04 01:15:25,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 17189 treesize of output 17121 [2024-04-04 01:15:25,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:25,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:25,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:15:25,813 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-04 01:15:25,814 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 1717 treesize of output 1715 [2024-04-04 01:15:26,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 5126 treesize of output 4846 [2024-04-04 01:15:26,211 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 5025 treesize of output 4983 [2024-04-04 01:15:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 0 trivial. 2 not checked. [2024-04-04 01:15:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282912415] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 01:15:49,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 01:15:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26, 23] total 68 [2024-04-04 01:15:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837090176] [2024-04-04 01:15:49,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 01:15:49,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-04-04 01:15:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:15:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-04-04 01:15:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=3595, Unknown=61, NotChecked=390, Total=4692 [2024-04-04 01:15:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:15:49,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:15:49,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.514705882352941) internal successors, (239), 69 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 01:15:49,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:15:49,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:15:49,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:15:49,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:15:49,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:15:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:15:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-04 01:15:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:15:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-04 01:15:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-04-04 01:15:57,985 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-04 01:15:58,179 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-04 01:15:58,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-04-04 01:15:58,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:15:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1733277758, now seen corresponding path program 1 times [2024-04-04 01:15:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:15:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239946599] [2024-04-04 01:15:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:15:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:15:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:16:00,332 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-04 01:16:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:16:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239946599] [2024-04-04 01:16:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239946599] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:16:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23845216] [2024-04-04 01:16:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:16:00,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:16:00,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:16:00,336 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-04 01:16:00,337 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-04 01:16:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:16:00,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 56 conjunts are in the unsatisfiable core [2024-04-04 01:16:00,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:16:00,765 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-04 01:16:00,766 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-04 01:16:00,954 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-04 01:16:01,275 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-04 01:16:01,276 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-04 01:16:01,977 INFO L349 Elim1Store]: treesize reduction 91, result has 31.6 percent of original size [2024-04-04 01:16:01,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 177 [2024-04-04 01:16:02,100 INFO L349 Elim1Store]: treesize reduction 67, result has 21.2 percent of original size [2024-04-04 01:16:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 113 [2024-04-04 01:16:02,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:16:02,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-04 01:16:02,322 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-04-04 01:16:02,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 194 [2024-04-04 01:16:02,594 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 92 treesize of output 85 [2024-04-04 01:16:02,677 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-04-04 01:16:02,684 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-04 01:16:02,884 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-04 01:16:02,884 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-04 01:16:02,887 INFO L158 Benchmark]: Toolchain (without parser) took 200822.32ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 814.7MB). Free memory was 124.9MB in the beginning and 833.3MB in the end (delta: -708.5MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,887 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 191.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 01:16:02,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.00ms. Allocated memory is still 191.9MB. Free memory was 124.8MB in the beginning and 155.9MB in the end (delta: -31.1MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 191.9MB. Free memory was 155.9MB in the beginning and 153.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,888 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 191.9MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,888 INFO L158 Benchmark]: RCFGBuilder took 585.87ms. Allocated memory is still 191.9MB. Free memory was 151.7MB in the beginning and 115.0MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,888 INFO L158 Benchmark]: TraceAbstraction took 199815.07ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 814.7MB). Free memory was 114.0MB in the beginning and 833.3MB in the end (delta: -719.4MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. [2024-04-04 01:16:02,889 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.45ms. Allocated memory is still 191.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.00ms. Allocated memory is still 191.9MB. Free memory was 124.8MB in the beginning and 155.9MB in the end (delta: -31.1MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 191.9MB. Free memory was 155.9MB in the beginning and 153.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 191.9MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 585.87ms. Allocated memory is still 191.9MB. Free memory was 151.7MB in the beginning and 115.0MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 199815.07ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 814.7MB). Free memory was 114.0MB in the beginning and 833.3MB in the end (delta: -719.4MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 438, independent: 354, independent conditional: 296, independent unconditional: 58, dependent: 84, dependent conditional: 68, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 296, independent unconditional: 58, 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: 354, independent: 354, independent conditional: 296, independent unconditional: 58, 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: 354, independent: 354, independent conditional: 296, independent unconditional: 58, 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: 354, independent: 354, independent conditional: 56, independent unconditional: 298, 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: 354, independent: 354, independent conditional: 21, independent unconditional: 333, 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: 354, independent: 354, independent conditional: 21, independent unconditional: 333, 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: 87, independent: 87, independent conditional: 2, independent unconditional: 85, 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: 87, independent: 87, independent conditional: 0, independent unconditional: 87, 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: 354, independent: 267, independent conditional: 19, independent unconditional: 248, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 87, unknown conditional: 2, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 87, Positive conditional cache size: 2, Positive unconditional cache size: 85, 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: 35, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 56, independent unconditional: 298, 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: 354, independent: 354, independent conditional: 21, independent unconditional: 333, 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: 354, independent: 354, independent conditional: 21, independent unconditional: 333, 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: 87, independent: 87, independent conditional: 2, independent unconditional: 85, 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: 87, independent: 87, independent conditional: 0, independent unconditional: 87, 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: 354, independent: 267, independent conditional: 19, independent unconditional: 248, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 87, unknown conditional: 2, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 87, Positive conditional cache size: 2, Positive unconditional cache size: 85, 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: 35 ], Independence queries for same thread: 84 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1090, independent: 917, independent conditional: 805, independent unconditional: 112, dependent: 173, dependent conditional: 153, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 917, independent: 917, independent conditional: 805, independent unconditional: 112, 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: 917, independent: 917, independent conditional: 805, independent unconditional: 112, 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: 917, independent: 917, independent conditional: 805, independent unconditional: 112, 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: 917, independent: 917, independent conditional: 181, independent unconditional: 736, 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: 917, independent: 917, independent conditional: 68, independent unconditional: 849, 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: 917, independent: 917, independent conditional: 68, independent unconditional: 849, 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: 113, independent: 113, independent conditional: 2, independent unconditional: 111, 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: 113, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 917, independent: 804, independent conditional: 66, independent unconditional: 738, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, 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: 113, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 917, independent: 917, independent conditional: 181, independent unconditional: 736, 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: 917, independent: 917, independent conditional: 68, independent unconditional: 849, 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: 917, independent: 917, independent conditional: 68, independent unconditional: 849, 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: 113, independent: 113, independent conditional: 2, independent unconditional: 111, 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: 113, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 917, independent: 804, independent conditional: 66, independent unconditional: 738, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, 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: 113 ], Independence queries for same thread: 173 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2079, independent: 1773, independent conditional: 1601, independent unconditional: 172, dependent: 306, dependent conditional: 282, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1773, independent: 1773, independent conditional: 1601, independent unconditional: 172, 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: 1773, independent: 1773, independent conditional: 1601, independent unconditional: 172, 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: 1773, independent: 1773, independent conditional: 1601, independent unconditional: 172, 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: 1773, independent: 1773, independent conditional: 393, independent unconditional: 1380, 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: 1773, independent: 1773, independent conditional: 146, independent unconditional: 1627, 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: 1773, independent: 1773, independent conditional: 146, independent unconditional: 1627, 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: 167, independent: 167, independent conditional: 2, independent unconditional: 165, 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: 167, independent: 167, independent conditional: 0, independent unconditional: 167, 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: 1773, independent: 1606, independent conditional: 144, independent unconditional: 1462, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 167, unknown conditional: 2, unknown unconditional: 165] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 2, Positive unconditional cache size: 165, 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: 247, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1773, independent: 1773, independent conditional: 393, independent unconditional: 1380, 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: 1773, independent: 1773, independent conditional: 146, independent unconditional: 1627, 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: 1773, independent: 1773, independent conditional: 146, independent unconditional: 1627, 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: 167, independent: 167, independent conditional: 2, independent unconditional: 165, 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: 167, independent: 167, independent conditional: 0, independent unconditional: 167, 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: 1773, independent: 1606, independent conditional: 144, independent unconditional: 1462, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 167, unknown conditional: 2, unknown unconditional: 165] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 2, Positive unconditional cache size: 165, 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: 247 ], Independence queries for same thread: 306 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-04 01:16:02,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2024-04-04 01:16:03,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-04-04 01:16:03,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-04-04 01:16:03,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-04 01:16:03,902 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-04 01:16:03,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...