/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 22:18:19,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 22:18:19,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 22:18:19,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 22:18:19,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 22:18:19,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 22:18:19,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 22:18:19,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 22:18:19,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 22:18:19,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 22:18:19,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 22:18:19,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 22:18:19,911 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 22:18:19,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 22:18:19,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 22:18:19,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 22:18:19,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 22:18:19,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 22:18:19,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 22:18:19,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 22:18:19,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 22:18:19,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 22:18:19,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 22:18:19,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 22:18:19,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 22:18:19,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 22:18:19,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 22:18:19,915 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 22:18:19,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 22:18:19,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 22:18:19,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 22:18:19,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 22:18:19,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 22:18:19,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 22:18:19,917 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 22:18:19,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 22:18:19,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 22:18:19,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 22:18:19,917 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 22:18:19,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 22:18:20,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 22:18:20,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 22:18:20,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 22:18:20,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 22:18:20,167 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 22:18:20,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-05-07 22:18:21,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 22:18:21,415 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 22:18:21,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-05-07 22:18:21,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ef553d4ce/ac57b46751a04b838006b76e1dc2310e/FLAGda6bf6aac [2024-05-07 22:18:21,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ef553d4ce/ac57b46751a04b838006b76e1dc2310e [2024-05-07 22:18:21,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 22:18:21,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 22:18:21,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 22:18:21,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 22:18:21,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 22:18:21,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 10:18:21" (1/1) ... [2024-05-07 22:18:21,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546909e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:21, skipping insertion in model container [2024-05-07 22:18:21,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 10:18:21" (1/1) ... [2024-05-07 22:18:21,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 22:18:21,912 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i[41323,41336] [2024-05-07 22:18:21,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 22:18:21,965 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 22:18:22,007 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i[41323,41336] [2024-05-07 22:18:22,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 22:18:22,088 WARN L675 CHandler]: The function g is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 22:18:22,095 INFO L206 MainTranslator]: Completed translation [2024-05-07 22:18:22,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22 WrapperNode [2024-05-07 22:18:22,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 22:18:22,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 22:18:22,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 22:18:22,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 22:18:22,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,167 INFO L138 Inliner]: procedures = 274, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-05-07 22:18:22,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 22:18:22,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 22:18:22,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 22:18:22,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 22:18:22,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 22:18:22,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 22:18:22,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 22:18:22,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 22:18:22,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (1/1) ... [2024-05-07 22:18:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 22:18:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:22,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:22,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 22:18:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 22:18:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 22:18:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 22:18:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 22:18:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 22:18:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 22:18:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 22:18:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-07 22:18:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-07 22:18:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 22:18:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 22:18:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 22:18:22,287 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 22:18:22,423 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 22:18:22,424 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 22:18:22,585 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 22:18:22,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 22:18:22,642 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2024-05-07 22:18:22,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 10:18:22 BoogieIcfgContainer [2024-05-07 22:18:22,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 22:18:22,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 22:18:22,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 22:18:22,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 22:18:22,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 10:18:21" (1/3) ... [2024-05-07 22:18:22,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d42ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 10:18:22, skipping insertion in model container [2024-05-07 22:18:22,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 10:18:22" (2/3) ... [2024-05-07 22:18:22,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d42ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 10:18:22, skipping insertion in model container [2024-05-07 22:18:22,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 10:18:22" (3/3) ... [2024-05-07 22:18:22,651 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2024-05-07 22:18:22,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 22:18:22,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 22:18:22,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 22:18:22,667 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 22:18:22,716 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-07 22:18:22,761 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:22,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:22,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 22:18:22,811 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:22,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:22,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:22,835 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:22,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:22,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:22,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 374295123, now seen corresponding path program 1 times [2024-05-07 22:18:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307034568] [2024-05-07 22:18:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:22,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307034568] [2024-05-07 22:18:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307034568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385328156] [2024-05-07 22:18:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:23,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,140 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:23,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:23,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 22:18:23,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:23,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1877096707, now seen corresponding path program 1 times [2024-05-07 22:18:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953969399] [2024-05-07 22:18:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:23,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:23,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:23,266 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:23,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:23,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:23,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 22:18:23,277 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-07 22:18:23,279 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:23,279 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-07 22:18:23,307 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 22:18:23,311 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:23,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:23,348 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-05-07 22:18:23,368 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-05-07 22:18:23,371 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:23,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:23,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:23,373 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:23,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:23,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:23,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1699779948, now seen corresponding path program 1 times [2024-05-07 22:18:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155884274] [2024-05-07 22:18:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 22:18:23,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:23,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155884274] [2024-05-07 22:18:23,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155884274] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:23,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:23,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:23,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573846976] [2024-05-07 22:18:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:23,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,513 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:23,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,729 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 1030 treesize of output 934 [2024-05-07 22:18:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045156, now seen corresponding path program 1 times [2024-05-07 22:18:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:23,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:23,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-05-07 22:18:23,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:23,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1280751276, now seen corresponding path program 1 times [2024-05-07 22:18:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229841390] [2024-05-07 22:18:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229841390] [2024-05-07 22:18:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229841390] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 22:18:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947031477] [2024-05-07 22:18:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 22:18:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:24,398 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:24,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 296 treesize of output 268 [2024-05-07 22:18:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045156, now seen corresponding path program 2 times [2024-05-07 22:18:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:26,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 22:18:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 22:18:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:26,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:26,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:26,726 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:26,728 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 576 treesize of output 524 [2024-05-07 22:18:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045156, now seen corresponding path program 3 times [2024-05-07 22:18:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:26,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 22:18:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-05-07 22:18:26,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:26,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 575583817, now seen corresponding path program 1 times [2024-05-07 22:18:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396064434] [2024-05-07 22:18:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396064434] [2024-05-07 22:18:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396064434] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 22:18:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339697575] [2024-05-07 22:18:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 22:18:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:27,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 22:18:27,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 22:18:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:27,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-07 22:18:27,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 22:18:27,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-07 22:18:27,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:18:27,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 22:18:27,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:18:27,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 22:18:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:18:27,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 22:18:27,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:18:27,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 22:18:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:27,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 22:18:27,650 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_170) |c_~#gm~0.base|) |c_~#gm~0.offset|) 0))) is different from false [2024-05-07 22:18:27,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 22:18:27,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-05-07 22:18:27,763 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 65 treesize of output 57 [2024-05-07 22:18:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 5 times theorem prover too weak. 0 trivial. 5 not checked. [2024-05-07 22:18:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339697575] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 22:18:27,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 22:18:27,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-05-07 22:18:27,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844080144] [2024-05-07 22:18:27,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 22:18:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-07 22:18:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-07 22:18:27,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=224, Unknown=2, NotChecked=32, Total=342 [2024-05-07 22:18:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:27,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:27,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:27,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:27,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 22:18:27,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 22:18:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 22:18:28,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 22:18:28,390 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-05-07 22:18:28,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:28,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1427066090, now seen corresponding path program 1 times [2024-05-07 22:18:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109585775] [2024-05-07 22:18:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:28,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:28,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:28,429 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:28,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:28,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:28,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-07 22:18:28,430 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-05-07 22:18:28,431 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:28,431 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-05-07 22:18:28,451 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-07 22:18:28,459 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:28,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:28,466 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:28,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:28,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:28,467 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:28,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:28,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-07 22:18:28,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:28,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 192347814, now seen corresponding path program 1 times [2024-05-07 22:18:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:28,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804253885] [2024-05-07 22:18:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-07 22:18:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804253885] [2024-05-07 22:18:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804253885] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573125051] [2024-05-07 22:18:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:28,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:28,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:28,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:28,643 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 262 treesize of output 238 [2024-05-07 22:18:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 1 times [2024-05-07 22:18:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:28,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:28,806 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 506 treesize of output 458 [2024-05-07 22:18:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 589722510, now seen corresponding path program 1 times [2024-05-07 22:18:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:29,252 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:29,253 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 540 treesize of output 488 [2024-05-07 22:18:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 2 times [2024-05-07 22:18:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:29,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:29,411 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:29,412 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 296 treesize of output 268 [2024-05-07 22:18:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash 673103727, now seen corresponding path program 1 times [2024-05-07 22:18:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:29,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:30,034 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:30,034 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 514 treesize of output 462 [2024-05-07 22:18:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 3 times [2024-05-07 22:18:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:30,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-07 22:18:30,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:30,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1454984234, now seen corresponding path program 1 times [2024-05-07 22:18:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956130932] [2024-05-07 22:18:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-07 22:18:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956130932] [2024-05-07 22:18:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956130932] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:30,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 22:18:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051953418] [2024-05-07 22:18:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:30,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 22:18:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:30,565 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:30,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 498 [2024-05-07 22:18:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 4 times [2024-05-07 22:18:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:30,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 22:18:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:30,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:30,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:30,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:30,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:30,852 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:30,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 22:18:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 5 times [2024-05-07 22:18:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-05-07 22:18:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 22:18:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable17 [2024-05-07 22:18:31,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:31,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash 420067488, now seen corresponding path program 1 times [2024-05-07 22:18:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104625133] [2024-05-07 22:18:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:31,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:31,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:31,269 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:31,269 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:31,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:31,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-07 22:18:31,270 INFO L448 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-05-07 22:18:31,270 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:31,270 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-05-07 22:18:31,291 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-07 22:18:31,294 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:31,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:31,308 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-05-07 22:18:31,313 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:31,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:31,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:31,314 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:31,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:31,324 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-05-07 22:18:31,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:31,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1378155713, now seen corresponding path program 1 times [2024-05-07 22:18:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81617832] [2024-05-07 22:18:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-07 22:18:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81617832] [2024-05-07 22:18:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81617832] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844598971] [2024-05-07 22:18:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:31,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:31,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:31,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:31,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:31,452 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:31,453 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 270 treesize of output 246 [2024-05-07 22:18:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 1 times [2024-05-07 22:18:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:31,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:31,580 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:31,580 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 532 treesize of output 484 [2024-05-07 22:18:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 194466180, now seen corresponding path program 1 times [2024-05-07 22:18:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:31,980 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:31,980 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 278 treesize of output 250 [2024-05-07 22:18:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 2 times [2024-05-07 22:18:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:32,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:32,159 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:32,159 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 1038 treesize of output 938 [2024-05-07 22:18:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 144113478, now seen corresponding path program 1 times [2024-05-07 22:18:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:32,681 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:32,682 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 278 treesize of output 250 [2024-05-07 22:18:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 3 times [2024-05-07 22:18:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:32,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:33,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 22:18:33,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:33,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash -126720901, now seen corresponding path program 1 times [2024-05-07 22:18:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520283622] [2024-05-07 22:18:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-05-07 22:18:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:33,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520283622] [2024-05-07 22:18:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520283622] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 22:18:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558511301] [2024-05-07 22:18:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:33,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 22:18:33,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:33,311 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:33,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 22:18:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 4 times [2024-05-07 22:18:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:33,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:33,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 22:18:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:33,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:33,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:33,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:33,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:33,614 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:33,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:18:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 5 times [2024-05-07 22:18:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:33,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:33,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:33,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-05-07 22:18:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 22:18:34,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33 [2024-05-07 22:18:34,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:34,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1833313532, now seen corresponding path program 1 times [2024-05-07 22:18:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411723234] [2024-05-07 22:18:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:34,049 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:34,049 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:34,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:34,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-07 22:18:34,052 INFO L448 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-05-07 22:18:34,052 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:34,052 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-05-07 22:18:34,083 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-05-07 22:18:34,085 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:34,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:34,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:34,118 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:34,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:34,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:34,119 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:34,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:34,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:34,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-07 22:18:34,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1186794371, now seen corresponding path program 1 times [2024-05-07 22:18:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:34,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453754466] [2024-05-07 22:18:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-07 22:18:34,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453754466] [2024-05-07 22:18:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453754466] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:34,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889354183] [2024-05-07 22:18:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:34,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:34,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:34,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:34,253 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 1030 treesize of output 934 [2024-05-07 22:18:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 1 times [2024-05-07 22:18:34,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,381 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:34,382 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 550 treesize of output 502 [2024-05-07 22:18:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash -130422284, now seen corresponding path program 1 times [2024-05-07 22:18:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:34,824 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:34,825 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 1064 treesize of output 964 [2024-05-07 22:18:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 2 times [2024-05-07 22:18:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:34,977 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:34,977 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 558 treesize of output 506 [2024-05-07 22:18:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1671811121, now seen corresponding path program 1 times [2024-05-07 22:18:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:35,487 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:35,487 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 576 treesize of output 524 [2024-05-07 22:18:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 3 times [2024-05-07 22:18:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:35,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:36,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:36,143 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 511 treesize of output 489 [2024-05-07 22:18:36,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:36,159 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 71 treesize of output 69 [2024-05-07 22:18:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 76098321, now seen corresponding path program 1 times [2024-05-07 22:18:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:36,782 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:36,782 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 514 treesize of output 462 [2024-05-07 22:18:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 4 times [2024-05-07 22:18:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:37,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 22:18:37,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:37,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1900711786, now seen corresponding path program 1 times [2024-05-07 22:18:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737088334] [2024-05-07 22:18:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:37,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:37,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:37,287 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:37,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:37,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:37,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-07 22:18:37,288 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:37,288 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:37,288 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-05-07 22:18:37,311 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-05-07 22:18:37,313 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:37,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:37,335 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:37,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:37,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:37,335 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:37,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:37,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-05-07 22:18:37,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:37,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -431343718, now seen corresponding path program 1 times [2024-05-07 22:18:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407110323] [2024-05-07 22:18:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-07 22:18:37,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:37,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407110323] [2024-05-07 22:18:37,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407110323] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:37,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:37,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152162407] [2024-05-07 22:18:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:37,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:37,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:37,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:37,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:37,486 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 262 treesize of output 238 [2024-05-07 22:18:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 1 times [2024-05-07 22:18:37,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:37,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:37,601 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:37,601 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 270 treesize of output 246 [2024-05-07 22:18:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -692925988, now seen corresponding path program 1 times [2024-05-07 22:18:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:37,990 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:37,990 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 540 treesize of output 488 [2024-05-07 22:18:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 2 times [2024-05-07 22:18:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:38,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:38,134 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:38,135 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 270 treesize of output 242 [2024-05-07 22:18:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1662653961, now seen corresponding path program 1 times [2024-05-07 22:18:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:38,649 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:38,649 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 270 treesize of output 242 [2024-05-07 22:18:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 3 times [2024-05-07 22:18:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:38,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:39,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:39,432 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 547 treesize of output 525 [2024-05-07 22:18:39,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:18:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1755112426, now seen corresponding path program 1 times [2024-05-07 22:18:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:40,212 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:40,213 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 550 treesize of output 498 [2024-05-07 22:18:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 4 times [2024-05-07 22:18:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:40,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable48,SelfDestructingSolverStorable59,SelfDestructingSolverStorable49 [2024-05-07 22:18:40,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:40,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1492413374, now seen corresponding path program 1 times [2024-05-07 22:18:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306248455] [2024-05-07 22:18:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:40,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:40,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:40,896 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:40,896 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:40,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:40,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-07 22:18:40,897 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:40,897 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:40,897 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-05-07 22:18:40,988 INFO L144 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-05-07 22:18:40,990 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:40,993 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:41,019 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:41,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:41,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:41,019 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:41,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:41,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:41,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -244800296, now seen corresponding path program 1 times [2024-05-07 22:18:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804872565] [2024-05-07 22:18:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-05-07 22:18:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-05-07 22:18:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:41,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804872565] [2024-05-07 22:18:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804872565] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:41,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127278807] [2024-05-07 22:18:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:41,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:41,086 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:41,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:41,163 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:41,164 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 270 treesize of output 246 [2024-05-07 22:18:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 1 times [2024-05-07 22:18:41,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:41,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:41,276 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:41,276 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 532 treesize of output 484 [2024-05-07 22:18:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash -630777171, now seen corresponding path program 1 times [2024-05-07 22:18:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:41,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:41,621 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:41,622 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 278 treesize of output 250 [2024-05-07 22:18:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 2 times [2024-05-07 22:18:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:41,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:41,760 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:41,760 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 514 treesize of output 462 [2024-05-07 22:18:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -829798111, now seen corresponding path program 1 times [2024-05-07 22:18:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:42,233 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:42,234 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 278 treesize of output 250 [2024-05-07 22:18:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 3 times [2024-05-07 22:18:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:42,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:42,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:42,941 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 511 treesize of output 489 [2024-05-07 22:18:42,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:42,952 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 71 treesize of output 69 [2024-05-07 22:18:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1947292791, now seen corresponding path program 1 times [2024-05-07 22:18:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:43,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:43,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:43,513 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:43,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 22:18:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 4 times [2024-05-07 22:18:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable61,SelfDestructingSolverStorable72,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-05-07 22:18:44,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:44,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1948108625, now seen corresponding path program 1 times [2024-05-07 22:18:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379183232] [2024-05-07 22:18:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:44,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:44,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:44,328 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:44,328 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-07 22:18:44,329 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:44,329 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:44,329 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-05-07 22:18:44,356 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-05-07 22:18:44,358 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:44,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:44,396 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:44,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:44,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:44,396 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:44,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:44,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-05-07 22:18:44,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:44,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1359184393, now seen corresponding path program 1 times [2024-05-07 22:18:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968990224] [2024-05-07 22:18:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-07 22:18:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968990224] [2024-05-07 22:18:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968990224] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109314717] [2024-05-07 22:18:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:44,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:44,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:44,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:44,529 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:44,530 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 550 treesize of output 502 [2024-05-07 22:18:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 1 times [2024-05-07 22:18:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:44,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:44,652 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:44,653 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 514 treesize of output 466 [2024-05-07 22:18:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -514436760, now seen corresponding path program 1 times [2024-05-07 22:18:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:44,959 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:44,959 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 278 treesize of output 250 [2024-05-07 22:18:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 2 times [2024-05-07 22:18:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:45,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:45,114 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:45,115 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 270 treesize of output 242 [2024-05-07 22:18:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash -801195652, now seen corresponding path program 1 times [2024-05-07 22:18:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:45,683 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:45,684 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 278 treesize of output 250 [2024-05-07 22:18:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 3 times [2024-05-07 22:18:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:45,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:46,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:46,321 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 511 treesize of output 489 [2024-05-07 22:18:46,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:46,335 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 71 treesize of output 69 [2024-05-07 22:18:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 994305511, now seen corresponding path program 1 times [2024-05-07 22:18:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:46,917 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:46,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:18:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 4 times [2024-05-07 22:18:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:47,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:47,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable74,SelfDestructingSolverStorable85,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-05-07 22:18:47,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:47,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1464070939, now seen corresponding path program 1 times [2024-05-07 22:18:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:47,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027489574] [2024-05-07 22:18:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:47,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:47,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:47,849 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:47,849 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:47,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-07 22:18:47,850 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:47,850 WARN L233 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:47,850 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-05-07 22:18:47,896 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-05-07 22:18:47,899 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:47,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:47,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:47,901 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-05-07 22:18:47,918 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:47,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:47,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:47,918 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:47,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:47,933 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-05-07 22:18:47,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:47,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -418205769, now seen corresponding path program 1 times [2024-05-07 22:18:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10615780] [2024-05-07 22:18:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:47,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-07 22:18:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10615780] [2024-05-07 22:18:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10615780] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:47,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:47,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199416682] [2024-05-07 22:18:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:47,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:47,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:47,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:47,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:48,065 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:48,066 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 514 treesize of output 466 [2024-05-07 22:18:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 1 times [2024-05-07 22:18:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:48,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:48,178 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:48,178 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 514 treesize of output 466 [2024-05-07 22:18:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash 731616166, now seen corresponding path program 1 times [2024-05-07 22:18:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:48,525 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:48,525 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 1046 treesize of output 946 [2024-05-07 22:18:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 2 times [2024-05-07 22:18:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:48,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:48,685 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:48,685 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 1046 treesize of output 946 [2024-05-07 22:18:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -996485954, now seen corresponding path program 1 times [2024-05-07 22:18:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:48,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:49,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:49,208 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:49,208 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 278 treesize of output 250 [2024-05-07 22:18:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 3 times [2024-05-07 22:18:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:49,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:50,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:50,521 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 511 treesize of output 489 [2024-05-07 22:18:50,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:50,533 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 71 treesize of output 69 [2024-05-07 22:18:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1907340383, now seen corresponding path program 1 times [2024-05-07 22:18:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:50,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:51,346 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:18:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 4 times [2024-05-07 22:18:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:52,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable87,SelfDestructingSolverStorable98,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2024-05-07 22:18:52,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:52,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -258648329, now seen corresponding path program 1 times [2024-05-07 22:18:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105399779] [2024-05-07 22:18:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:52,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:52,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:52,420 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:52,420 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:52,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:52,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-05-07 22:18:52,421 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:52,421 WARN L233 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:52,421 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-05-07 22:18:52,458 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-05-07 22:18:52,462 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:52,496 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:52,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-05-07 22:18:52,509 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:52,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:52,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:52,510 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:52,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:52,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:52,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash -823150632, now seen corresponding path program 1 times [2024-05-07 22:18:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737500697] [2024-05-07 22:18:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-05-07 22:18:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737500697] [2024-05-07 22:18:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737500697] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028145182] [2024-05-07 22:18:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:52,601 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:52,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:52,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:52,670 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:52,670 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 514 treesize of output 466 [2024-05-07 22:18:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 1 times [2024-05-07 22:18:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:52,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:52,780 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 262 treesize of output 238 [2024-05-07 22:18:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -958119808, now seen corresponding path program 1 times [2024-05-07 22:18:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:53,066 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:53,067 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 278 treesize of output 250 [2024-05-07 22:18:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 2 times [2024-05-07 22:18:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:53,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:53,206 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:18:53,206 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 270 treesize of output 242 [2024-05-07 22:18:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1442743236, now seen corresponding path program 1 times [2024-05-07 22:18:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:53,786 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:53,787 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 1046 treesize of output 946 [2024-05-07 22:18:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 3 times [2024-05-07 22:18:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:53,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:54,912 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 259 treesize of output 235 [2024-05-07 22:18:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1841006416, now seen corresponding path program 1 times [2024-05-07 22:18:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:55,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:55,655 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:18:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 4 times [2024-05-07 22:18:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:18:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:56,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable104,SelfDestructingSolverStorable105,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable111,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-05-07 22:18:56,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:56,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -641492752, now seen corresponding path program 1 times [2024-05-07 22:18:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302298052] [2024-05-07 22:18:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:56,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:56,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:18:56,725 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:18:56,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:18:56,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:18:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-05-07 22:18:56,727 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:18:56,727 WARN L233 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:18:56,727 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-05-07 22:18:56,765 INFO L144 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-05-07 22:18:56,768 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:18:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:18:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:18:56,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:18:56,789 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:18:56,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:56,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:18:56,790 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:18:56,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:18:56,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-05-07 22:18:56,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:18:56,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:18:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1761542938, now seen corresponding path program 1 times [2024-05-07 22:18:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:18:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318490944] [2024-05-07 22:18:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-05-07 22:18:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:18:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318490944] [2024-05-07 22:18:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318490944] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:18:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:18:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:18:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764705267] [2024-05-07 22:18:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:18:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:18:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:18:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:18:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:18:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:56,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:18:56,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:18:56,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:18:56,936 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:56,937 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 514 treesize of output 466 [2024-05-07 22:18:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 1 times [2024-05-07 22:18:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:56,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:57,067 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:18:57,067 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 550 treesize of output 502 [2024-05-07 22:18:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash 976439920, now seen corresponding path program 1 times [2024-05-07 22:18:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:57,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:57,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:18:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:18:57,352 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:57,352 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 278 treesize of output 250 [2024-05-07 22:18:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 2 times [2024-05-07 22:18:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:57,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:57,525 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:57,526 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 1046 treesize of output 946 [2024-05-07 22:18:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash 630836128, now seen corresponding path program 1 times [2024-05-07 22:18:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:57,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:57,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:18:58,055 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:18:58,055 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 1046 treesize of output 946 [2024-05-07 22:18:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 3 times [2024-05-07 22:18:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:58,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:18:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:18:58,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:58,623 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 1029 treesize of output 983 [2024-05-07 22:18:58,635 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:18:58,635 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 43 treesize of output 43 [2024-05-07 22:18:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -781338354, now seen corresponding path program 1 times [2024-05-07 22:18:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:18:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:18:59,145 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:18:59,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 22:18:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 4 times [2024-05-07 22:18:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:18:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:18:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:18:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:18:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:18:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:00,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable113,SelfDestructingSolverStorable124,SelfDestructingSolverStorable114 [2024-05-07 22:19:00,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:00,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 780438645, now seen corresponding path program 1 times [2024-05-07 22:19:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651291455] [2024-05-07 22:19:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:00,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:00,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:00,588 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:00,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:00,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:00,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-05-07 22:19:00,590 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:00,590 WARN L233 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:00,591 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-05-07 22:19:00,637 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-05-07 22:19:00,641 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:00,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:00,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-05-07 22:19:00,658 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:00,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:00,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:00,659 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:00,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:00,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:00,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1157455677, now seen corresponding path program 1 times [2024-05-07 22:19:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:00,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658447951] [2024-05-07 22:19:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2024-05-07 22:19:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658447951] [2024-05-07 22:19:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658447951] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917502991] [2024-05-07 22:19:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:00,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:00,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:00,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:00,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:00,832 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:00,833 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 532 treesize of output 484 [2024-05-07 22:19:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 1 times [2024-05-07 22:19:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:00,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:00,956 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:00,956 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 550 treesize of output 502 [2024-05-07 22:19:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1800949513, now seen corresponding path program 1 times [2024-05-07 22:19:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:01,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:01,225 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:01,225 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 270 treesize of output 242 [2024-05-07 22:19:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 2 times [2024-05-07 22:19:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:01,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:01,435 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:01,435 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 278 treesize of output 250 [2024-05-07 22:19:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1604072422, now seen corresponding path program 1 times [2024-05-07 22:19:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:01,894 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:01,895 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 550 treesize of output 498 [2024-05-07 22:19:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 3 times [2024-05-07 22:19:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:01,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:02,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:02,775 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 270 treesize of output 260 [2024-05-07 22:19:02,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:02,784 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 62 treesize of output 62 [2024-05-07 22:19:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1646862546, now seen corresponding path program 1 times [2024-05-07 22:19:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:03,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:03,497 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:19:03,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 268 [2024-05-07 22:19:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 4 times [2024-05-07 22:19:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:03,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:04,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable126,SelfDestructingSolverStorable137,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136 [2024-05-07 22:19:04,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:04,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1367140902, now seen corresponding path program 1 times [2024-05-07 22:19:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:04,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079228084] [2024-05-07 22:19:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:04,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:05,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:05,080 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:05,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:05,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-05-07 22:19:05,081 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:05,081 WARN L233 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:05,081 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-05-07 22:19:05,122 INFO L144 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-05-07 22:19:05,125 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:05,128 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:05,133 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:05,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:05,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:05,133 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:05,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:05,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-05-07 22:19:05,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:05,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 670108161, now seen corresponding path program 1 times [2024-05-07 22:19:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505264433] [2024-05-07 22:19:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-05-07 22:19:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505264433] [2024-05-07 22:19:05,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505264433] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:05,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:05,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931172719] [2024-05-07 22:19:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:05,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:05,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:05,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:05,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:05,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:05,302 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 542 treesize of output 494 [2024-05-07 22:19:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 1 times [2024-05-07 22:19:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:05,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:05,402 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 506 treesize of output 458 [2024-05-07 22:19:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash 32894582, now seen corresponding path program 1 times [2024-05-07 22:19:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:05,719 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:05,720 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 270 treesize of output 242 [2024-05-07 22:19:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 2 times [2024-05-07 22:19:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:05,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:05,999 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:05,999 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 550 treesize of output 498 [2024-05-07 22:19:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -922430147, now seen corresponding path program 1 times [2024-05-07 22:19:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:06,420 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:06,421 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 550 treesize of output 498 [2024-05-07 22:19:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 3 times [2024-05-07 22:19:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:06,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:06,973 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 259 treesize of output 235 [2024-05-07 22:19:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 207792315, now seen corresponding path program 1 times [2024-05-07 22:19:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:07,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:07,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:07,541 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:07,541 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 514 treesize of output 462 [2024-05-07 22:19:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 4 times [2024-05-07 22:19:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:07,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:09,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable139,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable146,SelfDestructingSolverStorable147 [2024-05-07 22:19:09,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:09,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash -872388724, now seen corresponding path program 1 times [2024-05-07 22:19:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919323715] [2024-05-07 22:19:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:09,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:09,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:09,313 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:09,314 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:09,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:09,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-05-07 22:19:09,315 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:09,315 WARN L233 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:09,315 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-05-07 22:19:09,368 INFO L144 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-05-07 22:19:09,371 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:09,395 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:09,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-05-07 22:19:09,398 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:09,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:09,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:09,398 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:09,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:09,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:09,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2097414182, now seen corresponding path program 1 times [2024-05-07 22:19:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878210519] [2024-05-07 22:19:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2024-05-07 22:19:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878210519] [2024-05-07 22:19:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878210519] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228470512] [2024-05-07 22:19:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:09,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:09,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:09,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:09,585 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:09,585 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 288 treesize of output 264 [2024-05-07 22:19:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 1 times [2024-05-07 22:19:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:09,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:09,695 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:09,696 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 270 treesize of output 246 [2024-05-07 22:19:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 765745012, now seen corresponding path program 1 times [2024-05-07 22:19:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:09,994 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:09,994 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 1064 treesize of output 964 [2024-05-07 22:19:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 2 times [2024-05-07 22:19:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:10,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:10,154 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:10,155 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 1046 treesize of output 946 [2024-05-07 22:19:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1792353008, now seen corresponding path program 1 times [2024-05-07 22:19:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:10,605 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:10,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 242 [2024-05-07 22:19:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 3 times [2024-05-07 22:19:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:10,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:11,184 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 536 treesize of output 488 [2024-05-07 22:19:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1777927551, now seen corresponding path program 1 times [2024-05-07 22:19:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:11,731 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:11,732 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 550 treesize of output 498 [2024-05-07 22:19:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 4 times [2024-05-07 22:19:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:13,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable152,SelfDestructingSolverStorable163,SelfDestructingSolverStorable153,SelfDestructingSolverStorable154,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable159,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-05-07 22:19:13,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:13,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash -670266702, now seen corresponding path program 1 times [2024-05-07 22:19:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157902210] [2024-05-07 22:19:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:13,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:13,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:13,731 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:13,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:13,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-05-07 22:19:13,732 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:13,733 WARN L233 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:13,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-05-07 22:19:13,783 INFO L144 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-05-07 22:19:13,786 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:13,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:13,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:13,788 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:13,804 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:13,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:13,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:13,804 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:13,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:13,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-05-07 22:19:13,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:13,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -502552212, now seen corresponding path program 1 times [2024-05-07 22:19:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20685549] [2024-05-07 22:19:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-05-07 22:19:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20685549] [2024-05-07 22:19:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20685549] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140413440] [2024-05-07 22:19:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:13,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:13,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:13,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:13,990 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 1030 treesize of output 934 [2024-05-07 22:19:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 1 times [2024-05-07 22:19:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:14,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:14,226 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:14,226 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 288 treesize of output 264 [2024-05-07 22:19:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1679646221, now seen corresponding path program 1 times [2024-05-07 22:19:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:14,500 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:14,500 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 540 treesize of output 488 [2024-05-07 22:19:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 2 times [2024-05-07 22:19:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:14,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:14,637 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:14,637 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 270 treesize of output 242 [2024-05-07 22:19:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -634120102, now seen corresponding path program 1 times [2024-05-07 22:19:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:15,033 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:15,034 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 540 treesize of output 488 [2024-05-07 22:19:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 3 times [2024-05-07 22:19:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:15,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:15,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:15,800 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 511 treesize of output 489 [2024-05-07 22:19:15,814 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:15,815 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 71 treesize of output 69 [2024-05-07 22:19:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 652394519, now seen corresponding path program 1 times [2024-05-07 22:19:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:16,372 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:19:16,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 540 treesize of output 488 [2024-05-07 22:19:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 4 times [2024-05-07 22:19:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:18,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,SelfDestructingSolverStorable174,SelfDestructingSolverStorable175,SelfDestructingSolverStorable165,SelfDestructingSolverStorable176,SelfDestructingSolverStorable170,SelfDestructingSolverStorable171,SelfDestructingSolverStorable172,SelfDestructingSolverStorable166,SelfDestructingSolverStorable167,SelfDestructingSolverStorable168,SelfDestructingSolverStorable169 [2024-05-07 22:19:18,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:18,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1122064708, now seen corresponding path program 1 times [2024-05-07 22:19:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450048282] [2024-05-07 22:19:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:18,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:18,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:18,422 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:18,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:18,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2024-05-07 22:19:18,424 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:18,424 WARN L233 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:18,424 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-05-07 22:19:18,472 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-05-07 22:19:18,481 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:18,503 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:18,508 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:18,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:18,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:18,509 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:18,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-05-07 22:19:18,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:18,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1875717485, now seen corresponding path program 1 times [2024-05-07 22:19:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902202197] [2024-05-07 22:19:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2024-05-07 22:19:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902202197] [2024-05-07 22:19:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902202197] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390996852] [2024-05-07 22:19:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:18,648 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:18,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:18,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:18,723 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 506 treesize of output 458 [2024-05-07 22:19:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 1 times [2024-05-07 22:19:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:18,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:18,838 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:18,839 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 514 treesize of output 466 [2024-05-07 22:19:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -738934243, now seen corresponding path program 1 times [2024-05-07 22:19:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:19,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:19,210 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:19,211 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 270 treesize of output 242 [2024-05-07 22:19:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 2 times [2024-05-07 22:19:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:19,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:19,357 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:19,357 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 1046 treesize of output 946 [2024-05-07 22:19:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 449453041, now seen corresponding path program 1 times [2024-05-07 22:19:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:19,767 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:19,767 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 576 treesize of output 524 [2024-05-07 22:19:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 3 times [2024-05-07 22:19:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:19,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:20,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:20,361 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 1029 treesize of output 983 [2024-05-07 22:19:20,386 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 15 treesize of output 13 [2024-05-07 22:19:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1490970184, now seen corresponding path program 1 times [2024-05-07 22:19:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:20,909 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:20,910 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 1038 treesize of output 938 [2024-05-07 22:19:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 4 times [2024-05-07 22:19:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:23,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,SelfDestructingSolverStorable185,SelfDestructingSolverStorable186,SelfDestructingSolverStorable187,SelfDestructingSolverStorable180,SelfDestructingSolverStorable181,SelfDestructingSolverStorable182,SelfDestructingSolverStorable183,SelfDestructingSolverStorable188,SelfDestructingSolverStorable178,SelfDestructingSolverStorable189,SelfDestructingSolverStorable179 [2024-05-07 22:19:23,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:23,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -4517571, now seen corresponding path program 1 times [2024-05-07 22:19:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227426229] [2024-05-07 22:19:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:23,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:23,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:23,414 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:23,414 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:23,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:23,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2024-05-07 22:19:23,415 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:23,415 WARN L233 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:23,415 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-05-07 22:19:23,468 INFO L144 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-05-07 22:19:23,471 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:23,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:23,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:23,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-05-07 22:19:23,481 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:23,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:23,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:23,482 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:23,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:23,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:23,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 763122267, now seen corresponding path program 1 times [2024-05-07 22:19:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836578219] [2024-05-07 22:19:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2024-05-07 22:19:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836578219] [2024-05-07 22:19:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836578219] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147283816] [2024-05-07 22:19:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:23,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:23,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:23,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:23,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:23,708 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 262 treesize of output 238 [2024-05-07 22:19:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 1 times [2024-05-07 22:19:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:23,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:23,832 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:23,832 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 270 treesize of output 246 [2024-05-07 22:19:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash -285743769, now seen corresponding path program 1 times [2024-05-07 22:19:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:23,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:24,081 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:24,081 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 514 treesize of output 462 [2024-05-07 22:19:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 2 times [2024-05-07 22:19:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:24,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:24,211 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:24,211 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 550 treesize of output 498 [2024-05-07 22:19:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1900462740, now seen corresponding path program 1 times [2024-05-07 22:19:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:24,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:24,564 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:24,565 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 1038 treesize of output 938 [2024-05-07 22:19:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 3 times [2024-05-07 22:19:24,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:24,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:24,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:24,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:24,980 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 547 treesize of output 525 [2024-05-07 22:19:24,985 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 15 treesize of output 13 [2024-05-07 22:19:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1539220296, now seen corresponding path program 1 times [2024-05-07 22:19:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:25,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:25,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:25,669 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:19:25,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 22:19:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 4 times [2024-05-07 22:19:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:27,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,SelfDestructingSolverStorable196,SelfDestructingSolverStorable197,SelfDestructingSolverStorable198,SelfDestructingSolverStorable191,SelfDestructingSolverStorable192,SelfDestructingSolverStorable193,SelfDestructingSolverStorable194,SelfDestructingSolverStorable199,SelfDestructingSolverStorable200,SelfDestructingSolverStorable201,SelfDestructingSolverStorable202 [2024-05-07 22:19:27,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:27,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash -621914110, now seen corresponding path program 1 times [2024-05-07 22:19:27,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:27,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376771547] [2024-05-07 22:19:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:27,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:27,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:27,954 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:27,954 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:27,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:27,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2024-05-07 22:19:27,955 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:27,955 WARN L233 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:27,956 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-05-07 22:19:27,999 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-05-07 22:19:28,003 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:28,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:28,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:28,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-05-07 22:19:28,009 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:28,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:28,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:28,010 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:28,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:28,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:28,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1659575940, now seen corresponding path program 1 times [2024-05-07 22:19:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713820206] [2024-05-07 22:19:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-05-07 22:19:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:28,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713820206] [2024-05-07 22:19:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713820206] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:28,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294203527] [2024-05-07 22:19:28,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:28,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:28,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:28,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:28,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:28,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:28,221 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 506 treesize of output 458 [2024-05-07 22:19:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 1 times [2024-05-07 22:19:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:28,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:28,351 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:28,351 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 550 treesize of output 502 [2024-05-07 22:19:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -483028577, now seen corresponding path program 1 times [2024-05-07 22:19:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:28,638 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:28,638 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 550 treesize of output 498 [2024-05-07 22:19:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 2 times [2024-05-07 22:19:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:28,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:28,764 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:28,764 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 558 treesize of output 506 [2024-05-07 22:19:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -619972799, now seen corresponding path program 1 times [2024-05-07 22:19:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:29,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:29,239 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:29,239 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 296 treesize of output 268 [2024-05-07 22:19:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 3 times [2024-05-07 22:19:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:29,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:29,770 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 259 treesize of output 235 [2024-05-07 22:19:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -569047676, now seen corresponding path program 1 times [2024-05-07 22:19:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:30,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:30,225 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:30,225 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 1038 treesize of output 938 [2024-05-07 22:19:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 4 times [2024-05-07 22:19:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:30,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:32,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,SelfDestructingSolverStorable208,SelfDestructingSolverStorable209,SelfDestructingSolverStorable214,SelfDestructingSolverStorable204,SelfDestructingSolverStorable215,SelfDestructingSolverStorable205,SelfDestructingSolverStorable206,SelfDestructingSolverStorable210,SelfDestructingSolverStorable211,SelfDestructingSolverStorable212,SelfDestructingSolverStorable213 [2024-05-07 22:19:32,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:32,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash 899274044, now seen corresponding path program 1 times [2024-05-07 22:19:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813600203] [2024-05-07 22:19:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:32,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:33,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:33,113 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:33,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:33,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:33,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2024-05-07 22:19:33,115 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:33,115 WARN L233 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:33,115 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-05-07 22:19:33,160 INFO L144 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-05-07 22:19:33,165 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:33,167 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:33,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-05-07 22:19:33,182 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:33,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:33,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:33,183 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:33,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:33,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:33,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2030356530, now seen corresponding path program 1 times [2024-05-07 22:19:33,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:33,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515115110] [2024-05-07 22:19:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:33,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2024-05-07 22:19:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515115110] [2024-05-07 22:19:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515115110] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948340139] [2024-05-07 22:19:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:33,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:33,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:33,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 206.5) internal successors, (413), 2 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:33,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:33,420 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:33,421 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 514 treesize of output 466 [2024-05-07 22:19:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 1 times [2024-05-07 22:19:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:33,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:33,529 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:33,530 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 1038 treesize of output 942 [2024-05-07 22:19:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash -917424178, now seen corresponding path program 1 times [2024-05-07 22:19:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:33,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:33,896 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:33,896 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 278 treesize of output 250 [2024-05-07 22:19:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 2 times [2024-05-07 22:19:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:33,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:34,049 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:34,050 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 558 treesize of output 506 [2024-05-07 22:19:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 284344936, now seen corresponding path program 1 times [2024-05-07 22:19:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:34,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:34,497 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:34,497 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 522 treesize of output 470 [2024-05-07 22:19:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 3 times [2024-05-07 22:19:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:34,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:35,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:35,124 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 270 treesize of output 260 [2024-05-07 22:19:35,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:35,135 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 62 treesize of output 62 [2024-05-07 22:19:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2042256956, now seen corresponding path program 1 times [2024-05-07 22:19:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:35,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:35,798 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:19:35,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:19:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 4 times [2024-05-07 22:19:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220,SelfDestructingSolverStorable218,SelfDestructingSolverStorable219,SelfDestructingSolverStorable225,SelfDestructingSolverStorable226,SelfDestructingSolverStorable227,SelfDestructingSolverStorable217,SelfDestructingSolverStorable228,SelfDestructingSolverStorable221,SelfDestructingSolverStorable222,SelfDestructingSolverStorable223,SelfDestructingSolverStorable224 [2024-05-07 22:19:38,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:38,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -955992696, now seen corresponding path program 1 times [2024-05-07 22:19:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839896925] [2024-05-07 22:19:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:38,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:38,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:38,690 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:38,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:38,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:38,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2024-05-07 22:19:38,693 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:38,693 WARN L233 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:38,693 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-05-07 22:19:38,756 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-05-07 22:19:38,761 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:38,778 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:38,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-05-07 22:19:38,806 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:38,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:38,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:38,807 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:38,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:38,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:38,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -21885191, now seen corresponding path program 1 times [2024-05-07 22:19:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724670196] [2024-05-07 22:19:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2024-05-07 22:19:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724670196] [2024-05-07 22:19:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724670196] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086264110] [2024-05-07 22:19:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:39,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:39,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 216.0) internal successors, (432), 2 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:39,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:39,195 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:39,195 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 568 treesize of output 520 [2024-05-07 22:19:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 1 times [2024-05-07 22:19:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:39,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:39,335 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:39,335 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 270 treesize of output 246 [2024-05-07 22:19:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1336319221, now seen corresponding path program 1 times [2024-05-07 22:19:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:39,626 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:39,628 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 550 treesize of output 498 [2024-05-07 22:19:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 2 times [2024-05-07 22:19:39,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:39,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:39,793 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:39,793 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 270 treesize of output 242 [2024-05-07 22:19:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash 798626594, now seen corresponding path program 1 times [2024-05-07 22:19:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:40,227 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:40,228 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 270 treesize of output 242 [2024-05-07 22:19:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 3 times [2024-05-07 22:19:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:40,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:41,099 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 259 treesize of output 235 [2024-05-07 22:19:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 175304160, now seen corresponding path program 1 times [2024-05-07 22:19:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:41,656 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:41,657 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 514 treesize of output 462 [2024-05-07 22:19:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 4 times [2024-05-07 22:19:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:44,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240,SelfDestructingSolverStorable230,SelfDestructingSolverStorable241,SelfDestructingSolverStorable231,SelfDestructingSolverStorable236,SelfDestructingSolverStorable237,SelfDestructingSolverStorable238,SelfDestructingSolverStorable239,SelfDestructingSolverStorable232,SelfDestructingSolverStorable233,SelfDestructingSolverStorable234,SelfDestructingSolverStorable235 [2024-05-07 22:19:44,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:44,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1194800905, now seen corresponding path program 1 times [2024-05-07 22:19:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219212648] [2024-05-07 22:19:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:44,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:44,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:44,580 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:44,581 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:44,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:44,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2024-05-07 22:19:44,583 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:44,583 WARN L233 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:44,583 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-05-07 22:19:44,645 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-05-07 22:19:44,650 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:44,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:44,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:44,660 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:44,665 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:44,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:44,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:44,665 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:44,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:44,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-05-07 22:19:44,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:44,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1583902149, now seen corresponding path program 1 times [2024-05-07 22:19:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299795678] [2024-05-07 22:19:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2024-05-07 22:19:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299795678] [2024-05-07 22:19:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299795678] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:44,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:44,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179716023] [2024-05-07 22:19:44,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:44,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:44,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:44,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:44,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:44,918 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:44,918 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 532 treesize of output 484 [2024-05-07 22:19:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 1 times [2024-05-07 22:19:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:44,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:44,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:45,044 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:45,045 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 1038 treesize of output 942 [2024-05-07 22:19:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1963771096, now seen corresponding path program 1 times [2024-05-07 22:19:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:45,535 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:45,535 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 296 treesize of output 268 [2024-05-07 22:19:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 2 times [2024-05-07 22:19:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:45,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:45,685 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:45,686 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 522 treesize of output 470 [2024-05-07 22:19:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash -39034720, now seen corresponding path program 1 times [2024-05-07 22:19:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:46,110 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:46,111 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 1064 treesize of output 964 [2024-05-07 22:19:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 3 times [2024-05-07 22:19:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:46,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:46,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:46,838 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 511 treesize of output 489 [2024-05-07 22:19:46,848 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:19:46,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 69 [2024-05-07 22:19:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1707099371, now seen corresponding path program 1 times [2024-05-07 22:19:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:47,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:47,392 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:47,392 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 550 treesize of output 498 [2024-05-07 22:19:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 4 times [2024-05-07 22:19:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,SelfDestructingSolverStorable251,SelfDestructingSolverStorable252,SelfDestructingSolverStorable253,SelfDestructingSolverStorable247,SelfDestructingSolverStorable248,SelfDestructingSolverStorable249,SelfDestructingSolverStorable243,SelfDestructingSolverStorable254,SelfDestructingSolverStorable244,SelfDestructingSolverStorable245,SelfDestructingSolverStorable246 [2024-05-07 22:19:50,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:50,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash -614382253, now seen corresponding path program 1 times [2024-05-07 22:19:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364737599] [2024-05-07 22:19:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:50,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:50,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:50,684 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:50,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:50,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:50,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2024-05-07 22:19:50,700 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:50,700 WARN L233 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:50,700 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-05-07 22:19:50,772 INFO L144 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-05-07 22:19:50,777 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:50,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:50,780 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:50,785 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:50,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:50,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:50,786 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:50,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:50,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-05-07 22:19:50,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:50,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash -441732622, now seen corresponding path program 1 times [2024-05-07 22:19:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670080459] [2024-05-07 22:19:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2024-05-07 22:19:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670080459] [2024-05-07 22:19:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670080459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:51,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550097294] [2024-05-07 22:19:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:51,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 235.0) internal successors, (470), 2 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:51,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:51,268 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 1030 treesize of output 934 [2024-05-07 22:19:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 1 times [2024-05-07 22:19:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:51,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:51,419 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 262 treesize of output 238 [2024-05-07 22:19:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1722577938, now seen corresponding path program 1 times [2024-05-07 22:19:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:51,744 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:51,744 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 550 treesize of output 498 [2024-05-07 22:19:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 2 times [2024-05-07 22:19:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:51,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:51,913 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:51,913 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 540 treesize of output 488 [2024-05-07 22:19:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1196284032, now seen corresponding path program 1 times [2024-05-07 22:19:51,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:52,319 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:52,319 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 296 treesize of output 268 [2024-05-07 22:19:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 3 times [2024-05-07 22:19:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:52,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:53,028 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 1018 treesize of output 922 [2024-05-07 22:19:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash -220094733, now seen corresponding path program 1 times [2024-05-07 22:19:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:19:53,846 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:19:53,846 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 270 treesize of output 242 [2024-05-07 22:19:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 4 times [2024-05-07 22:19:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:53,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:19:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:19:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,SelfDestructingSolverStorable262,SelfDestructingSolverStorable263,SelfDestructingSolverStorable264,SelfDestructingSolverStorable260,SelfDestructingSolverStorable258,SelfDestructingSolverStorable259,SelfDestructingSolverStorable265,SelfDestructingSolverStorable266,SelfDestructingSolverStorable256,SelfDestructingSolverStorable267,SelfDestructingSolverStorable257 [2024-05-07 22:19:57,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:57,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1582696202, now seen corresponding path program 1 times [2024-05-07 22:19:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870803924] [2024-05-07 22:19:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:57,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:57,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:19:57,612 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:19:57,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:19:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:19:57,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2024-05-07 22:19:57,612 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:19:57,613 WARN L233 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:19:57,613 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-05-07 22:19:57,699 INFO L144 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-05-07 22:19:57,704 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:19:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:19:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:19:57,707 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:19:57,712 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:19:57,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:57,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:19:57,713 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:19:57,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:19:57,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-05-07 22:19:57,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:19:57,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:19:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -725831104, now seen corresponding path program 1 times [2024-05-07 22:19:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:19:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316986225] [2024-05-07 22:19:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2024-05-07 22:19:57,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:19:57,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316986225] [2024-05-07 22:19:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316986225] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:19:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:19:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:19:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012382281] [2024-05-07 22:19:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:19:57,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:19:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:19:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:19:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:19:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:57,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:19:57,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:19:57,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:19:58,043 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:58,044 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 514 treesize of output 466 [2024-05-07 22:19:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 1 times [2024-05-07 22:19:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:58,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:58,155 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:19:58,155 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 1038 treesize of output 942 [2024-05-07 22:19:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1688408701, now seen corresponding path program 1 times [2024-05-07 22:19:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:58,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:19:58,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:19:58,459 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:58,459 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 522 treesize of output 470 [2024-05-07 22:19:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 2 times [2024-05-07 22:19:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:58,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:58,622 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:58,623 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 1046 treesize of output 946 [2024-05-07 22:19:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 587054909, now seen corresponding path program 1 times [2024-05-07 22:19:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:19:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:19:59,156 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:19:59,156 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 522 treesize of output 470 [2024-05-07 22:19:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 3 times [2024-05-07 22:19:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:59,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:19:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:19:59,705 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 1018 treesize of output 922 [2024-05-07 22:19:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2021168845, now seen corresponding path program 1 times [2024-05-07 22:19:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:19:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:19:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:19:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:19:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:00,229 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:00,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:20:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 4 times [2024-05-07 22:20:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:00,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:04,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272,SelfDestructingSolverStorable273,SelfDestructingSolverStorable274,SelfDestructingSolverStorable275,SelfDestructingSolverStorable280,SelfDestructingSolverStorable270,SelfDestructingSolverStorable271,SelfDestructingSolverStorable269,SelfDestructingSolverStorable276,SelfDestructingSolverStorable277,SelfDestructingSolverStorable278,SelfDestructingSolverStorable279 [2024-05-07 22:20:04,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:04,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1570424267, now seen corresponding path program 1 times [2024-05-07 22:20:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237211255] [2024-05-07 22:20:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:04,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:04,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:04,608 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:04,608 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:04,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:04,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2024-05-07 22:20:04,610 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:04,610 WARN L233 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:04,610 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-05-07 22:20:04,685 INFO L144 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-05-07 22:20:04,690 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:04,692 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:04,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-05-07 22:20:04,726 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:04,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:04,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:04,727 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:04,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:04,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:04,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash 463003247, now seen corresponding path program 1 times [2024-05-07 22:20:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140579458] [2024-05-07 22:20:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:04,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2024-05-07 22:20:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140579458] [2024-05-07 22:20:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140579458] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:05,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:05,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970403689] [2024-05-07 22:20:05,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:05,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:05,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:05,060 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:05,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 254.0) internal successors, (508), 2 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:05,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:05,142 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:05,142 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 1056 treesize of output 960 [2024-05-07 22:20:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 1 times [2024-05-07 22:20:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:05,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:05,279 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:05,279 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 550 treesize of output 502 [2024-05-07 22:20:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -766961560, now seen corresponding path program 1 times [2024-05-07 22:20:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:05,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:05,570 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:20:05,571 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 514 treesize of output 462 [2024-05-07 22:20:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 2 times [2024-05-07 22:20:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:05,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:05,738 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:05,738 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 558 treesize of output 506 [2024-05-07 22:20:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 934232656, now seen corresponding path program 1 times [2024-05-07 22:20:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:06,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:06,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:06,188 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:20:06,188 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 270 treesize of output 242 [2024-05-07 22:20:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 3 times [2024-05-07 22:20:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:06,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:07,067 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 1018 treesize of output 922 [2024-05-07 22:20:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 636283566, now seen corresponding path program 1 times [2024-05-07 22:20:07,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:07,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:07,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:07,684 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:20:07,684 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 1038 treesize of output 938 [2024-05-07 22:20:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 4 times [2024-05-07 22:20:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:11,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,SelfDestructingSolverStorable284,SelfDestructingSolverStorable285,SelfDestructingSolverStorable286,SelfDestructingSolverStorable290,SelfDestructingSolverStorable291,SelfDestructingSolverStorable292,SelfDestructingSolverStorable282,SelfDestructingSolverStorable293,SelfDestructingSolverStorable287,SelfDestructingSolverStorable288,SelfDestructingSolverStorable289 [2024-05-07 22:20:11,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:11,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1075257918, now seen corresponding path program 1 times [2024-05-07 22:20:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893359518] [2024-05-07 22:20:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:11,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:12,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:12,295 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:12,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:12,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:12,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2024-05-07 22:20:12,296 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:12,296 WARN L233 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:12,296 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-05-07 22:20:12,369 INFO L144 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-05-07 22:20:12,374 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:12,375 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2024-05-07 22:20:12,379 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:12,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:12,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:12,380 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:12,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:12,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -432258753, now seen corresponding path program 1 times [2024-05-07 22:20:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15498319] [2024-05-07 22:20:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3125 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 2880 trivial. 0 not checked. [2024-05-07 22:20:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15498319] [2024-05-07 22:20:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15498319] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871455162] [2024-05-07 22:20:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:12,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:12,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:12,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 263.5) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:12,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:12,844 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 506 treesize of output 458 [2024-05-07 22:20:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 1 times [2024-05-07 22:20:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:12,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:12,986 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 506 treesize of output 458 [2024-05-07 22:20:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2128946207, now seen corresponding path program 1 times [2024-05-07 22:20:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:13,301 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:13,301 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 540 treesize of output 488 [2024-05-07 22:20:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 2 times [2024-05-07 22:20:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:13,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:13,459 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:20:13,459 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 1038 treesize of output 938 [2024-05-07 22:20:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1598365671, now seen corresponding path program 1 times [2024-05-07 22:20:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:13,923 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:13,923 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 1064 treesize of output 964 [2024-05-07 22:20:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 3 times [2024-05-07 22:20:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:13,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:14,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:14,736 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 1029 treesize of output 983 [2024-05-07 22:20:14,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:20:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1466030969, now seen corresponding path program 1 times [2024-05-07 22:20:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:15,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:15,414 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:15,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 22:20:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 4 times [2024-05-07 22:20:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:19,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295,SelfDestructingSolverStorable296,SelfDestructingSolverStorable297,SelfDestructingSolverStorable306,SelfDestructingSolverStorable302,SelfDestructingSolverStorable303,SelfDestructingSolverStorable304,SelfDestructingSolverStorable305,SelfDestructingSolverStorable298,SelfDestructingSolverStorable299,SelfDestructingSolverStorable300,SelfDestructingSolverStorable301 [2024-05-07 22:20:19,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:19,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash 139902914, now seen corresponding path program 1 times [2024-05-07 22:20:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181551247] [2024-05-07 22:20:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:19,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:20,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:20,048 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:20,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:20,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:20,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2024-05-07 22:20:20,049 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:20,049 WARN L233 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:20,049 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-05-07 22:20:20,128 INFO L144 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-05-07 22:20:20,133 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:20,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:20,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:20,136 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:20,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2024-05-07 22:20:20,138 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:20,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:20,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:20,139 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:20,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:20,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:20,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1075922032, now seen corresponding path program 1 times [2024-05-07 22:20:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:20,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144092792] [2024-05-07 22:20:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3380 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 3125 trivial. 0 not checked. [2024-05-07 22:20:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144092792] [2024-05-07 22:20:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144092792] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:20,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23505344] [2024-05-07 22:20:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:20,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:20,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:20,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:20,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 273.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:20,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:20,518 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:20,518 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 514 treesize of output 466 [2024-05-07 22:20:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 1 times [2024-05-07 22:20:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:20,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:20,748 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:20,748 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 514 treesize of output 466 [2024-05-07 22:20:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 444932525, now seen corresponding path program 1 times [2024-05-07 22:20:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:21,023 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:21,024 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 522 treesize of output 470 [2024-05-07 22:20:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 2 times [2024-05-07 22:20:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:21,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:21,160 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:21,160 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 1046 treesize of output 946 [2024-05-07 22:20:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -257929323, now seen corresponding path program 1 times [2024-05-07 22:20:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:21,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:21,614 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:21,614 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 558 treesize of output 506 [2024-05-07 22:20:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 3 times [2024-05-07 22:20:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:21,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:22,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:22,209 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 1029 treesize of output 983 [2024-05-07 22:20:22,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:22,224 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 43 treesize of output 43 [2024-05-07 22:20:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1146248409, now seen corresponding path program 1 times [2024-05-07 22:20:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:22,717 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:20:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 4 times [2024-05-07 22:20:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317,SelfDestructingSolverStorable318,SelfDestructingSolverStorable308,SelfDestructingSolverStorable319,SelfDestructingSolverStorable309,SelfDestructingSolverStorable313,SelfDestructingSolverStorable314,SelfDestructingSolverStorable315,SelfDestructingSolverStorable316,SelfDestructingSolverStorable310,SelfDestructingSolverStorable311,SelfDestructingSolverStorable312 [2024-05-07 22:20:27,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:27,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1115737976, now seen corresponding path program 1 times [2024-05-07 22:20:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:27,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49330279] [2024-05-07 22:20:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:27,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:28,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:28,086 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:28,086 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:28,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2024-05-07 22:20:28,087 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:28,087 WARN L233 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:28,087 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-05-07 22:20:28,176 INFO L144 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-05-07 22:20:28,181 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:28,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:28,220 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:28,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process [2024-05-07 22:20:28,226 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:28,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:28,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:28,226 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:28,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:28,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:28,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -912791102, now seen corresponding path program 1 times [2024-05-07 22:20:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930958627] [2024-05-07 22:20:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3645 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 3380 trivial. 0 not checked. [2024-05-07 22:20:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930958627] [2024-05-07 22:20:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930958627] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789758325] [2024-05-07 22:20:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:28,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:28,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:28,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:28,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:28,719 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:28,719 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 550 treesize of output 502 [2024-05-07 22:20:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 1 times [2024-05-07 22:20:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:28,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:28,859 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:28,859 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 550 treesize of output 502 [2024-05-07 22:20:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1932115868, now seen corresponding path program 1 times [2024-05-07 22:20:28,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:29,177 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:29,177 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 522 treesize of output 470 [2024-05-07 22:20:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 2 times [2024-05-07 22:20:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:29,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:29,364 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:29,364 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 278 treesize of output 250 [2024-05-07 22:20:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1938525461, now seen corresponding path program 1 times [2024-05-07 22:20:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:29,902 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:29,902 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 1046 treesize of output 946 [2024-05-07 22:20:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 3 times [2024-05-07 22:20:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:29,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:30,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:30,464 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 270 treesize of output 260 [2024-05-07 22:20:30,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:30,473 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 62 treesize of output 62 [2024-05-07 22:20:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash 782947592, now seen corresponding path program 1 times [2024-05-07 22:20:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:31,013 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:31,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:20:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 4 times [2024-05-07 22:20:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:31,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:36,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330,SelfDestructingSolverStorable328,SelfDestructingSolverStorable329,SelfDestructingSolverStorable324,SelfDestructingSolverStorable325,SelfDestructingSolverStorable326,SelfDestructingSolverStorable327,SelfDestructingSolverStorable331,SelfDestructingSolverStorable321,SelfDestructingSolverStorable332,SelfDestructingSolverStorable322,SelfDestructingSolverStorable323 [2024-05-07 22:20:36,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:36,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1120628934, now seen corresponding path program 1 times [2024-05-07 22:20:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810913551] [2024-05-07 22:20:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:36,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:37,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:37,044 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:37,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:37,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:37,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2024-05-07 22:20:37,045 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:37,045 WARN L233 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:37,045 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-05-07 22:20:37,127 INFO L144 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-05-07 22:20:37,132 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:37,141 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:37,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2024-05-07 22:20:37,144 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:37,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:37,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:37,144 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:37,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:37,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:37,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 611263477, now seen corresponding path program 1 times [2024-05-07 22:20:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:37,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146668994] [2024-05-07 22:20:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3920 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 3645 trivial. 0 not checked. [2024-05-07 22:20:37,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:37,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146668994] [2024-05-07 22:20:37,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146668994] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:37,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:37,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:37,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778952143] [2024-05-07 22:20:37,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:37,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:37,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:37,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:37,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:37,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:37,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 292.0) internal successors, (584), 2 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:37,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:37,717 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:37,718 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 270 treesize of output 246 [2024-05-07 22:20:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 1 times [2024-05-07 22:20:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:37,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:37,932 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:37,932 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 550 treesize of output 502 [2024-05-07 22:20:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 15490767, now seen corresponding path program 1 times [2024-05-07 22:20:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:38,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:38,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:38,261 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:38,261 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 278 treesize of output 250 [2024-05-07 22:20:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 2 times [2024-05-07 22:20:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:38,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:38,440 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:38,440 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 558 treesize of output 506 [2024-05-07 22:20:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 121737935, now seen corresponding path program 1 times [2024-05-07 22:20:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:38,902 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:38,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:20:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 3 times [2024-05-07 22:20:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:38,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 452 [2024-05-07 22:20:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -625550593, now seen corresponding path program 1 times [2024-05-07 22:20:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:39,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:40,173 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:40,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:20:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 4 times [2024-05-07 22:20:40,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:46,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340,SelfDestructingSolverStorable341,SelfDestructingSolverStorable339,SelfDestructingSolverStorable335,SelfDestructingSolverStorable336,SelfDestructingSolverStorable337,SelfDestructingSolverStorable338,SelfDestructingSolverStorable342,SelfDestructingSolverStorable343,SelfDestructingSolverStorable344,SelfDestructingSolverStorable334,SelfDestructingSolverStorable345 [2024-05-07 22:20:46,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:46,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1779409552, now seen corresponding path program 1 times [2024-05-07 22:20:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013576268] [2024-05-07 22:20:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:46,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:46,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:46,921 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:46,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:46,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:46,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2024-05-07 22:20:46,922 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:46,922 WARN L233 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:46,922 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-05-07 22:20:47,003 INFO L144 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-05-07 22:20:47,020 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:47,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:47,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:47,037 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:47,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (31)] Waiting until timeout for monitored process [2024-05-07 22:20:47,043 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:47,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:47,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:47,044 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:47,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:47,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:47,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 288370121, now seen corresponding path program 1 times [2024-05-07 22:20:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878354502] [2024-05-07 22:20:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2024-05-07 22:20:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878354502] [2024-05-07 22:20:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878354502] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746292544] [2024-05-07 22:20:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:47,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:47,442 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:47,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 301.5) internal successors, (603), 2 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:47,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:47,501 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 542 treesize of output 494 [2024-05-07 22:20:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 1 times [2024-05-07 22:20:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:47,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:47,646 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:47,647 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 270 treesize of output 246 [2024-05-07 22:20:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -268960699, now seen corresponding path program 1 times [2024-05-07 22:20:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:48,005 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:48,005 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 1064 treesize of output 964 [2024-05-07 22:20:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 2 times [2024-05-07 22:20:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:48,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:48,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:48,198 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:48,198 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 540 treesize of output 488 [2024-05-07 22:20:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1003300847, now seen corresponding path program 1 times [2024-05-07 22:20:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:48,783 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:48,784 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 540 treesize of output 488 [2024-05-07 22:20:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 3 times [2024-05-07 22:20:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:48,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:49,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:20:49,419 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 547 treesize of output 525 [2024-05-07 22:20:49,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:20:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 657246285, now seen corresponding path program 1 times [2024-05-07 22:20:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:49,911 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:20:49,911 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 1038 treesize of output 938 [2024-05-07 22:20:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 4 times [2024-05-07 22:20:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:20:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,SelfDestructingSolverStorable351,SelfDestructingSolverStorable352,SelfDestructingSolverStorable357,SelfDestructingSolverStorable347,SelfDestructingSolverStorable358,SelfDestructingSolverStorable348,SelfDestructingSolverStorable349,SelfDestructingSolverStorable353,SelfDestructingSolverStorable354,SelfDestructingSolverStorable355,SelfDestructingSolverStorable356 [2024-05-07 22:20:55,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:55,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 263461453, now seen corresponding path program 1 times [2024-05-07 22:20:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382018439] [2024-05-07 22:20:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:55,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:56,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:20:56,464 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:20:56,464 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:20:56,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:20:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2024-05-07 22:20:56,465 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:20:56,466 WARN L233 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:20:56,466 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-05-07 22:20:56,556 INFO L144 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-05-07 22:20:56,561 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:20:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:20:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:20:56,564 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:20:56,572 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:20:56,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:56,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:20:56,572 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:20:56,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:20:56,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (32)] Waiting until timeout for monitored process [2024-05-07 22:20:56,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:20:56,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:20:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 914807294, now seen corresponding path program 1 times [2024-05-07 22:20:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:20:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27935067] [2024-05-07 22:20:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 4205 trivial. 0 not checked. [2024-05-07 22:20:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:20:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27935067] [2024-05-07 22:20:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27935067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:20:57,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:20:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:20:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659082818] [2024-05-07 22:20:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:20:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:20:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:20:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:20:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:20:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:57,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:20:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 311.0) internal successors, (622), 2 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:20:57,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:20:57,351 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:57,352 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 270 treesize of output 246 [2024-05-07 22:20:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 1 times [2024-05-07 22:20:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:57,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:57,487 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:20:57,487 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 568 treesize of output 520 [2024-05-07 22:20:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1399982502, now seen corresponding path program 1 times [2024-05-07 22:20:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:57,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:20:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:20:57,803 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:57,803 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 278 treesize of output 250 [2024-05-07 22:20:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 2 times [2024-05-07 22:20:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:57,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:57,985 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:57,985 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 296 treesize of output 268 [2024-05-07 22:20:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1871836018, now seen corresponding path program 1 times [2024-05-07 22:20:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:20:58,424 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:20:58,424 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 558 treesize of output 506 [2024-05-07 22:20:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 3 times [2024-05-07 22:20:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:58,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:20:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:20:59,019 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 500 treesize of output 452 [2024-05-07 22:20:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1573292627, now seen corresponding path program 1 times [2024-05-07 22:20:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:59,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:20:59,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:20:59,716 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:20:59,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:20:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 4 times [2024-05-07 22:20:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:59,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:20:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:20:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:20:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:20:59,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:20:59,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:21:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:06,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360,SelfDestructingSolverStorable371,SelfDestructingSolverStorable361,SelfDestructingSolverStorable362,SelfDestructingSolverStorable363,SelfDestructingSolverStorable370,SelfDestructingSolverStorable368,SelfDestructingSolverStorable369,SelfDestructingSolverStorable364,SelfDestructingSolverStorable365,SelfDestructingSolverStorable366,SelfDestructingSolverStorable367 [2024-05-07 22:21:06,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:06,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 351451804, now seen corresponding path program 1 times [2024-05-07 22:21:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888489557] [2024-05-07 22:21:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:06,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:07,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:21:07,407 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:21:07,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:21:07,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:21:07,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2024-05-07 22:21:07,408 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:21:07,408 WARN L233 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:21:07,408 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-05-07 22:21:07,499 INFO L144 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-05-07 22:21:07,504 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:21:07,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:21:07,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:21:07,522 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:21:07,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (33)] Waiting until timeout for monitored process [2024-05-07 22:21:07,525 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:21:07,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:07,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:21:07,525 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:21:07,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:21:07,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:07,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 435660116, now seen corresponding path program 1 times [2024-05-07 22:21:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768672251] [2024-05-07 22:21:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4805 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2024-05-07 22:21:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:21:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768672251] [2024-05-07 22:21:08,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768672251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:21:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:21:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:21:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362599247] [2024-05-07 22:21:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:21:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:21:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:21:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:21:08,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:21:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:08,155 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:21:08,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 320.5) internal successors, (641), 2 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:21:08,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:08,219 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 1030 treesize of output 934 [2024-05-07 22:21:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 1 times [2024-05-07 22:21:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:08,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:08,433 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:08,434 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 514 treesize of output 466 [2024-05-07 22:21:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 45840214, now seen corresponding path program 1 times [2024-05-07 22:21:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:21:08,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:21:08,938 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:21:08,938 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 270 treesize of output 242 [2024-05-07 22:21:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 2 times [2024-05-07 22:21:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:09,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:09,150 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:09,150 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 296 treesize of output 268 [2024-05-07 22:21:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash -703949777, now seen corresponding path program 1 times [2024-05-07 22:21:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:21:09,582 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:21:09,582 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 270 treesize of output 242 [2024-05-07 22:21:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 3 times [2024-05-07 22:21:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:09,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:10,100 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 536 treesize of output 488 [2024-05-07 22:21:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash 781762800, now seen corresponding path program 1 times [2024-05-07 22:21:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:21:10,657 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:21:10,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 22:21:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 4 times [2024-05-07 22:21:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:21:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:21:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:17,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382,SelfDestructingSolverStorable383,SelfDestructingSolverStorable373,SelfDestructingSolverStorable384,SelfDestructingSolverStorable374,SelfDestructingSolverStorable380,SelfDestructingSolverStorable381,SelfDestructingSolverStorable379,SelfDestructingSolverStorable375,SelfDestructingSolverStorable376,SelfDestructingSolverStorable377,SelfDestructingSolverStorable378 [2024-05-07 22:21:17,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:17,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1523806128, now seen corresponding path program 1 times [2024-05-07 22:21:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084618937] [2024-05-07 22:21:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:17,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:18,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:21:18,784 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:21:18,784 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:21:18,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:21:18,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2024-05-07 22:21:18,785 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:21:18,785 WARN L233 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:21:18,785 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-05-07 22:21:18,877 INFO L144 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-05-07 22:21:18,882 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:21:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:21:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:21:18,885 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:21:18,887 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:21:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Waiting until timeout for monitored process [2024-05-07 22:21:18,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:18,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:21:18,888 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:21:18,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:21:19,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:19,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2138701707, now seen corresponding path program 1 times [2024-05-07 22:21:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006192152] [2024-05-07 22:21:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5120 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 4805 trivial. 0 not checked. [2024-05-07 22:21:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:21:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006192152] [2024-05-07 22:21:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006192152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:21:19,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:21:19,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:21:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692098069] [2024-05-07 22:21:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:21:19,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:21:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:21:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:21:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:21:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:19,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:21:19,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 330.0) internal successors, (660), 2 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:21:19,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:19,488 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:19,488 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 270 treesize of output 246 [2024-05-07 22:21:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 1 times [2024-05-07 22:21:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:19,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:19,632 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:19,632 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 1056 treesize of output 960 [2024-05-07 22:21:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2112354362, now seen corresponding path program 1 times [2024-05-07 22:21:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:19,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:21:19,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:21:19,941 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:19,942 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 558 treesize of output 506 [2024-05-07 22:21:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 2 times [2024-05-07 22:21:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:20,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:20,126 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:20,126 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 540 treesize of output 488 [2024-05-07 22:21:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -350505176, now seen corresponding path program 1 times [2024-05-07 22:21:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:21:20,748 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:20,748 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 1046 treesize of output 946 [2024-05-07 22:21:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 3 times [2024-05-07 22:21:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:20,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:21,254 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 536 treesize of output 488 [2024-05-07 22:21:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1975441763, now seen corresponding path program 1 times [2024-05-07 22:21:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:21:21,863 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:21:21,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 22:21:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 4 times [2024-05-07 22:21:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:21:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:21:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:28,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393,SelfDestructingSolverStorable394,SelfDestructingSolverStorable395,SelfDestructingSolverStorable396,SelfDestructingSolverStorable390,SelfDestructingSolverStorable391,SelfDestructingSolverStorable392,SelfDestructingSolverStorable386,SelfDestructingSolverStorable397,SelfDestructingSolverStorable387,SelfDestructingSolverStorable388,SelfDestructingSolverStorable389 [2024-05-07 22:21:28,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:28,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1775503493, now seen corresponding path program 1 times [2024-05-07 22:21:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287887716] [2024-05-07 22:21:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:28,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:29,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:21:29,635 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:21:29,635 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:21:29,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:21:29,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2024-05-07 22:21:29,636 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:21:29,636 WARN L233 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:21:29,636 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-05-07 22:21:29,727 INFO L144 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-05-07 22:21:29,732 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:21:29,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:21:29,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:21:29,735 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:21:29,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (35)] Waiting until timeout for monitored process [2024-05-07 22:21:29,738 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:21:29,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:29,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:21:29,739 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:21:29,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:21:30,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:30,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1415258211, now seen corresponding path program 1 times [2024-05-07 22:21:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786313638] [2024-05-07 22:21:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 5120 trivial. 0 not checked. [2024-05-07 22:21:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:21:30,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786313638] [2024-05-07 22:21:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786313638] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:21:30,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:21:30,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:21:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553570365] [2024-05-07 22:21:30,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:21:30,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:21:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:21:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:21:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:21:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:30,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:21:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 339.5) internal successors, (679), 2 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:21:30,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:30,577 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:30,577 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 514 treesize of output 466 [2024-05-07 22:21:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 1 times [2024-05-07 22:21:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:30,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:30,737 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:30,737 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 270 treesize of output 246 [2024-05-07 22:21:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1152791937, now seen corresponding path program 1 times [2024-05-07 22:21:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:21:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:21:31,285 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:31,286 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 558 treesize of output 506 [2024-05-07 22:21:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 2 times [2024-05-07 22:21:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:31,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:31,493 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:31,493 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 558 treesize of output 506 [2024-05-07 22:21:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1991842716, now seen corresponding path program 1 times [2024-05-07 22:21:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:21:31,989 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:31,990 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 522 treesize of output 470 [2024-05-07 22:21:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 3 times [2024-05-07 22:21:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:32,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:32,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:21:32,672 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 511 treesize of output 489 [2024-05-07 22:21:32,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:21:32,700 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 71 treesize of output 69 [2024-05-07 22:21:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 868054748, now seen corresponding path program 1 times [2024-05-07 22:21:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:21:33,414 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:21:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 22:21:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 4 times [2024-05-07 22:21:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:33,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:21:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:21:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:42,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409,SelfDestructingSolverStorable405,SelfDestructingSolverStorable406,SelfDestructingSolverStorable407,SelfDestructingSolverStorable408,SelfDestructingSolverStorable401,SelfDestructingSolverStorable402,SelfDestructingSolverStorable403,SelfDestructingSolverStorable404,SelfDestructingSolverStorable399,SelfDestructingSolverStorable410,SelfDestructingSolverStorable400 [2024-05-07 22:21:42,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:42,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 643388693, now seen corresponding path program 1 times [2024-05-07 22:21:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086870508] [2024-05-07 22:21:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:42,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:43,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:21:43,149 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:21:43,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:21:43,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:21:43,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2024-05-07 22:21:43,150 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:21:43,150 WARN L233 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:21:43,150 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-05-07 22:21:43,250 INFO L144 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-05-07 22:21:43,256 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:21:43,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:21:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:21:43,262 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:21:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (36)] Waiting until timeout for monitored process [2024-05-07 22:21:43,279 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:21:43,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:43,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:21:43,280 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:21:43,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:21:43,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:43,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1058312036, now seen corresponding path program 1 times [2024-05-07 22:21:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332697551] [2024-05-07 22:21:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5780 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2024-05-07 22:21:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:21:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332697551] [2024-05-07 22:21:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332697551] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:21:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:21:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:21:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411443185] [2024-05-07 22:21:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:21:43,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:21:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:21:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:21:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:21:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:43,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:21:43,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 349.0) internal successors, (698), 2 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:21:43,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:43,903 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:43,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-05-07 22:21:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 1 times [2024-05-07 22:21:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:43,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:44,050 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:44,050 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 1038 treesize of output 942 [2024-05-07 22:21:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1049347331, now seen corresponding path program 1 times [2024-05-07 22:21:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:21:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:21:44,378 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:44,378 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 1046 treesize of output 946 [2024-05-07 22:21:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 2 times [2024-05-07 22:21:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:44,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:44,558 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:44,558 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 558 treesize of output 506 [2024-05-07 22:21:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1752582634, now seen corresponding path program 1 times [2024-05-07 22:21:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:45,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:21:45,189 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:45,190 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 558 treesize of output 506 [2024-05-07 22:21:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 3 times [2024-05-07 22:21:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:45,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:45,827 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 1018 treesize of output 922 [2024-05-07 22:21:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 775528812, now seen corresponding path program 1 times [2024-05-07 22:21:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:21:46,387 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:21:46,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:21:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 4 times [2024-05-07 22:21:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:21:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:21:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:54,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416,SelfDestructingSolverStorable417,SelfDestructingSolverStorable418,SelfDestructingSolverStorable419,SelfDestructingSolverStorable412,SelfDestructingSolverStorable423,SelfDestructingSolverStorable413,SelfDestructingSolverStorable414,SelfDestructingSolverStorable415,SelfDestructingSolverStorable420,SelfDestructingSolverStorable421,SelfDestructingSolverStorable422 [2024-05-07 22:21:54,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:54,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 424203717, now seen corresponding path program 1 times [2024-05-07 22:21:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179767439] [2024-05-07 22:21:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:54,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:55,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:21:55,554 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:21:55,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:21:55,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:21:55,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2024-05-07 22:21:55,555 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:21:55,555 WARN L233 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:21:55,555 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-05-07 22:21:55,660 INFO L144 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-05-07 22:21:55,666 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:21:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:21:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:21:55,675 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:21:55,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (37)] Waiting until timeout for monitored process [2024-05-07 22:21:55,682 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:21:55,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:55,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:21:55,682 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:21:55,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:21:56,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:21:56,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:21:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 502713078, now seen corresponding path program 1 times [2024-05-07 22:21:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:21:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242222594] [2024-05-07 22:21:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 5780 trivial. 0 not checked. [2024-05-07 22:21:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:21:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242222594] [2024-05-07 22:21:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242222594] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:21:56,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:21:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:21:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747508696] [2024-05-07 22:21:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:21:56,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:21:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:21:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:21:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:21:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:56,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:21:56,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 358.5) internal successors, (717), 2 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:21:56,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:21:56,420 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:56,420 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 1038 treesize of output 942 [2024-05-07 22:21:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 1 times [2024-05-07 22:21:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:56,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:56,582 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:21:56,583 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 550 treesize of output 502 [2024-05-07 22:21:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1359317876, now seen corresponding path program 1 times [2024-05-07 22:21:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:56,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:21:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:21:56,914 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:56,915 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 522 treesize of output 470 [2024-05-07 22:21:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 2 times [2024-05-07 22:21:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:56,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:57,103 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:57,104 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 558 treesize of output 506 [2024-05-07 22:21:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1522293476, now seen corresponding path program 1 times [2024-05-07 22:21:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:21:57,561 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:21:57,563 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 278 treesize of output 250 [2024-05-07 22:21:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 3 times [2024-05-07 22:21:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:57,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:21:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:21:58,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:21:58,286 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 270 treesize of output 260 [2024-05-07 22:21:58,298 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:21:58,298 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 62 treesize of output 62 [2024-05-07 22:21:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1987502694, now seen corresponding path program 1 times [2024-05-07 22:21:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:58,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:21:58,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:21:58,873 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:21:58,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 22:21:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 4 times [2024-05-07 22:21:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:21:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:21:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:21:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:21:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:21:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:22:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427,SelfDestructingSolverStorable428,SelfDestructingSolverStorable429,SelfDestructingSolverStorable434,SelfDestructingSolverStorable435,SelfDestructingSolverStorable425,SelfDestructingSolverStorable436,SelfDestructingSolverStorable426,SelfDestructingSolverStorable430,SelfDestructingSolverStorable431,SelfDestructingSolverStorable432,SelfDestructingSolverStorable433 [2024-05-07 22:22:06,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:06,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1936575876, now seen corresponding path program 1 times [2024-05-07 22:22:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790296990] [2024-05-07 22:22:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:06,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:07,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:22:07,464 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:22:07,464 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:22:07,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:22:07,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2024-05-07 22:22:07,465 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:22:07,467 WARN L233 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:22:07,467 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-05-07 22:22:07,582 INFO L144 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-05-07 22:22:07,588 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:22:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:22:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:22:07,590 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:22:07,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (38)] Waiting until timeout for monitored process [2024-05-07 22:22:07,615 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:22:07,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:07,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:22:07,615 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:22:07,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:22:07,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:07,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -782151119, now seen corresponding path program 1 times [2024-05-07 22:22:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98242513] [2024-05-07 22:22:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 6125 trivial. 0 not checked. [2024-05-07 22:22:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:22:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98242513] [2024-05-07 22:22:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98242513] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:22:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:22:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:22:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334073198] [2024-05-07 22:22:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:22:08,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:22:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:22:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:22:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:22:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:08,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:22:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 368.0) internal successors, (736), 2 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:22:08,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:08,208 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:22:08,208 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 1056 treesize of output 960 [2024-05-07 22:22:08,239 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 1 times [2024-05-07 22:22:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:08,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:08,587 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 262 treesize of output 238 [2024-05-07 22:22:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2076169755, now seen corresponding path program 1 times [2024-05-07 22:22:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:22:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:22:08,933 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:08,933 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 1038 treesize of output 938 [2024-05-07 22:22:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 2 times [2024-05-07 22:22:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:09,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:09,150 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:09,150 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 1038 treesize of output 938 [2024-05-07 22:22:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1196374371, now seen corresponding path program 1 times [2024-05-07 22:22:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:22:09,635 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:09,635 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 1038 treesize of output 938 [2024-05-07 22:22:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 3 times [2024-05-07 22:22:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:09,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:10,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:22:10,354 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 1029 treesize of output 983 [2024-05-07 22:22:10,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 22:22:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash 155312522, now seen corresponding path program 1 times [2024-05-07 22:22:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:10,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:22:11,175 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:11,175 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 514 treesize of output 462 [2024-05-07 22:22:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 4 times [2024-05-07 22:22:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:22:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:22:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440,SelfDestructingSolverStorable438,SelfDestructingSolverStorable449,SelfDestructingSolverStorable439,SelfDestructingSolverStorable445,SelfDestructingSolverStorable446,SelfDestructingSolverStorable447,SelfDestructingSolverStorable448,SelfDestructingSolverStorable441,SelfDestructingSolverStorable442,SelfDestructingSolverStorable443,SelfDestructingSolverStorable444 [2024-05-07 22:22:19,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:19,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2098220086, now seen corresponding path program 1 times [2024-05-07 22:22:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046568598] [2024-05-07 22:22:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:20,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:21,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:22:21,137 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:22:21,137 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:22:21,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:22:21,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2024-05-07 22:22:21,138 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:22:21,138 WARN L233 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:22:21,138 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-05-07 22:22:21,279 INFO L144 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2024-05-07 22:22:21,295 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:22:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:22:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:22:21,298 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:22:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (39)] Waiting until timeout for monitored process [2024-05-07 22:22:21,316 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:22:21,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:21,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:22:21,317 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:22:21,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:22:21,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:21,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash 147210509, now seen corresponding path program 1 times [2024-05-07 22:22:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584645205] [2024-05-07 22:22:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6845 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2024-05-07 22:22:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:22:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584645205] [2024-05-07 22:22:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584645205] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:22:22,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:22:22,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:22:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101566763] [2024-05-07 22:22:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:22:22,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:22:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:22:22,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:22:22,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:22:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:22,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:22:22,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 377.5) internal successors, (755), 2 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:22:22,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:22,305 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:22:22,305 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 1038 treesize of output 942 [2024-05-07 22:22:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 1 times [2024-05-07 22:22:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:22,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:22,473 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 542 treesize of output 494 [2024-05-07 22:22:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1553555817, now seen corresponding path program 1 times [2024-05-07 22:22:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:22:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:22:22,823 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:22,823 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 522 treesize of output 470 [2024-05-07 22:22:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 2 times [2024-05-07 22:22:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:22,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:23,025 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:23,025 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 514 treesize of output 462 [2024-05-07 22:22:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2100901031, now seen corresponding path program 1 times [2024-05-07 22:22:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:22:23,642 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:23,642 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 1046 treesize of output 946 [2024-05-07 22:22:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 3 times [2024-05-07 22:22:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:23,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:24,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 452 [2024-05-07 22:22:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1685346023, now seen corresponding path program 1 times [2024-05-07 22:22:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:24,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:24,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:22:24,951 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:22:24,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:22:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 4 times [2024-05-07 22:22:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:22:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:22:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460,SelfDestructingSolverStorable461,SelfDestructingSolverStorable451,SelfDestructingSolverStorable462,SelfDestructingSolverStorable456,SelfDestructingSolverStorable457,SelfDestructingSolverStorable458,SelfDestructingSolverStorable459,SelfDestructingSolverStorable452,SelfDestructingSolverStorable453,SelfDestructingSolverStorable454,SelfDestructingSolverStorable455 [2024-05-07 22:22:34,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:34,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1767323298, now seen corresponding path program 1 times [2024-05-07 22:22:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149397999] [2024-05-07 22:22:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:34,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:36,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:22:36,031 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:22:36,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:22:36,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:22:36,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2024-05-07 22:22:36,031 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:22:36,032 WARN L233 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:22:36,032 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-05-07 22:22:36,161 INFO L144 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2024-05-07 22:22:36,167 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:22:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:22:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:22:36,178 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:22:36,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (40)] Waiting until timeout for monitored process [2024-05-07 22:22:36,200 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:22:36,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:36,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:22:36,201 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:22:36,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:22:37,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:37,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1823690826, now seen corresponding path program 1 times [2024-05-07 22:22:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187440873] [2024-05-07 22:22:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 6845 trivial. 0 not checked. [2024-05-07 22:22:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:22:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187440873] [2024-05-07 22:22:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187440873] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:22:37,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:22:37,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:22:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506198256] [2024-05-07 22:22:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:22:37,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:22:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:22:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:22:37,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:22:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:37,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:22:37,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 387.0) internal successors, (774), 2 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:22:37,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:37,538 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:22:37,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 484 [2024-05-07 22:22:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 1 times [2024-05-07 22:22:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:37,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:37,791 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:22:37,792 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 1038 treesize of output 942 [2024-05-07 22:22:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1858525477, now seen corresponding path program 1 times [2024-05-07 22:22:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:22:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:22:38,211 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:38,211 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 1038 treesize of output 938 [2024-05-07 22:22:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 2 times [2024-05-07 22:22:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:38,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:38,577 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:38,577 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 522 treesize of output 470 [2024-05-07 22:22:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 791449502, now seen corresponding path program 1 times [2024-05-07 22:22:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:22:39,174 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:39,175 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 296 treesize of output 268 [2024-05-07 22:22:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 3 times [2024-05-07 22:22:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:39,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:39,791 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 259 treesize of output 235 [2024-05-07 22:22:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2033463221, now seen corresponding path program 1 times [2024-05-07 22:22:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:22:40,523 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:22:40,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 22:22:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 4 times [2024-05-07 22:22:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:22:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:22:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470,SelfDestructingSolverStorable471,SelfDestructingSolverStorable472,SelfDestructingSolverStorable473,SelfDestructingSolverStorable467,SelfDestructingSolverStorable468,SelfDestructingSolverStorable469,SelfDestructingSolverStorable474,SelfDestructingSolverStorable464,SelfDestructingSolverStorable475,SelfDestructingSolverStorable465,SelfDestructingSolverStorable466 [2024-05-07 22:22:53,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:53,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -451175715, now seen corresponding path program 1 times [2024-05-07 22:22:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382022824] [2024-05-07 22:22:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:53,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:54,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:22:54,516 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:22:54,516 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:22:54,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:22:54,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2024-05-07 22:22:54,516 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:22:54,517 WARN L233 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:22:54,517 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2024-05-07 22:22:54,629 INFO L144 ThreadInstanceAdder]: Constructed 39 joinOtherThreadTransitions. [2024-05-07 22:22:54,635 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:22:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:22:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:22:54,638 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:22:54,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (41)] Waiting until timeout for monitored process [2024-05-07 22:22:54,660 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:22:54,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:54,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:22:54,660 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:22:54,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:22:55,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:22:55,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:22:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 640255144, now seen corresponding path program 1 times [2024-05-07 22:22:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:22:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431460862] [2024-05-07 22:22:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7605 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 7220 trivial. 0 not checked. [2024-05-07 22:22:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:22:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431460862] [2024-05-07 22:22:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431460862] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:22:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:22:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:22:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615133306] [2024-05-07 22:22:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:22:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:22:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:22:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:22:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:22:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:55,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:22:55,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 396.5) internal successors, (793), 2 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:22:55,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:22:55,525 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 262 treesize of output 238 [2024-05-07 22:22:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 1 times [2024-05-07 22:22:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:55,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:55,712 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:22:55,713 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 270 treesize of output 246 [2024-05-07 22:22:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1480756433, now seen corresponding path program 1 times [2024-05-07 22:22:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:22:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:22:56,091 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:56,091 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 296 treesize of output 268 [2024-05-07 22:22:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 2 times [2024-05-07 22:22:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:56,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:56,476 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:22:56,477 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 278 treesize of output 250 [2024-05-07 22:22:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1620135601, now seen corresponding path program 1 times [2024-05-07 22:22:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:56,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:22:56,970 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:56,970 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 550 treesize of output 498 [2024-05-07 22:22:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 3 times [2024-05-07 22:22:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:57,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:22:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:22:57,551 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 1018 treesize of output 922 [2024-05-07 22:22:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 892280878, now seen corresponding path program 1 times [2024-05-07 22:22:57,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:22:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:22:58,340 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:22:58,341 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 1038 treesize of output 938 [2024-05-07 22:22:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 4 times [2024-05-07 22:22:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:22:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:22:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:22:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:22:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:22:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:23:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481,SelfDestructingSolverStorable482,SelfDestructingSolverStorable483,SelfDestructingSolverStorable484,SelfDestructingSolverStorable480,SelfDestructingSolverStorable478,SelfDestructingSolverStorable479,SelfDestructingSolverStorable485,SelfDestructingSolverStorable486,SelfDestructingSolverStorable487,SelfDestructingSolverStorable477,SelfDestructingSolverStorable488 [2024-05-07 22:23:08,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:08,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1866994604, now seen corresponding path program 1 times [2024-05-07 22:23:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493355539] [2024-05-07 22:23:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:08,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:09,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:23:09,715 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:23:09,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:23:09,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:23:09,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2024-05-07 22:23:09,715 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:23:09,716 WARN L233 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:23:09,716 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2024-05-07 22:23:10,048 INFO L144 ThreadInstanceAdder]: Constructed 40 joinOtherThreadTransitions. [2024-05-07 22:23:10,054 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:23:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:23:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:23:10,076 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:23:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (42)] Waiting until timeout for monitored process [2024-05-07 22:23:10,079 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:23:10,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:10,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:23:10,080 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:23:10,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:23:11,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:11,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1030088935, now seen corresponding path program 1 times [2024-05-07 22:23:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121940239] [2024-05-07 22:23:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 7605 trivial. 0 not checked. [2024-05-07 22:23:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:23:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121940239] [2024-05-07 22:23:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121940239] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:23:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:23:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:23:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767781095] [2024-05-07 22:23:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:23:11,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:23:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:23:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:23:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:23:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:11,647 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:23:11,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 406.0) internal successors, (812), 2 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:23:11,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:11,707 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 1030 treesize of output 934 [2024-05-07 22:23:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 1 times [2024-05-07 22:23:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:11,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:11,898 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 506 treesize of output 458 [2024-05-07 22:23:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1856946641, now seen corresponding path program 1 times [2024-05-07 22:23:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:12,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:23:12,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:23:12,440 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:12,441 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 550 treesize of output 498 [2024-05-07 22:23:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 2 times [2024-05-07 22:23:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:12,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:12,658 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:12,658 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 1038 treesize of output 938 [2024-05-07 22:23:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1560400209, now seen corresponding path program 1 times [2024-05-07 22:23:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:23:13,130 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:13,130 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 1038 treesize of output 938 [2024-05-07 22:23:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 3 times [2024-05-07 22:23:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:13,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:13,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:23:13,799 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 511 treesize of output 489 [2024-05-07 22:23:13,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:23:13,810 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 71 treesize of output 69 [2024-05-07 22:23:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -617462291, now seen corresponding path program 1 times [2024-05-07 22:23:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:23:14,484 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:14,485 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 1038 treesize of output 938 [2024-05-07 22:23:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 4 times [2024-05-07 22:23:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:23:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:23:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492,SelfDestructingSolverStorable493,SelfDestructingSolverStorable494,SelfDestructingSolverStorable495,SelfDestructingSolverStorable490,SelfDestructingSolverStorable491,SelfDestructingSolverStorable500,SelfDestructingSolverStorable501,SelfDestructingSolverStorable496,SelfDestructingSolverStorable497,SelfDestructingSolverStorable498,SelfDestructingSolverStorable499 [2024-05-07 22:23:29,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:29,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -106864867, now seen corresponding path program 1 times [2024-05-07 22:23:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756058778] [2024-05-07 22:23:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:29,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:31,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:23:31,191 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:23:31,191 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:23:31,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:23:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2024-05-07 22:23:31,192 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:23:31,192 WARN L233 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:23:31,192 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2024-05-07 22:23:31,302 INFO L144 ThreadInstanceAdder]: Constructed 41 joinOtherThreadTransitions. [2024-05-07 22:23:31,308 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:23:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:23:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:23:31,311 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:23:31,333 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:23:31,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:31,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:23:31,333 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:23:31,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:23:31,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (43)] Waiting until timeout for monitored process [2024-05-07 22:23:32,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:32,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 628066759, now seen corresponding path program 1 times [2024-05-07 22:23:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562538214] [2024-05-07 22:23:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8405 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 8000 trivial. 0 not checked. [2024-05-07 22:23:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:23:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562538214] [2024-05-07 22:23:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562538214] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:23:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:23:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:23:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542936077] [2024-05-07 22:23:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:23:32,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:23:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:23:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:23:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:23:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:32,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:23:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 415.5) internal successors, (831), 2 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:23:32,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:32,828 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 506 treesize of output 458 [2024-05-07 22:23:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 1 times [2024-05-07 22:23:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:32,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:33,156 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:23:33,156 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 1038 treesize of output 942 [2024-05-07 22:23:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -454735617, now seen corresponding path program 1 times [2024-05-07 22:23:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:23:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:23:33,633 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:23:33,633 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 1064 treesize of output 964 [2024-05-07 22:23:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 2 times [2024-05-07 22:23:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:33,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:33,965 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:23:33,965 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 278 treesize of output 250 [2024-05-07 22:23:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -854717943, now seen corresponding path program 1 times [2024-05-07 22:23:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:23:34,580 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:34,581 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 550 treesize of output 498 [2024-05-07 22:23:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 3 times [2024-05-07 22:23:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:34,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 235 [2024-05-07 22:23:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1082488758, now seen corresponding path program 1 times [2024-05-07 22:23:35,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:23:36,129 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:23:36,130 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 1038 treesize of output 938 [2024-05-07 22:23:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 4 times [2024-05-07 22:23:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:23:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:23:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508,SelfDestructingSolverStorable509,SelfDestructingSolverStorable504,SelfDestructingSolverStorable505,SelfDestructingSolverStorable506,SelfDestructingSolverStorable507,SelfDestructingSolverStorable511,SelfDestructingSolverStorable512,SelfDestructingSolverStorable513,SelfDestructingSolverStorable503,SelfDestructingSolverStorable514,SelfDestructingSolverStorable510 [2024-05-07 22:23:50,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:50,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1697178761, now seen corresponding path program 1 times [2024-05-07 22:23:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145078299] [2024-05-07 22:23:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:50,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:52,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:23:52,725 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:23:52,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:23:52,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:23:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2024-05-07 22:23:52,726 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:23:52,726 WARN L233 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:23:52,726 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2024-05-07 22:23:52,839 INFO L144 ThreadInstanceAdder]: Constructed 42 joinOtherThreadTransitions. [2024-05-07 22:23:52,845 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:23:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:23:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:23:52,848 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:23:52,873 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:23:52,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:52,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:23:52,874 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:23:52,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:23:52,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (44)] Waiting until timeout for monitored process [2024-05-07 22:23:53,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:23:53,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:23:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1182224632, now seen corresponding path program 1 times [2024-05-07 22:23:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:23:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976635600] [2024-05-07 22:23:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8820 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 8405 trivial. 0 not checked. [2024-05-07 22:23:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:23:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976635600] [2024-05-07 22:23:54,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976635600] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:23:54,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:23:54,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:23:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161648957] [2024-05-07 22:23:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:23:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:23:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:23:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:23:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:23:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:54,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:23:54,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 425.0) internal successors, (850), 2 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:23:54,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:23:54,482 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:23:54,483 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 1038 treesize of output 942 [2024-05-07 22:23:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 1 times [2024-05-07 22:23:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:54,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:54,694 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:23:54,694 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 568 treesize of output 520 [2024-05-07 22:23:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1286176611, now seen corresponding path program 1 times [2024-05-07 22:23:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:54,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:23:54,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:23:55,077 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:23:55,077 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 1046 treesize of output 946 [2024-05-07 22:23:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 2 times [2024-05-07 22:23:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:55,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:55,287 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:23:55,288 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 576 treesize of output 524 [2024-05-07 22:23:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1237667854, now seen corresponding path program 1 times [2024-05-07 22:23:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:23:55,934 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:23:55,934 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 522 treesize of output 470 [2024-05-07 22:23:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 3 times [2024-05-07 22:23:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:56,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:23:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:23:56,598 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 1018 treesize of output 922 [2024-05-07 22:23:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -618224910, now seen corresponding path program 1 times [2024-05-07 22:23:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:23:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:23:57,322 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:23:57,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 22:23:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 4 times [2024-05-07 22:23:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:23:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:23:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:23:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:23:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:23:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:24:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:12,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519,SelfDestructingSolverStorable526,SelfDestructingSolverStorable516,SelfDestructingSolverStorable527,SelfDestructingSolverStorable517,SelfDestructingSolverStorable518,SelfDestructingSolverStorable522,SelfDestructingSolverStorable523,SelfDestructingSolverStorable524,SelfDestructingSolverStorable525,SelfDestructingSolverStorable520,SelfDestructingSolverStorable521 [2024-05-07 22:24:12,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:24:12,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash 323411040, now seen corresponding path program 1 times [2024-05-07 22:24:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:24:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3460820] [2024-05-07 22:24:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:12,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:14,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:24:14,194 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:24:14,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:24:14,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:24:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2024-05-07 22:24:14,195 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:24:14,195 WARN L233 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:24:14,195 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2024-05-07 22:24:14,339 INFO L144 ThreadInstanceAdder]: Constructed 43 joinOtherThreadTransitions. [2024-05-07 22:24:14,352 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:24:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:24:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:24:14,355 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:24:14,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (45)] Waiting until timeout for monitored process [2024-05-07 22:24:14,374 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:24:14,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:14,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:24:14,375 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:24:14,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:24:15,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:24:15,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1609041046, now seen corresponding path program 1 times [2024-05-07 22:24:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:24:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370091308] [2024-05-07 22:24:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9245 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 8820 trivial. 0 not checked. [2024-05-07 22:24:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:24:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370091308] [2024-05-07 22:24:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370091308] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:24:15,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:24:15,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:24:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909180759] [2024-05-07 22:24:15,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:24:15,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:24:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:24:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:24:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:24:15,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:15,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:24:15,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 434.5) internal successors, (869), 2 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:24:15,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:15,695 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:24:15,695 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 1038 treesize of output 942 [2024-05-07 22:24:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 1 times [2024-05-07 22:24:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:15,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:15,879 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:24:15,879 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 1038 treesize of output 942 [2024-05-07 22:24:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2080328414, now seen corresponding path program 1 times [2024-05-07 22:24:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:24:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:24:16,259 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:16,260 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 278 treesize of output 250 [2024-05-07 22:24:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 2 times [2024-05-07 22:24:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:16,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:16,480 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:16,480 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 522 treesize of output 470 [2024-05-07 22:24:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1661468115, now seen corresponding path program 1 times [2024-05-07 22:24:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:16,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:16,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:24:16,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:24:17,131 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:17,131 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 558 treesize of output 506 [2024-05-07 22:24:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 3 times [2024-05-07 22:24:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:17,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:18,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:24:18,354 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 511 treesize of output 489 [2024-05-07 22:24:18,364 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:24:18,364 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 71 treesize of output 69 [2024-05-07 22:24:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1100278383, now seen corresponding path program 1 times [2024-05-07 22:24:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:24:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:24:19,218 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:24:19,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:24:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 4 times [2024-05-07 22:24:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:24:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:24:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:33,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537,SelfDestructingSolverStorable538,SelfDestructingSolverStorable539,SelfDestructingSolverStorable529,SelfDestructingSolverStorable533,SelfDestructingSolverStorable534,SelfDestructingSolverStorable535,SelfDestructingSolverStorable536,SelfDestructingSolverStorable540,SelfDestructingSolverStorable530,SelfDestructingSolverStorable531,SelfDestructingSolverStorable532 [2024-05-07 22:24:33,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:24:33,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1834117431, now seen corresponding path program 1 times [2024-05-07 22:24:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:24:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340541889] [2024-05-07 22:24:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:33,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:35,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:24:35,081 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:24:35,081 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:24:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:24:35,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2024-05-07 22:24:35,082 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:24:35,082 WARN L233 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:24:35,082 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2024-05-07 22:24:35,325 INFO L144 ThreadInstanceAdder]: Constructed 44 joinOtherThreadTransitions. [2024-05-07 22:24:35,332 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:24:35,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:24:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:24:35,335 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:24:35,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Waiting until timeout for monitored process [2024-05-07 22:24:35,357 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:24:35,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:35,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:24:35,358 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:24:35,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:24:36,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:24:36,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:24:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -623561043, now seen corresponding path program 1 times [2024-05-07 22:24:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:24:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216004674] [2024-05-07 22:24:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9680 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 9245 trivial. 0 not checked. [2024-05-07 22:24:36,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:24:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216004674] [2024-05-07 22:24:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216004674] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:24:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:24:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:24:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676092107] [2024-05-07 22:24:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:24:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:24:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:24:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:24:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:24:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:36,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:24:36,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 444.0) internal successors, (888), 2 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:24:36,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:24:36,940 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:24:36,940 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 270 treesize of output 246 [2024-05-07 22:24:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 1 times [2024-05-07 22:24:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:39,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:39,311 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 1030 treesize of output 934 [2024-05-07 22:24:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash -182865010, now seen corresponding path program 1 times [2024-05-07 22:24:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:39,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:24:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:24:39,854 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:39,854 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 522 treesize of output 470 [2024-05-07 22:24:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 2 times [2024-05-07 22:24:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:40,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:40,182 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:40,183 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 296 treesize of output 268 [2024-05-07 22:24:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 261951848, now seen corresponding path program 1 times [2024-05-07 22:24:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:24:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:24:41,005 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:24:41,005 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 278 treesize of output 250 [2024-05-07 22:24:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 3 times [2024-05-07 22:24:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:41,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:24:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:24:42,107 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 259 treesize of output 235 [2024-05-07 22:24:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1254415831, now seen corresponding path program 1 times [2024-05-07 22:24:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:24:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:24:42,922 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:24:42,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 22:24:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 4 times [2024-05-07 22:24:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:24:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:24:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:24:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:24:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:24:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:25:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:01,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550,SelfDestructingSolverStorable548,SelfDestructingSolverStorable549,SelfDestructingSolverStorable544,SelfDestructingSolverStorable545,SelfDestructingSolverStorable546,SelfDestructingSolverStorable547,SelfDestructingSolverStorable551,SelfDestructingSolverStorable552,SelfDestructingSolverStorable542,SelfDestructingSolverStorable553,SelfDestructingSolverStorable543 [2024-05-07 22:25:01,885 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:25:01,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1278800951, now seen corresponding path program 1 times [2024-05-07 22:25:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:25:01,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703002015] [2024-05-07 22:25:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:02,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:04,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:25:04,317 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:25:04,317 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:25:04,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:25:04,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2024-05-07 22:25:04,318 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:25:04,318 WARN L233 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:25:04,318 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2024-05-07 22:25:04,521 INFO L144 ThreadInstanceAdder]: Constructed 45 joinOtherThreadTransitions. [2024-05-07 22:25:04,529 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:25:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:25:04,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:25:04,581 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:25:04,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (47)] Waiting until timeout for monitored process [2024-05-07 22:25:04,602 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:25:04,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:04,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:25:04,602 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:25:04,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:25:06,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:25:06,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1454894191, now seen corresponding path program 1 times [2024-05-07 22:25:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:25:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707284158] [2024-05-07 22:25:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10125 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 9680 trivial. 0 not checked. [2024-05-07 22:25:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:25:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707284158] [2024-05-07 22:25:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707284158] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:25:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:25:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:25:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261222449] [2024-05-07 22:25:06,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:25:06,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:25:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:25:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:25:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:25:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:06,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:25:06,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 453.5) internal successors, (907), 2 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:25:06,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:06,720 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:25:06,721 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 1038 treesize of output 942 [2024-05-07 22:25:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 1 times [2024-05-07 22:25:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:06,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:07,013 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:25:07,013 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 550 treesize of output 502 [2024-05-07 22:25:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -119995717, now seen corresponding path program 1 times [2024-05-07 22:25:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:25:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:25:07,524 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:25:07,525 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 1046 treesize of output 946 [2024-05-07 22:25:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 2 times [2024-05-07 22:25:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:07,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:07,753 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:25:07,753 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 576 treesize of output 524 [2024-05-07 22:25:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash 28480799, now seen corresponding path program 1 times [2024-05-07 22:25:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:25:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:25:08,407 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:25:08,408 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 1046 treesize of output 946 [2024-05-07 22:25:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 3 times [2024-05-07 22:25:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:08,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:09,243 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 500 treesize of output 452 [2024-05-07 22:25:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1165129275, now seen corresponding path program 1 times [2024-05-07 22:25:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:09,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:25:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:25:09,912 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:25:09,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 22:25:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 4 times [2024-05-07 22:25:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:25:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:25:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:28,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560,SelfDestructingSolverStorable561,SelfDestructingSolverStorable559,SelfDestructingSolverStorable555,SelfDestructingSolverStorable566,SelfDestructingSolverStorable556,SelfDestructingSolverStorable557,SelfDestructingSolverStorable558,SelfDestructingSolverStorable562,SelfDestructingSolverStorable563,SelfDestructingSolverStorable564,SelfDestructingSolverStorable565 [2024-05-07 22:25:28,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:25:28,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1938813795, now seen corresponding path program 1 times [2024-05-07 22:25:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:25:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451967223] [2024-05-07 22:25:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:28,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:30,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:25:30,706 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:25:30,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:25:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:25:30,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2024-05-07 22:25:30,707 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:25:30,707 WARN L233 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:25:30,707 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2024-05-07 22:25:30,844 INFO L144 ThreadInstanceAdder]: Constructed 46 joinOtherThreadTransitions. [2024-05-07 22:25:30,852 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:25:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:25:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:25:30,860 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:25:30,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (48)] Waiting until timeout for monitored process [2024-05-07 22:25:30,878 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:25:30,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:30,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:25:30,879 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:25:30,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:25:32,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:25:32,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -188066090, now seen corresponding path program 1 times [2024-05-07 22:25:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:25:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597148247] [2024-05-07 22:25:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10580 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 10125 trivial. 0 not checked. [2024-05-07 22:25:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:25:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597148247] [2024-05-07 22:25:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597148247] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:25:32,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:25:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:25:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315915085] [2024-05-07 22:25:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:25:32,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:25:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:25:32,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:25:32,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:25:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:32,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:25:32,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 463.0) internal successors, (926), 2 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:25:32,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:32,773 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 506 treesize of output 458 [2024-05-07 22:25:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 1 times [2024-05-07 22:25:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:32,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:32,981 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 506 treesize of output 458 [2024-05-07 22:25:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash 542211729, now seen corresponding path program 1 times [2024-05-07 22:25:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:25:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:25:33,553 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:25:33,554 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 1064 treesize of output 964 [2024-05-07 22:25:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 2 times [2024-05-07 22:25:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:33,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:33,791 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:25:33,791 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 576 treesize of output 524 [2024-05-07 22:25:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1544295493, now seen corresponding path program 1 times [2024-05-07 22:25:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:34,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:25:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:25:34,522 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:25:34,522 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 514 treesize of output 462 [2024-05-07 22:25:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 3 times [2024-05-07 22:25:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:34,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:35,122 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 536 treesize of output 488 [2024-05-07 22:25:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1335849103, now seen corresponding path program 1 times [2024-05-07 22:25:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:25:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:25:35,812 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:25:35,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 22:25:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 4 times [2024-05-07 22:25:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:35,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:25:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:25:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:25:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:25:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:25:55,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570,SelfDestructingSolverStorable571,SelfDestructingSolverStorable572,SelfDestructingSolverStorable577,SelfDestructingSolverStorable578,SelfDestructingSolverStorable568,SelfDestructingSolverStorable579,SelfDestructingSolverStorable569,SelfDestructingSolverStorable573,SelfDestructingSolverStorable574,SelfDestructingSolverStorable575,SelfDestructingSolverStorable576 [2024-05-07 22:25:55,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:25:55,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash 882511359, now seen corresponding path program 1 times [2024-05-07 22:25:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:25:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457942158] [2024-05-07 22:25:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:25:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:25:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:55,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:25:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:25:57,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:25:57,916 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:25:57,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:25:57,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:25:57,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2024-05-07 22:25:57,916 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:25:57,917 WARN L233 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:25:57,917 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2024-05-07 22:25:58,078 INFO L144 ThreadInstanceAdder]: Constructed 47 joinOtherThreadTransitions. [2024-05-07 22:25:58,085 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:25:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:25:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:25:58,088 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:25:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (49)] Waiting until timeout for monitored process [2024-05-07 22:25:58,108 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:25:58,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:25:58,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:25:58,109 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:25:58,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:26:00,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:26:00,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:26:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash 384357948, now seen corresponding path program 1 times [2024-05-07 22:26:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:26:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728718884] [2024-05-07 22:26:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 10580 trivial. 0 not checked. [2024-05-07 22:26:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:26:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728718884] [2024-05-07 22:26:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728718884] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:26:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:26:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:26:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573173330] [2024-05-07 22:26:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:26:00,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:26:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:26:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:26:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:26:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:00,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:26:00,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 472.5) internal successors, (945), 2 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:26:00,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:00,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 934 [2024-05-07 22:26:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 1 times [2024-05-07 22:26:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:00,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:00,875 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:26:00,876 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 270 treesize of output 246 [2024-05-07 22:26:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1151678908, now seen corresponding path program 1 times [2024-05-07 22:26:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:26:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:26:01,364 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:26:01,365 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 576 treesize of output 524 [2024-05-07 22:26:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 2 times [2024-05-07 22:26:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:01,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:01,588 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:26:01,588 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 550 treesize of output 498 [2024-05-07 22:26:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1911254796, now seen corresponding path program 1 times [2024-05-07 22:26:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:26:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:26:02,294 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:26:02,294 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 1038 treesize of output 938 [2024-05-07 22:26:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 3 times [2024-05-07 22:26:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:02,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:02,843 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 536 treesize of output 488 [2024-05-07 22:26:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1979587254, now seen corresponding path program 1 times [2024-05-07 22:26:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:26:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:26:03,498 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:26:03,498 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 270 treesize of output 242 [2024-05-07 22:26:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 4 times [2024-05-07 22:26:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:26:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:26:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591,SelfDestructingSolverStorable581,SelfDestructingSolverStorable592,SelfDestructingSolverStorable582,SelfDestructingSolverStorable583,SelfDestructingSolverStorable590,SelfDestructingSolverStorable588,SelfDestructingSolverStorable589,SelfDestructingSolverStorable584,SelfDestructingSolverStorable585,SelfDestructingSolverStorable586,SelfDestructingSolverStorable587 [2024-05-07 22:26:26,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:26:26,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:26:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -543012576, now seen corresponding path program 1 times [2024-05-07 22:26:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:26:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946679925] [2024-05-07 22:26:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:26,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:29,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:26:29,124 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:26:29,124 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:26:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:26:29,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2024-05-07 22:26:29,125 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:26:29,125 WARN L233 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:26:29,125 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2024-05-07 22:26:29,251 INFO L144 ThreadInstanceAdder]: Constructed 48 joinOtherThreadTransitions. [2024-05-07 22:26:29,258 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:26:29,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:26:29,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:26:29,261 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:26:29,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (50)] Waiting until timeout for monitored process [2024-05-07 22:26:29,279 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:26:29,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:26:29,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:26:29,280 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:26:29,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:26:31,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:26:31,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:26:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -174884221, now seen corresponding path program 1 times [2024-05-07 22:26:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:26:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982160719] [2024-05-07 22:26:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 11045 trivial. 0 not checked. [2024-05-07 22:26:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:26:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982160719] [2024-05-07 22:26:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982160719] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:26:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:26:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:26:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559711884] [2024-05-07 22:26:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:26:31,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:26:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:26:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:26:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:26:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:31,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:26:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 482.0) internal successors, (964), 2 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:26:31,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:31,541 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:26:31,541 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 568 treesize of output 520 [2024-05-07 22:26:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 1 times [2024-05-07 22:26:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:31,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:31,735 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 1030 treesize of output 934 [2024-05-07 22:26:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash -60780354, now seen corresponding path program 1 times [2024-05-07 22:26:31,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:31,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:32,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:32,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:26:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:26:32,398 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:26:32,398 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 270 treesize of output 242 [2024-05-07 22:26:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 2 times [2024-05-07 22:26:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:32,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:32,640 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:26:32,640 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 296 treesize of output 268 [2024-05-07 22:26:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1537588450, now seen corresponding path program 1 times [2024-05-07 22:26:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:26:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:26:33,087 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:26:33,088 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 540 treesize of output 488 [2024-05-07 22:26:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 3 times [2024-05-07 22:26:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:33,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:34,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:26:34,138 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 1029 treesize of output 983 [2024-05-07 22:26:34,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:26:34,148 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 43 treesize of output 43 [2024-05-07 22:26:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1310138098, now seen corresponding path program 1 times [2024-05-07 22:26:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:34,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:26:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:26:34,821 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:26:34,821 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 550 treesize of output 498 [2024-05-07 22:26:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 4 times [2024-05-07 22:26:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:26:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:26:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:26:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:26:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:26:58,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594,SelfDestructingSolverStorable603,SelfDestructingSolverStorable604,SelfDestructingSolverStorable605,SelfDestructingSolverStorable599,SelfDestructingSolverStorable600,SelfDestructingSolverStorable601,SelfDestructingSolverStorable602,SelfDestructingSolverStorable595,SelfDestructingSolverStorable596,SelfDestructingSolverStorable597,SelfDestructingSolverStorable598 [2024-05-07 22:26:58,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:26:58,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:26:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -452002736, now seen corresponding path program 1 times [2024-05-07 22:26:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:26:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186992448] [2024-05-07 22:26:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:26:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:26:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:26:59,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:26:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:01,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:27:01,416 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:27:01,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:27:01,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:27:01,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2024-05-07 22:27:01,417 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:27:01,417 WARN L233 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:27:01,417 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2024-05-07 22:27:01,567 INFO L144 ThreadInstanceAdder]: Constructed 49 joinOtherThreadTransitions. [2024-05-07 22:27:01,594 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:27:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:27:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:27:01,611 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:27:01,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (51)] Waiting until timeout for monitored process [2024-05-07 22:27:01,632 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:27:01,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:27:01,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:27:01,632 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:27:01,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:27:03,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:27:03,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:27:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash -205816981, now seen corresponding path program 1 times [2024-05-07 22:27:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:27:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449645256] [2024-05-07 22:27:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12005 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 11520 trivial. 0 not checked. [2024-05-07 22:27:04,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:27:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449645256] [2024-05-07 22:27:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449645256] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:27:04,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:27:04,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:27:04,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235095285] [2024-05-07 22:27:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:27:04,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:27:04,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:27:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:27:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:27:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:27:04,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:27:04,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 491.5) internal successors, (983), 2 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:27:04,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:27:04,128 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:27:04,128 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 270 treesize of output 246 [2024-05-07 22:27:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 1 times [2024-05-07 22:27:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:04,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:04,365 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:27:04,365 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 288 treesize of output 264 [2024-05-07 22:27:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1736445115, now seen corresponding path program 1 times [2024-05-07 22:27:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:27:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:27:04,880 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:27:04,880 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 522 treesize of output 470 [2024-05-07 22:27:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 2 times [2024-05-07 22:27:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:04,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:05,129 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:27:05,129 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 296 treesize of output 268 [2024-05-07 22:27:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1624476401, now seen corresponding path program 1 times [2024-05-07 22:27:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:27:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:27:05,849 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:27:05,849 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 1046 treesize of output 946 [2024-05-07 22:27:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 3 times [2024-05-07 22:27:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:05,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:06,602 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 259 treesize of output 235 [2024-05-07 22:27:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1161697005, now seen corresponding path program 1 times [2024-05-07 22:27:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:27:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:27:07,569 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:27:07,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 22:27:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 4 times [2024-05-07 22:27:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:07,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:27:07,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:27:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:27:33,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607,SelfDestructingSolverStorable618,SelfDestructingSolverStorable608,SelfDestructingSolverStorable609,SelfDestructingSolverStorable614,SelfDestructingSolverStorable615,SelfDestructingSolverStorable616,SelfDestructingSolverStorable617,SelfDestructingSolverStorable610,SelfDestructingSolverStorable611,SelfDestructingSolverStorable612,SelfDestructingSolverStorable613 [2024-05-07 22:27:33,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:27:33,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:27:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 99834546, now seen corresponding path program 1 times [2024-05-07 22:27:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:27:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134777876] [2024-05-07 22:27:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:33,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:35,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:27:35,817 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:27:35,817 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:27:35,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:27:35,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2024-05-07 22:27:35,817 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:27:35,818 WARN L233 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:27:35,818 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2024-05-07 22:27:35,969 INFO L144 ThreadInstanceAdder]: Constructed 50 joinOtherThreadTransitions. [2024-05-07 22:27:35,976 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:27:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:27:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:27:35,980 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:27:35,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (52)] Waiting until timeout for monitored process [2024-05-07 22:27:36,000 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:27:36,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:27:36,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:27:36,001 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:27:36,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:27:38,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:27:38,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:27:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1072930124, now seen corresponding path program 1 times [2024-05-07 22:27:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:27:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87972489] [2024-05-07 22:27:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12500 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 12005 trivial. 0 not checked. [2024-05-07 22:27:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:27:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87972489] [2024-05-07 22:27:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87972489] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:27:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:27:38,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:27:38,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861656031] [2024-05-07 22:27:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:27:38,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:27:38,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:27:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:27:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:27:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:27:38,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:27:38,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 501.0) internal successors, (1002), 2 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:27:38,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:27:38,716 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 1030 treesize of output 934 [2024-05-07 22:27:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 1 times [2024-05-07 22:27:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:38,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:38,975 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:27:38,975 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 270 treesize of output 246 [2024-05-07 22:27:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1765775622, now seen corresponding path program 1 times [2024-05-07 22:27:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:27:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:27:39,525 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:27:39,525 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 576 treesize of output 524 [2024-05-07 22:27:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 2 times [2024-05-07 22:27:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:39,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:39,890 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:27:39,891 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 1038 treesize of output 938 [2024-05-07 22:27:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1941771195, now seen corresponding path program 1 times [2024-05-07 22:27:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:27:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:27:40,501 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:27:40,502 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 540 treesize of output 488 [2024-05-07 22:27:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 3 times [2024-05-07 22:27:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:40,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:27:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:27:41,212 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 500 treesize of output 452 [2024-05-07 22:27:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2034771204, now seen corresponding path program 1 times [2024-05-07 22:27:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:27:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:27:41,996 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:27:41,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 22:27:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 4 times [2024-05-07 22:27:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:27:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:27:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:27:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:27:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:27:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:28:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629,SelfDestructingSolverStorable625,SelfDestructingSolverStorable626,SelfDestructingSolverStorable627,SelfDestructingSolverStorable628,SelfDestructingSolverStorable621,SelfDestructingSolverStorable622,SelfDestructingSolverStorable623,SelfDestructingSolverStorable624,SelfDestructingSolverStorable630,SelfDestructingSolverStorable620,SelfDestructingSolverStorable631 [2024-05-07 22:28:08,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:28:08,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash -797473463, now seen corresponding path program 1 times [2024-05-07 22:28:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:28:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651693679] [2024-05-07 22:28:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:08,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:11,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:28:11,597 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:28:11,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:28:11,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:28:11,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2024-05-07 22:28:11,598 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:28:11,598 WARN L233 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:28:11,598 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2024-05-07 22:28:11,766 INFO L144 ThreadInstanceAdder]: Constructed 51 joinOtherThreadTransitions. [2024-05-07 22:28:11,774 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:28:11,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:28:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:28:11,777 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:28:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (53)] Waiting until timeout for monitored process [2024-05-07 22:28:12,008 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:28:12,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:12,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:28:12,009 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:28:12,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:28:13,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:28:13,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1259572706, now seen corresponding path program 1 times [2024-05-07 22:28:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:28:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18849596] [2024-05-07 22:28:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13005 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 12500 trivial. 0 not checked. [2024-05-07 22:28:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:28:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18849596] [2024-05-07 22:28:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18849596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:28:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:28:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:28:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685657169] [2024-05-07 22:28:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:28:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:28:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:28:13,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:28:13,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:28:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:13,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:28:13,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 510.5) internal successors, (1021), 2 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:28:13,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:13,882 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:28:13,883 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 568 treesize of output 520 [2024-05-07 22:28:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 1 times [2024-05-07 22:28:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:13,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:14,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:14,115 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:28:14,116 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 550 treesize of output 502 [2024-05-07 22:28:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1495987074, now seen corresponding path program 1 times [2024-05-07 22:28:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:14,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:28:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:28:14,631 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:28:14,631 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 270 treesize of output 242 [2024-05-07 22:28:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 2 times [2024-05-07 22:28:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:14,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:15,044 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:28:15,045 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 558 treesize of output 506 [2024-05-07 22:28:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 293779767, now seen corresponding path program 1 times [2024-05-07 22:28:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:28:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:28:15,612 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:28:15,612 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 296 treesize of output 268 [2024-05-07 22:28:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 3 times [2024-05-07 22:28:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:15,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:16,501 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 536 treesize of output 488 [2024-05-07 22:28:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2020117263, now seen corresponding path program 1 times [2024-05-07 22:28:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:28:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:28:17,294 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:28:17,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 22:28:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 4 times [2024-05-07 22:28:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:28:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:28:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636,SelfDestructingSolverStorable637,SelfDestructingSolverStorable638,SelfDestructingSolverStorable639,SelfDestructingSolverStorable643,SelfDestructingSolverStorable633,SelfDestructingSolverStorable644,SelfDestructingSolverStorable634,SelfDestructingSolverStorable635,SelfDestructingSolverStorable640,SelfDestructingSolverStorable641,SelfDestructingSolverStorable642 [2024-05-07 22:28:39,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:28:39,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1758872406, now seen corresponding path program 1 times [2024-05-07 22:28:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:28:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477211742] [2024-05-07 22:28:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:40,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:43,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:28:43,241 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:28:43,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:28:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:28:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2024-05-07 22:28:43,242 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:28:43,242 WARN L233 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:28:43,242 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2024-05-07 22:28:43,391 INFO L144 ThreadInstanceAdder]: Constructed 52 joinOtherThreadTransitions. [2024-05-07 22:28:43,398 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:28:43,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:28:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:28:43,401 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:28:43,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (54)] Waiting until timeout for monitored process [2024-05-07 22:28:43,418 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:28:43,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:43,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:28:43,418 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:28:43,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:28:44,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:28:44,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:28:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -587040919, now seen corresponding path program 1 times [2024-05-07 22:28:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:28:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103682065] [2024-05-07 22:28:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13520 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 13005 trivial. 0 not checked. [2024-05-07 22:28:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:28:44,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103682065] [2024-05-07 22:28:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103682065] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:28:44,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:28:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:28:44,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239789470] [2024-05-07 22:28:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:28:44,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:28:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:28:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:28:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:28:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:44,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:28:44,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 520.0) internal successors, (1040), 2 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:28:44,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:28:44,703 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 542 treesize of output 494 [2024-05-07 22:28:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 1 times [2024-05-07 22:28:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:44,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:45,128 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 542 treesize of output 494 [2024-05-07 22:28:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1755137396, now seen corresponding path program 1 times [2024-05-07 22:28:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:28:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:28:45,554 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:28:45,555 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 270 treesize of output 242 [2024-05-07 22:28:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 2 times [2024-05-07 22:28:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:45,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:45,852 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:28:45,852 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 540 treesize of output 488 [2024-05-07 22:28:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2130497832, now seen corresponding path program 1 times [2024-05-07 22:28:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:28:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:28:46,607 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:28:46,607 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 296 treesize of output 268 [2024-05-07 22:28:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 3 times [2024-05-07 22:28:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:46,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:28:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:28:47,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:28:47,443 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 547 treesize of output 525 [2024-05-07 22:28:47,447 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 15 treesize of output 13 [2024-05-07 22:28:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1593017129, now seen corresponding path program 1 times [2024-05-07 22:28:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:28:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:28:48,042 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:28:48,042 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 1038 treesize of output 938 [2024-05-07 22:28:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 4 times [2024-05-07 22:28:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:28:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:28:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:28:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:28:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:28:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:29:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:05,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647,SelfDestructingSolverStorable648,SelfDestructingSolverStorable649,SelfDestructingSolverStorable654,SelfDestructingSolverStorable655,SelfDestructingSolverStorable656,SelfDestructingSolverStorable646,SelfDestructingSolverStorable657,SelfDestructingSolverStorable650,SelfDestructingSolverStorable651,SelfDestructingSolverStorable652,SelfDestructingSolverStorable653 [2024-05-07 22:29:05,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:29:05,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash -879243271, now seen corresponding path program 1 times [2024-05-07 22:29:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:29:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650472713] [2024-05-07 22:29:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:05,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:08,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:29:08,543 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:29:08,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:29:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:29:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2024-05-07 22:29:08,544 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:29:08,544 WARN L233 ceAbstractionStarter]: 52 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:29:08,544 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 53 thread instances. [2024-05-07 22:29:08,692 INFO L144 ThreadInstanceAdder]: Constructed 53 joinOtherThreadTransitions. [2024-05-07 22:29:08,699 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:29:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:29:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:29:08,702 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:29:08,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (55)] Waiting until timeout for monitored process [2024-05-07 22:29:08,723 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:29:08,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:08,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:29:08,723 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:29:08,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:29:09,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:29:09,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 720969813, now seen corresponding path program 1 times [2024-05-07 22:29:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:29:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668953227] [2024-05-07 22:29:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14045 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 13520 trivial. 0 not checked. [2024-05-07 22:29:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:29:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668953227] [2024-05-07 22:29:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668953227] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:29:10,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:29:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:29:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075246440] [2024-05-07 22:29:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:29:10,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:29:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:29:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:29:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:29:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:10,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:29:10,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 529.5) internal successors, (1059), 2 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:29:10,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:10,279 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:29:10,280 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 1038 treesize of output 942 [2024-05-07 22:29:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1972340580, now seen corresponding path program 1 times [2024-05-07 22:29:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:10,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:10,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-05-07 22:29:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -937164612, now seen corresponding path program 1 times [2024-05-07 22:29:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:29:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:29:11,117 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:29:11,117 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 1046 treesize of output 946 [2024-05-07 22:29:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1972340580, now seen corresponding path program 2 times [2024-05-07 22:29:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:11,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:11,613 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:29:11,614 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 514 treesize of output 462 [2024-05-07 22:29:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1721855829, now seen corresponding path program 1 times [2024-05-07 22:29:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:12,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:29:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:29:12,350 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:29:12,350 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 558 treesize of output 506 [2024-05-07 22:29:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1972340580, now seen corresponding path program 3 times [2024-05-07 22:29:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:12,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:13,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:29:13,227 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 1029 treesize of output 983 [2024-05-07 22:29:13,233 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 15 treesize of output 13 [2024-05-07 22:29:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1424983289, now seen corresponding path program 1 times [2024-05-07 22:29:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:29:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:29:14,169 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:29:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 22:29:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1972340580, now seen corresponding path program 4 times [2024-05-07 22:29:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:14,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:29:14,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:29:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:34,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670,SelfDestructingSolverStorable660,SelfDestructingSolverStorable669,SelfDestructingSolverStorable659,SelfDestructingSolverStorable665,SelfDestructingSolverStorable666,SelfDestructingSolverStorable667,SelfDestructingSolverStorable668,SelfDestructingSolverStorable661,SelfDestructingSolverStorable662,SelfDestructingSolverStorable663,SelfDestructingSolverStorable664 [2024-05-07 22:29:34,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:29:34,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1926260843, now seen corresponding path program 1 times [2024-05-07 22:29:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:29:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387636] [2024-05-07 22:29:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:34,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:37,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:29:37,916 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:29:37,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:29:37,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:29:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2024-05-07 22:29:37,917 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:29:37,917 WARN L233 ceAbstractionStarter]: 53 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:29:37,917 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 54 thread instances. [2024-05-07 22:29:38,247 INFO L144 ThreadInstanceAdder]: Constructed 54 joinOtherThreadTransitions. [2024-05-07 22:29:38,255 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:29:38,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:29:38,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:29:38,259 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:29:38,286 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:29:38,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:38,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:29:38,287 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:29:38,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:29:38,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (56)] Waiting until timeout for monitored process [2024-05-07 22:29:40,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:29:40,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:29:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1135816354, now seen corresponding path program 1 times [2024-05-07 22:29:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:29:40,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591844575] [2024-05-07 22:29:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14580 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 14045 trivial. 0 not checked. [2024-05-07 22:29:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:29:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591844575] [2024-05-07 22:29:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591844575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:29:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:29:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:29:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386165736] [2024-05-07 22:29:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:29:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:29:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:29:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:29:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:29:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:41,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:29:41,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 539.0) internal successors, (1078), 2 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:29:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:29:41,350 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:29:41,350 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 288 treesize of output 264 [2024-05-07 22:29:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1703549685, now seen corresponding path program 1 times [2024-05-07 22:29:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:41,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:41,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:41,575 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 1030 treesize of output 934 [2024-05-07 22:29:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -13243527, now seen corresponding path program 1 times [2024-05-07 22:29:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:29:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:29:42,206 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:29:42,206 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 540 treesize of output 488 [2024-05-07 22:29:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1703549685, now seen corresponding path program 2 times [2024-05-07 22:29:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:42,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:42,484 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:29:42,484 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 1064 treesize of output 964 [2024-05-07 22:29:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 755050421, now seen corresponding path program 1 times [2024-05-07 22:29:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:29:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:29:43,310 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:29:43,311 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 540 treesize of output 488 [2024-05-07 22:29:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1703549685, now seen corresponding path program 3 times [2024-05-07 22:29:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:43,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:29:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:29:43,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:29:43,928 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 511 treesize of output 489 [2024-05-07 22:29:43,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:29:43,938 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 71 treesize of output 69 [2024-05-07 22:29:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 982717281, now seen corresponding path program 1 times [2024-05-07 22:29:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:44,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:29:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:29:44,768 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:29:44,768 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 270 treesize of output 242 [2024-05-07 22:29:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1703549685, now seen corresponding path program 4 times [2024-05-07 22:29:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:29:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:29:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:29:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:29:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:29:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 22:30:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:30:16,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680,SelfDestructingSolverStorable681,SelfDestructingSolverStorable682,SelfDestructingSolverStorable676,SelfDestructingSolverStorable677,SelfDestructingSolverStorable678,SelfDestructingSolverStorable679,SelfDestructingSolverStorable672,SelfDestructingSolverStorable683,SelfDestructingSolverStorable673,SelfDestructingSolverStorable674,SelfDestructingSolverStorable675 [2024-05-07 22:30:16,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:30:16,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:30:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1766842608, now seen corresponding path program 1 times [2024-05-07 22:30:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:30:16,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321769202] [2024-05-07 22:30:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:17,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:30:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:20,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 22:30:20,673 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 22:30:20,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 22:30:20,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 22:30:20,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2024-05-07 22:30:20,674 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 22:30:20,674 WARN L233 ceAbstractionStarter]: 54 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 22:30:20,674 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 55 thread instances. [2024-05-07 22:30:20,905 INFO L144 ThreadInstanceAdder]: Constructed 55 joinOtherThreadTransitions. [2024-05-07 22:30:20,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 22:30:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 22:30:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 22:30:20,956 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 22:30:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (57)] Waiting until timeout for monitored process [2024-05-07 22:30:20,992 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 22:30:20,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:30:20,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 22:30:20,992 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;@926d3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 22:30:20,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 22:30:22,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 22:30:22,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 22:30:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash 374584592, now seen corresponding path program 1 times [2024-05-07 22:30:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 22:30:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198416820] [2024-05-07 22:30:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15125 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 14580 trivial. 0 not checked. [2024-05-07 22:30:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 22:30:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198416820] [2024-05-07 22:30:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198416820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 22:30:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 22:30:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 22:30:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371707707] [2024-05-07 22:30:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 22:30:23,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 22:30:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 22:30:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 22:30:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 22:30:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:30:23,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 22:30:23,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 548.5) internal successors, (1097), 2 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 22:30:23,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 22:30:23,174 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:30:23,175 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 550 treesize of output 502 [2024-05-07 22:30:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1572335675, now seen corresponding path program 1 times [2024-05-07 22:30:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:23,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:30:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:23,519 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 22:30:23,519 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 514 treesize of output 466 [2024-05-07 22:30:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash 322003889, now seen corresponding path program 1 times [2024-05-07 22:30:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 22:30:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 22:30:24,208 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:30:24,208 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 558 treesize of output 506 [2024-05-07 22:30:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1572335675, now seen corresponding path program 2 times [2024-05-07 22:30:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:24,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:30:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:24,682 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 22:30:24,683 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 1038 treesize of output 938 [2024-05-07 22:30:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1110620005, now seen corresponding path program 1 times [2024-05-07 22:30:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:30:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 22:30:25,395 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 22:30:25,395 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 522 treesize of output 470 [2024-05-07 22:30:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1572335675, now seen corresponding path program 3 times [2024-05-07 22:30:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:25,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 22:30:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 22:30:27,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:30:27,002 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 511 treesize of output 489 [2024-05-07 22:30:27,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 22:30:27,015 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 71 treesize of output 69 [2024-05-07 22:30:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1580484957, now seen corresponding path program 1 times [2024-05-07 22:30:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 22:30:27,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 22:30:28,108 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 22:30:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 22:30:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1572335675, now seen corresponding path program 4 times [2024-05-07 22:30:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 22:30:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 22:30:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 22:30:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 22:30:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 22:30:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600