/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 01:49:55,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 01:49:55,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 01:49:55,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 01:49:55,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 01:49:55,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 01:49:55,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 01:49:55,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 01:49:55,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 01:49:55,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 01:49:55,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 01:49:55,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 01:49:55,708 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 01:49:55,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 01:49:55,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 01:49:55,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 01:49:55,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 01:49:55,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 01:49:55,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 01:49:55,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 01:49:55,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 01:49:55,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 01:49:55,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 01:49:55,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 01:49:55,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 01:49:55,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 01:49:55,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 01:49:55,711 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 01:49:55,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 01:49:55,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 01:49:55,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 01:49:55,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 01:49:55,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 01:49:55,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 01:49:55,713 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 01:49:55,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 01:49:55,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 01:49:55,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 01:49:55,714 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 01:49:55,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 01:49:55,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 01:49:55,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 01:49:55,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 01:49:55,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 01:49:55,882 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 01:49:55,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-04-05 01:49:57,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 01:49:57,302 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 01:49:57,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-04-05 01:49:57,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39a942120/5ca4d27b91c04fb580ee7c06f4ff5140/FLAG50ae220d0 [2024-04-05 01:49:57,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/39a942120/5ca4d27b91c04fb580ee7c06f4ff5140 [2024-04-05 01:49:57,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 01:49:57,334 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 01:49:57,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 01:49:57,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 01:49:57,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 01:49:57,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4798f152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57, skipping insertion in model container [2024-04-05 01:49:57,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,413 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 01:49:57,634 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_36-indirect_racefree.i[30176,30189] [2024-04-05 01:49:57,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 01:49:57,665 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 01:49:57,698 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_36-indirect_racefree.i[30176,30189] [2024-04-05 01:49:57,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 01:49:57,742 INFO L206 MainTranslator]: Completed translation [2024-04-05 01:49:57,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57 WrapperNode [2024-04-05 01:49:57,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 01:49:57,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 01:49:57,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 01:49:57,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 01:49:57,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,797 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-04-05 01:49:57,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 01:49:57,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 01:49:57,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 01:49:57,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 01:49:57,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 01:49:57,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 01:49:57,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 01:49:57,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 01:49:57,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (1/1) ... [2024-04-05 01:49:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 01:49:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:49:57,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 01:49:57,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-04-05 01:49:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-04-05 01:49:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 01:49:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 01:49:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 01:49:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 01:49:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 01:49:57,945 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 01:49:58,078 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 01:49:58,079 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 01:49:58,239 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 01:49:58,263 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 01:49:58,263 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2024-04-05 01:49:58,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:49:58 BoogieIcfgContainer [2024-04-05 01:49:58,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 01:49:58,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 01:49:58,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 01:49:58,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 01:49:58,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 01:49:57" (1/3) ... [2024-04-05 01:49:58,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c4ddd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:49:58, skipping insertion in model container [2024-04-05 01:49:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:49:57" (2/3) ... [2024-04-05 01:49:58,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c4ddd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:49:58, skipping insertion in model container [2024-04-05 01:49:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:49:58" (3/3) ... [2024-04-05 01:49:58,271 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-04-05 01:49:58,284 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 01:49:58,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 01:49:58,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 01:49:58,294 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 01:49:58,336 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-04-05 01:49:58,376 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:49:58,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:49:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:49:58,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 01:49:58,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 01:49:58,443 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:49:58,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:58,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:49:58,471 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:49:58,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:49:58,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:58,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1518463175, now seen corresponding path program 1 times [2024-04-05 01:49:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351611200] [2024-04-05 01:49:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:49:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 01:49:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:49:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351611200] [2024-04-05 01:49:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351611200] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:49:58,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:49:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:49:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641176388] [2024-04-05 01:49:58,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:49:58,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:49:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:49:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:49:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:49:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:58,844 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:49:58,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:49:58,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 01:49:58,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:58,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1894939840, now seen corresponding path program 1 times [2024-04-05 01:49:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229583375] [2024-04-05 01:49:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:49:58,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 01:49:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:49:58,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 01:49:58,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 01:49:58,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 01:49:58,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 01:49:58,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 01:49:58,955 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-04-05 01:49:58,956 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 01:49:58,956 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 01:49:58,975 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 01:49:58,978 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:49:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:49:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:49:58,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 01:49:58,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 01:49:58,985 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:49:58,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:58,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:49:58,988 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:49:58,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:49:59,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:59,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1429262771, now seen corresponding path program 1 times [2024-04-05 01:49:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254003135] [2024-04-05 01:49:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:49:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 01:49:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:49:59,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254003135] [2024-04-05 01:49:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254003135] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:49:59,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:49:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:49:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960864865] [2024-04-05 01:49:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:49:59,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:49:59,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:49:59,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:49:59,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:49:59,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:49:59,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:49:59,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 01:49:59,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:59,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -300771448, now seen corresponding path program 1 times [2024-04-05 01:49:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430008902] [2024-04-05 01:49:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:49:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 01:49:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:49:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430008902] [2024-04-05 01:49:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430008902] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:49:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:49:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 01:49:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466545789] [2024-04-05 01:49:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:49:59,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 01:49:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:49:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 01:49:59,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 01:49:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:49:59,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:49:59,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:49:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 01:49:59,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:59,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash 255431698, now seen corresponding path program 1 times [2024-04-05 01:49:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280744828] [2024-04-05 01:49:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:49:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 01:49:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:49:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280744828] [2024-04-05 01:49:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280744828] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:49:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:49:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 01:49:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232456633] [2024-04-05 01:49:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:49:59,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 01:49:59,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:49:59,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 01:49:59,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 01:49:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:49:59,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:49:59,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:49:59,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:49:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:49:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 01:49:59,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 01:49:59,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:49:59,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2039730259, now seen corresponding path program 1 times [2024-04-05 01:49:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:49:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110349963] [2024-04-05 01:49:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:49:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:49:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:49:59,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 01:49:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:49:59,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 01:49:59,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 01:49:59,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 01:49:59,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 01:49:59,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 01:49:59,903 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 01:49:59,903 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 01:49:59,903 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 01:49:59,958 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 01:49:59,971 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:49:59,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:49:59,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:49:59,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 01:49:59,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-04-05 01:49:59,981 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:49:59,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:49:59,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:49:59,982 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:49:59,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:50:00,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:00,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 780485730, now seen corresponding path program 1 times [2024-04-05 01:50:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395582732] [2024-04-05 01:50:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-04-05 01:50:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395582732] [2024-04-05 01:50:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395582732] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:00,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:50:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721239277] [2024-04-05 01:50:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:00,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:50:00,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:00,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:50:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:50:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:00,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:00,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 01:50:00,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:00,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1708566035, now seen corresponding path program 1 times [2024-04-05 01:50:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914992890] [2024-04-05 01:50:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 01:50:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914992890] [2024-04-05 01:50:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914992890] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 01:50:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166899824] [2024-04-05 01:50:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:00,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 01:50:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:00,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 01:50:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 01:50:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:00,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-05 01:50:00,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:00,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1436656120, now seen corresponding path program 1 times [2024-04-05 01:50:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254153942] [2024-04-05 01:50:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 01:50:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254153942] [2024-04-05 01:50:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254153942] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 01:50:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950994359] [2024-04-05 01:50:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:00,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 01:50:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:00,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 01:50:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 01:50:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,579 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:00,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:00,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 01:50:00,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-04-05 01:50:00,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:00,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -434703058, now seen corresponding path program 1 times [2024-04-05 01:50:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227472149] [2024-04-05 01:50:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:00,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 01:50:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:00,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 01:50:00,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 01:50:00,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 01:50:00,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 01:50:00,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 01:50:00,747 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 01:50:00,748 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 01:50:00,748 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 01:50:00,779 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-05 01:50:00,783 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:50:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:50:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:50:00,785 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-04-05 01:50:00,790 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:50:00,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:50:00,791 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:50:00,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:50:00,806 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-04-05 01:50:00,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:00,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1334644056, now seen corresponding path program 1 times [2024-04-05 01:50:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449415858] [2024-04-05 01:50:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-04-05 01:50:00,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:00,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449415858] [2024-04-05 01:50:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449415858] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:50:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266963124] [2024-04-05 01:50:00,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:00,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:50:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:50:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:50:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:00,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:00,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:00,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,096 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-04-05 01:50:01,097 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-04-05 01:50:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2041216205, now seen corresponding path program 1 times [2024-04-05 01:50:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:01,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-04-05 01:50:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 01:50:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 01:50:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 01:50:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-04-05 01:50:01,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:01,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1160019582, now seen corresponding path program 1 times [2024-04-05 01:50:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733696036] [2024-04-05 01:50:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-04-05 01:50:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733696036] [2024-04-05 01:50:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733696036] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 01:50:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043215088] [2024-04-05 01:50:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:01,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 01:50:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:01,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 01:50:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 01:50:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:01,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:01,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 01:50:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-04-05 01:50:01,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:01,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1143511577, now seen corresponding path program 1 times [2024-04-05 01:50:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091830574] [2024-04-05 01:50:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:01,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 01:50:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:01,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 01:50:01,873 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 01:50:01,873 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 01:50:01,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 01:50:01,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-04-05 01:50:01,874 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 01:50:01,874 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 01:50:01,875 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 01:50:01,899 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-05 01:50:01,901 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:50:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:50:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:50:01,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 01:50:01,940 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:50:01,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:01,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:50:01,941 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:50:01,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:50:01,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 01:50:01,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1003495409, now seen corresponding path program 1 times [2024-04-05 01:50:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270365257] [2024-04-05 01:50:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-04-05 01:50:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270365257] [2024-04-05 01:50:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270365257] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:50:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523704078] [2024-04-05 01:50:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:02,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:50:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:50:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:50:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:02,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:02,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-04-05 01:50:02,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:02,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash 285345564, now seen corresponding path program 1 times [2024-04-05 01:50:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356157375] [2024-04-05 01:50:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-04-05 01:50:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356157375] [2024-04-05 01:50:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356157375] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 01:50:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856508284] [2024-04-05 01:50:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:02,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 01:50:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 01:50:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 01:50:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:02,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:02,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:02,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-04-05 01:50:02,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:02,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -352560978, now seen corresponding path program 1 times [2024-04-05 01:50:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900705439] [2024-04-05 01:50:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-04-05 01:50:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900705439] [2024-04-05 01:50:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900705439] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 01:50:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335406448] [2024-04-05 01:50:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 01:50:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 01:50:02,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 01:50:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:02,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 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-04-05 01:50:02,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:02,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 01:50:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 01:50:02,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-05 01:50:02,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:02,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1626527131, now seen corresponding path program 1 times [2024-04-05 01:50:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722204265] [2024-04-05 01:50:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:02,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 01:50:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 01:50:02,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 01:50:02,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 01:50:02,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 01:50:02,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 01:50:02,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-05 01:50:02,903 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 01:50:02,903 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 01:50:02,903 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-04-05 01:50:02,929 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-04-05 01:50:02,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 01:50:02,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 01:50:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 01:50:02,944 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-04-05 01:50:02,950 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 01:50:02,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:02,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 01:50:02,951 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;@526ecb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 01:50:02,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 01:50:02,960 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-04-05 01:50:02,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:02,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -62735385, now seen corresponding path program 1 times [2024-04-05 01:50:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893364492] [2024-04-05 01:50:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-04-05 01:50:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893364492] [2024-04-05 01:50:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893364492] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 01:50:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381892930] [2024-04-05 01:50:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 01:50:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 01:50:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 01:50:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:03,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:03,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-05 01:50:03,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 01:50:03,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 01:50:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -344143321, now seen corresponding path program 1 times [2024-04-05 01:50:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 01:50:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951284661] [2024-04-05 01:50:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-04-05 01:50:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 01:50:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951284661] [2024-04-05 01:50:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951284661] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 01:50:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 01:50:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 01:50:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966155935] [2024-04-05 01:50:03,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 01:50:03,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 01:50:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 01:50:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 01:50:03,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 01:50:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 01:50:03,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 01:50:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 01:50:03,536 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-04-05 01:50:03,537 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-04-05 01:50:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2048318237, now seen corresponding path program 1 times [2024-04-05 01:50:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 01:50:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 01:50:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 01:50:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 01:50:03,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-04-05 01:50:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 01:50:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-04-05 01:50:04,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2024-04-05 01:50:04,096 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@376b224f at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-05 01:50:04,101 INFO L158 Benchmark]: Toolchain (without parser) took 6766.90ms. Allocated memory was 205.5MB in the beginning and 424.7MB in the end (delta: 219.2MB). Free memory was 137.5MB in the beginning and 335.3MB in the end (delta: -197.9MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,101 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 01:50:04,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.33ms. Allocated memory is still 256.9MB. Free memory was 231.3MB in the beginning and 211.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 256.9MB. Free memory was 211.3MB in the beginning and 209.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,102 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 256.9MB. Free memory was 209.2MB in the beginning and 207.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,102 INFO L158 Benchmark]: RCFGBuilder took 433.39ms. Allocated memory is still 256.9MB. Free memory was 207.1MB in the beginning and 188.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,102 INFO L158 Benchmark]: TraceAbstraction took 5833.96ms. Allocated memory was 256.9MB in the beginning and 424.7MB in the end (delta: 167.8MB). Free memory was 187.7MB in the beginning and 335.3MB in the end (delta: -147.6MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2024-04-05 01:50:04,103 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.33ms. Allocated memory is still 256.9MB. Free memory was 231.3MB in the beginning and 211.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 256.9MB. Free memory was 211.3MB in the beginning and 209.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 256.9MB. Free memory was 209.2MB in the beginning and 207.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 433.39ms. Allocated memory is still 256.9MB. Free memory was 207.1MB in the beginning and 188.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5833.96ms. Allocated memory was 256.9MB in the beginning and 424.7MB in the end (delta: 167.8MB). Free memory was 187.7MB in the beginning and 335.3MB in the end (delta: -147.6MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 260, independent: 147, independent conditional: 100, independent unconditional: 47, dependent: 113, dependent conditional: 83, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 100, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 100, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 100, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 147, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 147, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 113 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1713, independent: 1218, independent conditional: 1026, independent unconditional: 192, dependent: 495, dependent conditional: 425, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 118, independent unconditional: 1100, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 220, independent conditional: 1, independent unconditional: 219, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 37, independent conditional: 3, independent unconditional: 34, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1226, independent: 998, independent conditional: 57, independent unconditional: 941, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 222, unknown conditional: 2, unknown unconditional: 220] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 220, Positive conditional cache size: 1, Positive unconditional cache size: 219, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 118, independent unconditional: 1100, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 220, independent conditional: 1, independent unconditional: 219, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 37, independent conditional: 3, independent unconditional: 34, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1226, independent: 998, independent conditional: 57, independent unconditional: 941, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 222, unknown conditional: 2, unknown unconditional: 220] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 220, Positive conditional cache size: 1, Positive unconditional cache size: 219, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60 ], Independence queries for same thread: 493 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4515, independent: 3485, independent conditional: 2937, independent unconditional: 548, dependent: 1030, dependent conditional: 897, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3502, independent: 3485, independent conditional: 2937, independent unconditional: 548, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3502, independent: 3485, independent conditional: 2937, independent unconditional: 548, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3502, independent: 3485, independent conditional: 2937, independent unconditional: 548, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 277, independent unconditional: 3208, dependent: 54, dependent conditional: 14, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 134, independent unconditional: 3351, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 134, independent unconditional: 3351, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 577, independent: 565, independent conditional: 7, independent unconditional: 558, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 577, independent: 553, independent conditional: 0, independent unconditional: 553, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 46, independent conditional: 8, independent unconditional: 38, dependent: 25, dependent conditional: 9, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3539, independent: 2920, independent conditional: 127, independent unconditional: 2793, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 577, unknown conditional: 11, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 577, Positive cache size: 565, Positive conditional cache size: 7, Positive unconditional cache size: 558, Negative cache size: 12, Negative conditional cache size: 4, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 149, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 277, independent unconditional: 3208, dependent: 54, dependent conditional: 14, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 134, independent unconditional: 3351, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3539, independent: 3485, independent conditional: 134, independent unconditional: 3351, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 577, independent: 565, independent conditional: 7, independent unconditional: 558, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 577, independent: 553, independent conditional: 0, independent unconditional: 553, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 46, independent conditional: 8, independent unconditional: 38, dependent: 25, dependent conditional: 9, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3539, independent: 2920, independent conditional: 127, independent unconditional: 2793, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 577, unknown conditional: 11, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 577, Positive cache size: 565, Positive conditional cache size: 7, Positive unconditional cache size: 558, Negative cache size: 12, Negative conditional cache size: 4, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 149 ], Independence queries for same thread: 1013 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6397, independent: 5004, independent conditional: 4236, independent unconditional: 768, dependent: 1393, dependent conditional: 1218, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5028, independent: 5004, independent conditional: 4236, independent unconditional: 768, dependent: 24, dependent conditional: 19, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5028, independent: 5004, independent conditional: 4236, independent unconditional: 768, dependent: 24, dependent conditional: 19, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5028, independent: 5004, independent conditional: 4236, independent unconditional: 768, dependent: 24, dependent conditional: 19, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 401, independent unconditional: 4603, dependent: 73, dependent conditional: 19, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 195, independent unconditional: 4809, dependent: 73, dependent conditional: 10, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 195, independent unconditional: 4809, dependent: 73, dependent conditional: 10, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 792, independent: 772, independent conditional: 10, independent unconditional: 762, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 792, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 50, independent conditional: 6, independent unconditional: 44, dependent: 32, dependent conditional: 7, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5077, independent: 4232, independent conditional: 185, independent unconditional: 4047, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 792, unknown conditional: 15, unknown unconditional: 777] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 772, Positive conditional cache size: 10, Positive unconditional cache size: 762, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 215, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 401, independent unconditional: 4603, dependent: 73, dependent conditional: 19, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 195, independent unconditional: 4809, dependent: 73, dependent conditional: 10, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5077, independent: 5004, independent conditional: 195, independent unconditional: 4809, dependent: 73, dependent conditional: 10, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 792, independent: 772, independent conditional: 10, independent unconditional: 762, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 792, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 50, independent conditional: 6, independent unconditional: 44, dependent: 32, dependent conditional: 7, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5077, independent: 4232, independent conditional: 185, independent unconditional: 4047, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 792, unknown conditional: 15, unknown unconditional: 777] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 772, Positive conditional cache size: 10, Positive unconditional cache size: 762, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 215 ], Independence queries for same thread: 1369 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10681, independent: 8550, independent conditional: 7195, independent unconditional: 1355, dependent: 2131, dependent conditional: 1866, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8595, independent: 8550, independent conditional: 7195, independent unconditional: 1355, dependent: 45, dependent conditional: 35, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8595, independent: 8550, independent conditional: 7195, independent unconditional: 1355, dependent: 45, dependent conditional: 35, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8595, independent: 8550, independent conditional: 7195, independent unconditional: 1355, dependent: 45, dependent conditional: 35, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 597, independent unconditional: 7953, dependent: 136, dependent conditional: 36, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 321, independent unconditional: 8229, dependent: 136, dependent conditional: 16, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 321, independent unconditional: 8229, dependent: 136, dependent conditional: 16, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, independent: 1083, independent conditional: 19, independent unconditional: 1064, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, independent: 1051, independent conditional: 0, independent unconditional: 1051, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 32, independent conditional: 7, independent unconditional: 25, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 32, independent conditional: 7, independent unconditional: 25, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 72, independent conditional: 9, independent unconditional: 63, dependent: 44, dependent conditional: 10, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8686, independent: 7467, independent conditional: 302, independent unconditional: 7165, dependent: 105, dependent conditional: 8, dependent unconditional: 97, unknown: 1114, unknown conditional: 27, unknown unconditional: 1087] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1083, Positive conditional cache size: 19, Positive unconditional cache size: 1064, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 296, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 597, independent unconditional: 7953, dependent: 136, dependent conditional: 36, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 321, independent unconditional: 8229, dependent: 136, dependent conditional: 16, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8686, independent: 8550, independent conditional: 321, independent unconditional: 8229, dependent: 136, dependent conditional: 16, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, independent: 1083, independent conditional: 19, independent unconditional: 1064, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, independent: 1051, independent conditional: 0, independent unconditional: 1051, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 32, independent conditional: 7, independent unconditional: 25, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 32, independent conditional: 7, independent unconditional: 25, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 72, independent conditional: 9, independent unconditional: 63, dependent: 44, dependent conditional: 10, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8686, independent: 7467, independent conditional: 302, independent unconditional: 7165, dependent: 105, dependent conditional: 8, dependent unconditional: 97, unknown: 1114, unknown conditional: 27, unknown unconditional: 1087] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1083, Positive conditional cache size: 19, Positive unconditional cache size: 1064, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 296 ], Independence queries for same thread: 2086 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@376b224f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@376b224f: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 01:50:04,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-04-05 01:50:04,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-04-05 01:50:04,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-04-05 01:50:04,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-04-05 01:50:04,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-04-05 01:50:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-05 01:50:05,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...