/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 14:18:42,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 14:18:42,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 14:18:42,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 14:18:42,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 14:18:42,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 14:18:42,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 14:18:42,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 14:18:42,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 14:18:42,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 14:18:42,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 14:18:42,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 14:18:42,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 14:18:42,350 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 14:18:42,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 14:18:42,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 14:18:42,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 14:18:42,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 14:18:42,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 14:18:42,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 14:18:42,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 14:18:42,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 14:18:42,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 14:18:42,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 14:18:42,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 14:18:42,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 14:18:42,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 14:18:42,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 14:18:42,361 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 14:18:42,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 14:18:42,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:18:42,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 14:18:42,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 14:18:42,363 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 14:18:42,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 14:18:42,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 14:18:42,364 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 14:18:42,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 14:18:42,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 14:18:42,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 14:18:42,364 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 14:18:42,365 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 14:18:42,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 14:18:42,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 14:18:42,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 14:18:42,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 14:18:42,670 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 14:18:42,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12.i [2024-05-30 14:18:43,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 14:18:44,183 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 14:18:44,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i [2024-05-30 14:18:44,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4e5c0ce5d/ffe6270737084140b446755710bf0eff/FLAG411f93dcc [2024-05-30 14:18:44,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4e5c0ce5d/ffe6270737084140b446755710bf0eff [2024-05-30 14:18:44,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 14:18:44,224 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 14:18:44,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 14:18:44,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 14:18:44,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 14:18:44,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69cf92e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44, skipping insertion in model container [2024-05-30 14:18:44,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 14:18:44,669 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2024-05-30 14:18:44,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:18:44,703 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 14:18:44,750 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2024-05-30 14:18:44,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:18:44,824 INFO L206 MainTranslator]: Completed translation [2024-05-30 14:18:44,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44 WrapperNode [2024-05-30 14:18:44,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 14:18:44,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 14:18:44,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 14:18:44,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 14:18:44,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,886 INFO L138 Inliner]: procedures = 275, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2024-05-30 14:18:44,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 14:18:44,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 14:18:44,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 14:18:44,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 14:18:44,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 14:18:44,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 14:18:44,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 14:18:44,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 14:18:44,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (1/1) ... [2024-05-30 14:18:44,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:18:44,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:44,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:45,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 14:18:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 14:18:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-05-30 14:18:45,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-05-30 14:18:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 14:18:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 14:18:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 14:18:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 14:18:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 14:18:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 14:18:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 14:18:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 14:18:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 14:18:45,040 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 14:18:45,142 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 14:18:45,144 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 14:18:45,256 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 14:18:45,288 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 14:18:45,289 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 14:18:45,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:18:45 BoogieIcfgContainer [2024-05-30 14:18:45,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 14:18:45,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 14:18:45,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 14:18:45,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 14:18:45,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 02:18:44" (1/3) ... [2024-05-30 14:18:45,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc243d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:18:45, skipping insertion in model container [2024-05-30 14:18:45,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:18:44" (2/3) ... [2024-05-30 14:18:45,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc243d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:18:45, skipping insertion in model container [2024-05-30 14:18:45,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:18:45" (3/3) ... [2024-05-30 14:18:45,297 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12.i [2024-05-30 14:18:45,304 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 14:18:45,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 14:18:45,311 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 14:18:45,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 14:18:45,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:45,418 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:45,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:45,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:45,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:45,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 14:18:45,470 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:45,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:45,484 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:45,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:45,491 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:45,514 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 49 states. [2024-05-30 14:18:45,515 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:45,518 INFO L78 Accepts]: Start accepts. Automaton has currently 51 states, but on-demand construction may add more states Word has length 41 [2024-05-30 14:18:45,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:45,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:45,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1902189736, now seen corresponding path program 1 times [2024-05-30 14:18:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726479790] [2024-05-30 14:18:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 14:18:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726479790] [2024-05-30 14:18:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726479790] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:45,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97124457] [2024-05-30 14:18:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:45,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:45,783 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:45,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:45,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:45,785 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:45,811 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 50 states. [2024-05-30 14:18:45,811 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:45,813 INFO L78 Accepts]: Start accepts. Automaton has currently 51 states, but on-demand construction may add more states Word has length 40 [2024-05-30 14:18:45,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 14:18:45,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:45,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -343547505, now seen corresponding path program 1 times [2024-05-30 14:18:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392713695] [2024-05-30 14:18:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:45,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:45,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:45,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:45,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:45,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 14:18:45,963 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:45,964 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/3) [2024-05-30 14:18:45,965 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:45,965 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-30 14:18:46,000 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:46,004 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:46,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:46,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:46,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 14:18:46,046 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:46,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:46,047 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:46,047 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,058 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 71 states. [2024-05-30 14:18:46,058 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,058 INFO L78 Accepts]: Start accepts. Automaton has currently 74 states, but on-demand construction may add more states Word has length 48 [2024-05-30 14:18:46,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 263802654, now seen corresponding path program 1 times [2024-05-30 14:18:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701813896] [2024-05-30 14:18:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-30 14:18:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701813896] [2024-05-30 14:18:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701813896] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:46,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182860257] [2024-05-30 14:18:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:46,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,158 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:46,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:46,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,158 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,190 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 72 states. [2024-05-30 14:18:46,191 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,191 INFO L78 Accepts]: Start accepts. Automaton has currently 73 states, but on-demand construction may add more states Word has length 47 [2024-05-30 14:18:46,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 14:18:46,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1160647912, now seen corresponding path program 1 times [2024-05-30 14:18:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133457535] [2024-05-30 14:18:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:46,240 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:46,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:46,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 14:18:46,242 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:46,242 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/4) [2024-05-30 14:18:46,243 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:46,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-05-30 14:18:46,267 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:46,271 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:46,274 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-05-30 14:18:46,281 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:46,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:46,283 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:46,283 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,288 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-05-30 14:18:46,300 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 100 states. [2024-05-30 14:18:46,300 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,300 INFO L78 Accepts]: Start accepts. Automaton has currently 104 states, but on-demand construction may add more states Word has length 55 [2024-05-30 14:18:46,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1891586134, now seen corresponding path program 1 times [2024-05-30 14:18:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884157609] [2024-05-30 14:18:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-30 14:18:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884157609] [2024-05-30 14:18:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884157609] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819357154] [2024-05-30 14:18:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:46,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:46,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:46,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,380 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,417 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 101 states. [2024-05-30 14:18:46,417 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,418 INFO L78 Accepts]: Start accepts. Automaton has currently 102 states, but on-demand construction may add more states Word has length 54 [2024-05-30 14:18:46,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 14:18:46,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1133964402, now seen corresponding path program 1 times [2024-05-30 14:18:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295110736] [2024-05-30 14:18:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:46,504 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:46,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:46,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 14:18:46,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:46,506 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/5) [2024-05-30 14:18:46,506 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:46,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-05-30 14:18:46,548 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:46,553 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:46,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:46,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-30 14:18:46,565 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:46,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:46,565 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:46,566 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,583 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-30 14:18:46,584 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,584 INFO L78 Accepts]: Start accepts. Automaton has currently 141 states, but on-demand construction may add more states Word has length 62 [2024-05-30 14:18:46,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 139455069, now seen corresponding path program 1 times [2024-05-30 14:18:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211864635] [2024-05-30 14:18:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-05-30 14:18:46,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211864635] [2024-05-30 14:18:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211864635] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157582745] [2024-05-30 14:18:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:46,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:46,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,653 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,691 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 137 states. [2024-05-30 14:18:46,691 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,692 INFO L78 Accepts]: Start accepts. Automaton has currently 138 states, but on-demand construction may add more states Word has length 61 [2024-05-30 14:18:46,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 14:18:46,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 795218380, now seen corresponding path program 1 times [2024-05-30 14:18:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220141556] [2024-05-30 14:18:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:46,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:46,772 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:46,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-30 14:18:46,774 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:46,774 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/6) [2024-05-30 14:18:46,774 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:46,774 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-05-30 14:18:46,826 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:46,836 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:46,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:46,847 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:46,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:46,848 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:46,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:46,848 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-05-30 14:18:46,871 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 179 states. [2024-05-30 14:18:46,871 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,871 INFO L78 Accepts]: Start accepts. Automaton has currently 185 states, but on-demand construction may add more states Word has length 69 [2024-05-30 14:18:46,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1005448976, now seen corresponding path program 1 times [2024-05-30 14:18:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695538799] [2024-05-30 14:18:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-05-30 14:18:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695538799] [2024-05-30 14:18:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695538799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990881010] [2024-05-30 14:18:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,928 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:46,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:46,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,928 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:46,951 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 180 states. [2024-05-30 14:18:46,952 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:46,952 INFO L78 Accepts]: Start accepts. Automaton has currently 181 states, but on-demand construction may add more states Word has length 68 [2024-05-30 14:18:46,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:46,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-30 14:18:46,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:46,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 422160333, now seen corresponding path program 1 times [2024-05-30 14:18:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:46,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277102257] [2024-05-30 14:18:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:46,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:46,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:47,020 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:47,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:47,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-30 14:18:47,024 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:47,025 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/7) [2024-05-30 14:18:47,025 WARN L234 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:47,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-05-30 14:18:47,067 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:47,071 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:47,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:47,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:47,082 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:47,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:47,083 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:47,084 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-30 14:18:47,112 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 229 states. [2024-05-30 14:18:47,112 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,112 INFO L78 Accepts]: Start accepts. Automaton has currently 236 states, but on-demand construction may add more states Word has length 76 [2024-05-30 14:18:47,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -181899940, now seen corresponding path program 1 times [2024-05-30 14:18:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627026460] [2024-05-30 14:18:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-05-30 14:18:47,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627026460] [2024-05-30 14:18:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627026460] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:47,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:47,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992543872] [2024-05-30 14:18:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:47,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:47,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:47,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,173 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,197 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 230 states. [2024-05-30 14:18:47,197 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,198 INFO L78 Accepts]: Start accepts. Automaton has currently 231 states, but on-demand construction may add more states Word has length 75 [2024-05-30 14:18:47,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 14:18:47,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1706125300, now seen corresponding path program 1 times [2024-05-30 14:18:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890120852] [2024-05-30 14:18:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:47,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:47,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-30 14:18:47,270 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:47,272 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/8) [2024-05-30 14:18:47,272 WARN L234 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:47,276 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-05-30 14:18:47,327 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:47,330 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:47,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:47,341 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:47,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:47,342 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:47,342 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-05-30 14:18:47,361 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 286 states. [2024-05-30 14:18:47,364 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,365 INFO L78 Accepts]: Start accepts. Automaton has currently 294 states, but on-demand construction may add more states Word has length 83 [2024-05-30 14:18:47,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -636379654, now seen corresponding path program 1 times [2024-05-30 14:18:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230631199] [2024-05-30 14:18:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-05-30 14:18:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230631199] [2024-05-30 14:18:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230631199] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:47,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489341421] [2024-05-30 14:18:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:47,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:47,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:47,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,415 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,442 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 287 states. [2024-05-30 14:18:47,442 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,443 INFO L78 Accepts]: Start accepts. Automaton has currently 288 states, but on-demand construction may add more states Word has length 82 [2024-05-30 14:18:47,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-30 14:18:47,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash -208695092, now seen corresponding path program 1 times [2024-05-30 14:18:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819044525] [2024-05-30 14:18:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:47,507 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:47,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:47,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-30 14:18:47,509 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:47,509 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/9) [2024-05-30 14:18:47,509 WARN L234 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:47,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-05-30 14:18:47,552 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:47,558 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:47,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:47,561 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:47,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-05-30 14:18:47,565 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:47,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:47,566 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:47,566 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,586 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 350 states. [2024-05-30 14:18:47,586 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,587 INFO L78 Accepts]: Start accepts. Automaton has currently 359 states, but on-demand construction may add more states Word has length 90 [2024-05-30 14:18:47,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1358437019, now seen corresponding path program 1 times [2024-05-30 14:18:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118461861] [2024-05-30 14:18:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-05-30 14:18:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118461861] [2024-05-30 14:18:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118461861] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:47,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533435503] [2024-05-30 14:18:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:47,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,632 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:47,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:47,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,632 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,660 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 351 states. [2024-05-30 14:18:47,660 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,661 INFO L78 Accepts]: Start accepts. Automaton has currently 352 states, but on-demand construction may add more states Word has length 89 [2024-05-30 14:18:47,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-30 14:18:47,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash 509773024, now seen corresponding path program 1 times [2024-05-30 14:18:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361458916] [2024-05-30 14:18:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:47,709 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:47,710 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-30 14:18:47,711 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:47,712 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/10) [2024-05-30 14:18:47,712 WARN L234 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:47,712 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-05-30 14:18:47,753 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:47,757 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:47,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:47,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-05-30 14:18:47,765 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:47,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:47,769 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:47,769 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,795 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 421 states. [2024-05-30 14:18:47,795 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,796 INFO L78 Accepts]: Start accepts. Automaton has currently 431 states, but on-demand construction may add more states Word has length 97 [2024-05-30 14:18:47,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1399616584, now seen corresponding path program 1 times [2024-05-30 14:18:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500426842] [2024-05-30 14:18:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-30 14:18:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500426842] [2024-05-30 14:18:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500426842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700443313] [2024-05-30 14:18:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:47,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:47,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:47,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:47,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,835 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:47,875 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 422 states. [2024-05-30 14:18:47,875 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:47,876 INFO L78 Accepts]: Start accepts. Automaton has currently 423 states, but on-demand construction may add more states Word has length 96 [2024-05-30 14:18:47,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:47,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-30 14:18:47,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:47,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1730543349, now seen corresponding path program 1 times [2024-05-30 14:18:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054793311] [2024-05-30 14:18:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:47,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:47,930 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:47,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:47,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-30 14:18:47,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:47,932 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/11) [2024-05-30 14:18:47,932 WARN L234 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:47,933 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-05-30 14:18:47,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:47,985 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:47,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:47,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:47,994 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:47,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:47,994 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:47,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:47,994 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-05-30 14:18:48,017 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 499 states. [2024-05-30 14:18:48,017 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,018 INFO L78 Accepts]: Start accepts. Automaton has currently 510 states, but on-demand construction may add more states Word has length 104 [2024-05-30 14:18:48,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 387675290, now seen corresponding path program 1 times [2024-05-30 14:18:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092664495] [2024-05-30 14:18:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-05-30 14:18:48,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:48,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092664495] [2024-05-30 14:18:48,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092664495] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:48,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:48,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205865424] [2024-05-30 14:18:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:48,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:48,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,115 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,146 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 500 states. [2024-05-30 14:18:48,147 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,147 INFO L78 Accepts]: Start accepts. Automaton has currently 501 states, but on-demand construction may add more states Word has length 103 [2024-05-30 14:18:48,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-30 14:18:48,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1732471280, now seen corresponding path program 1 times [2024-05-30 14:18:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394105767] [2024-05-30 14:18:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:48,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:48,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:48,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-30 14:18:48,204 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:48,204 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/12) [2024-05-30 14:18:48,204 WARN L234 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:48,204 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-05-30 14:18:48,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:48,264 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:48,270 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:48,278 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:48,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:48,279 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:48,279 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-05-30 14:18:48,313 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 584 states. [2024-05-30 14:18:48,313 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,314 INFO L78 Accepts]: Start accepts. Automaton has currently 596 states, but on-demand construction may add more states Word has length 111 [2024-05-30 14:18:48,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1754296666, now seen corresponding path program 1 times [2024-05-30 14:18:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379956198] [2024-05-30 14:18:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2024-05-30 14:18:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379956198] [2024-05-30 14:18:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379956198] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444407350] [2024-05-30 14:18:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:48,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:48,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:48,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,380 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,413 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 585 states. [2024-05-30 14:18:48,413 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,414 INFO L78 Accepts]: Start accepts. Automaton has currently 586 states, but on-demand construction may add more states Word has length 110 [2024-05-30 14:18:48,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-30 14:18:48,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1989186806, now seen corresponding path program 1 times [2024-05-30 14:18:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398640000] [2024-05-30 14:18:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:48,483 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:48,483 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:48,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-30 14:18:48,484 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:48,484 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/13) [2024-05-30 14:18:48,484 WARN L234 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:48,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-05-30 14:18:48,536 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:48,540 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:48,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:48,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:48,557 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:48,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:48,558 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:48,558 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-05-30 14:18:48,595 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 676 states. [2024-05-30 14:18:48,595 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,595 INFO L78 Accepts]: Start accepts. Automaton has currently 689 states, but on-demand construction may add more states Word has length 118 [2024-05-30 14:18:48,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 373702105, now seen corresponding path program 1 times [2024-05-30 14:18:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961057289] [2024-05-30 14:18:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-05-30 14:18:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961057289] [2024-05-30 14:18:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961057289] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534983669] [2024-05-30 14:18:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:48,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:48,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:48,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,631 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,659 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 677 states. [2024-05-30 14:18:48,659 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,660 INFO L78 Accepts]: Start accepts. Automaton has currently 678 states, but on-demand construction may add more states Word has length 117 [2024-05-30 14:18:48,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-30 14:18:48,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -733771516, now seen corresponding path program 1 times [2024-05-30 14:18:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091299112] [2024-05-30 14:18:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:48,715 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:48,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-30 14:18:48,716 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:48,716 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/14) [2024-05-30 14:18:48,716 WARN L234 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:48,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-05-30 14:18:48,769 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:48,774 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:48,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:48,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:48,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-05-30 14:18:48,783 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:48,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:48,783 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:48,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:48,784 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,827 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 775 states. [2024-05-30 14:18:48,827 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,827 INFO L78 Accepts]: Start accepts. Automaton has currently 789 states, but on-demand construction may add more states Word has length 125 [2024-05-30 14:18:48,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 75248304, now seen corresponding path program 1 times [2024-05-30 14:18:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376616167] [2024-05-30 14:18:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-05-30 14:18:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376616167] [2024-05-30 14:18:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376616167] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:48,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838123764] [2024-05-30 14:18:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:48,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:48,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:48,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,866 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:48,900 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 776 states. [2024-05-30 14:18:48,901 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:48,901 INFO L78 Accepts]: Start accepts. Automaton has currently 777 states, but on-demand construction may add more states Word has length 124 [2024-05-30 14:18:48,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:48,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-30 14:18:48,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:48,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1836220087, now seen corresponding path program 1 times [2024-05-30 14:18:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809294343] [2024-05-30 14:18:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:48,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:49,002 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:49,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:49,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-30 14:18:49,004 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:49,004 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/15) [2024-05-30 14:18:49,004 WARN L234 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:49,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-05-30 14:18:49,075 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:49,081 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:49,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:49,088 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:49,095 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:49,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:49,095 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:49,095 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-05-30 14:18:49,149 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 881 states. [2024-05-30 14:18:49,150 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,150 INFO L78 Accepts]: Start accepts. Automaton has currently 896 states, but on-demand construction may add more states Word has length 132 [2024-05-30 14:18:49,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 87259352, now seen corresponding path program 1 times [2024-05-30 14:18:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413671759] [2024-05-30 14:18:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-05-30 14:18:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413671759] [2024-05-30 14:18:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413671759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945283363] [2024-05-30 14:18:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:49,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:49,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,192 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,224 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 882 states. [2024-05-30 14:18:49,224 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,224 INFO L78 Accepts]: Start accepts. Automaton has currently 883 states, but on-demand construction may add more states Word has length 131 [2024-05-30 14:18:49,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-30 14:18:49,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1175194428, now seen corresponding path program 1 times [2024-05-30 14:18:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913538975] [2024-05-30 14:18:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:49,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:49,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:49,293 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:49,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:49,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-30 14:18:49,295 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:49,295 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/16) [2024-05-30 14:18:49,295 WARN L234 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:49,295 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-05-30 14:18:49,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:49,378 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:49,384 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:49,391 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:49,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:49,392 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:49,392 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-05-30 14:18:49,460 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 994 states. [2024-05-30 14:18:49,461 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,461 INFO L78 Accepts]: Start accepts. Automaton has currently 1010 states, but on-demand construction may add more states Word has length 139 [2024-05-30 14:18:49,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1057953226, now seen corresponding path program 1 times [2024-05-30 14:18:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934176453] [2024-05-30 14:18:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-05-30 14:18:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934176453] [2024-05-30 14:18:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934176453] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463036186] [2024-05-30 14:18:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:49,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:49,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,509 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,541 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 995 states. [2024-05-30 14:18:49,541 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,542 INFO L78 Accepts]: Start accepts. Automaton has currently 996 states, but on-demand construction may add more states Word has length 138 [2024-05-30 14:18:49,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-30 14:18:49,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1443285432, now seen corresponding path program 1 times [2024-05-30 14:18:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192751207] [2024-05-30 14:18:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:49,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:49,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:49,619 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:49,619 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-30 14:18:49,621 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:49,621 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/17) [2024-05-30 14:18:49,621 WARN L234 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:49,621 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-05-30 14:18:49,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:49,691 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:49,696 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:49,706 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:49,706 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:49,707 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:49,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:49,707 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-05-30 14:18:49,796 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1114 states. [2024-05-30 14:18:49,796 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,797 INFO L78 Accepts]: Start accepts. Automaton has currently 1131 states, but on-demand construction may add more states Word has length 146 [2024-05-30 14:18:49,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -648714217, now seen corresponding path program 1 times [2024-05-30 14:18:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172145256] [2024-05-30 14:18:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2024-05-30 14:18:49,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:49,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172145256] [2024-05-30 14:18:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172145256] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306398132] [2024-05-30 14:18:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:49,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:49,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,903 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:49,938 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1115 states. [2024-05-30 14:18:49,938 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:49,938 INFO L78 Accepts]: Start accepts. Automaton has currently 1116 states, but on-demand construction may add more states Word has length 145 [2024-05-30 14:18:49,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:49,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-30 14:18:49,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:49,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 202082872, now seen corresponding path program 1 times [2024-05-30 14:18:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390279888] [2024-05-30 14:18:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:49,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:49,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:50,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:50,008 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:50,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:50,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-30 14:18:50,011 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:50,013 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/18) [2024-05-30 14:18:50,013 WARN L234 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:50,013 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-05-30 14:18:50,085 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:50,090 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:50,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:50,114 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:50,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:50,115 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:50,115 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-05-30 14:18:50,208 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1241 states. [2024-05-30 14:18:50,209 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:50,209 INFO L78 Accepts]: Start accepts. Automaton has currently 1259 states, but on-demand construction may add more states Word has length 153 [2024-05-30 14:18:50,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:50,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:50,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -715573208, now seen corresponding path program 1 times [2024-05-30 14:18:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474445002] [2024-05-30 14:18:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2024-05-30 14:18:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474445002] [2024-05-30 14:18:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474445002] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955528430] [2024-05-30 14:18:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:50,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:50,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,252 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:50,293 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1242 states. [2024-05-30 14:18:50,293 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,293 INFO L78 Accepts]: Start accepts. Automaton has currently 1243 states, but on-demand construction may add more states Word has length 152 [2024-05-30 14:18:50,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:50,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-30 14:18:50,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:50,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 196000903, now seen corresponding path program 1 times [2024-05-30 14:18:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943658176] [2024-05-30 14:18:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:50,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:50,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:50,388 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:50,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:50,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-30 14:18:50,389 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:50,389 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/19) [2024-05-30 14:18:50,390 WARN L234 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:50,390 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-05-30 14:18:50,461 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:50,468 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:50,471 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:50,475 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:50,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:50,476 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:50,476 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:50,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-05-30 14:18:50,555 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1375 states. [2024-05-30 14:18:50,556 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:50,556 INFO L78 Accepts]: Start accepts. Automaton has currently 1394 states, but on-demand construction may add more states Word has length 160 [2024-05-30 14:18:50,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:50,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:50,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash -544895466, now seen corresponding path program 1 times [2024-05-30 14:18:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938071691] [2024-05-30 14:18:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2024-05-30 14:18:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938071691] [2024-05-30 14:18:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938071691] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:50,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:50,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320448700] [2024-05-30 14:18:50,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:50,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:50,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:50,650 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-05-30 14:18:50,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,650 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:50,687 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1376 states. [2024-05-30 14:18:50,688 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:50,688 INFO L78 Accepts]: Start accepts. Automaton has currently 1377 states, but on-demand construction may add more states Word has length 159 [2024-05-30 14:18:50,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:50,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-30 14:18:50,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:50,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 510145400, now seen corresponding path program 1 times [2024-05-30 14:18:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146624605] [2024-05-30 14:18:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:50,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:50,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:50,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:50,760 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:50,760 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:50,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-30 14:18:50,761 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:50,762 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/20) [2024-05-30 14:18:50,762 WARN L234 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:50,762 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-05-30 14:18:50,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:50,842 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:50,848 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:50,860 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:50,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:50,861 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:50,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:50,861 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:50,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-05-30 14:18:50,996 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1516 states. [2024-05-30 14:18:50,997 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:50,997 INFO L78 Accepts]: Start accepts. Automaton has currently 1536 states, but on-demand construction may add more states Word has length 167 [2024-05-30 14:18:50,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:50,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:50,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 535525194, now seen corresponding path program 1 times [2024-05-30 14:18:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131896558] [2024-05-30 14:18:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2024-05-30 14:18:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131896558] [2024-05-30 14:18:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131896558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:51,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207460301] [2024-05-30 14:18:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:51,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,043 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:51,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,043 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:51,081 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1517 states. [2024-05-30 14:18:51,081 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,081 INFO L78 Accepts]: Start accepts. Automaton has currently 1518 states, but on-demand construction may add more states Word has length 166 [2024-05-30 14:18:51,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:51,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-30 14:18:51,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:51,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash 428967558, now seen corresponding path program 1 times [2024-05-30 14:18:51,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:51,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890317225] [2024-05-30 14:18:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:51,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:51,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:51,180 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:51,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:51,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-30 14:18:51,181 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:51,181 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/21) [2024-05-30 14:18:51,181 WARN L234 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:51,181 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-05-30 14:18:51,267 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:51,274 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:51,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:51,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:51,278 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:51,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-05-30 14:18:51,284 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:51,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:51,284 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:51,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:51,284 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:51,492 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1664 states. [2024-05-30 14:18:51,492 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:51,492 INFO L78 Accepts]: Start accepts. Automaton has currently 1685 states, but on-demand construction may add more states Word has length 174 [2024-05-30 14:18:51,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:51,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:51,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 380939605, now seen corresponding path program 1 times [2024-05-30 14:18:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765339547] [2024-05-30 14:18:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2024-05-30 14:18:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765339547] [2024-05-30 14:18:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765339547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877808897] [2024-05-30 14:18:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:51,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:51,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,542 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:51,583 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1665 states. [2024-05-30 14:18:51,583 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:51,584 INFO L78 Accepts]: Start accepts. Automaton has currently 1666 states, but on-demand construction may add more states Word has length 173 [2024-05-30 14:18:51,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:51,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-30 14:18:51,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:51,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash -20384644, now seen corresponding path program 1 times [2024-05-30 14:18:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324201289] [2024-05-30 14:18:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:51,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:51,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:51,669 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:51,669 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:51,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-30 14:18:51,670 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:51,670 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/22) [2024-05-30 14:18:51,670 WARN L234 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:51,671 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-05-30 14:18:51,757 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:51,764 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:51,770 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:51,778 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:51,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:51,779 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:51,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:51,779 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:51,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-05-30 14:18:51,992 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1819 states. [2024-05-30 14:18:51,992 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:51,993 INFO L78 Accepts]: Start accepts. Automaton has currently 1841 states, but on-demand construction may add more states Word has length 181 [2024-05-30 14:18:51,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:51,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:51,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 120025264, now seen corresponding path program 1 times [2024-05-30 14:18:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778701950] [2024-05-30 14:18:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2024-05-30 14:18:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778701950] [2024-05-30 14:18:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778701950] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848966688] [2024-05-30 14:18:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:52,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:52,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,050 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:52,092 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1820 states. [2024-05-30 14:18:52,092 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,093 INFO L78 Accepts]: Start accepts. Automaton has currently 1821 states, but on-demand construction may add more states Word has length 180 [2024-05-30 14:18:52,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:52,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-30 14:18:52,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:52,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2099005125, now seen corresponding path program 1 times [2024-05-30 14:18:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:52,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718289848] [2024-05-30 14:18:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:52,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:52,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:52,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:52,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-30 14:18:52,204 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:52,204 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/23) [2024-05-30 14:18:52,204 WARN L234 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:52,204 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-05-30 14:18:52,292 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:52,299 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:52,302 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:52,306 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:52,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:52,306 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:52,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:52,307 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:52,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-05-30 14:18:52,525 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1981 states. [2024-05-30 14:18:52,525 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:52,526 INFO L78 Accepts]: Start accepts. Automaton has currently 2004 states, but on-demand construction may add more states Word has length 188 [2024-05-30 14:18:52,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:52,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:52,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1285212244, now seen corresponding path program 1 times [2024-05-30 14:18:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038118963] [2024-05-30 14:18:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1727 trivial. 0 not checked. [2024-05-30 14:18:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038118963] [2024-05-30 14:18:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038118963] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:52,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059750530] [2024-05-30 14:18:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:52,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:52,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,575 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:52,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:52,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,575 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:52,622 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1982 states. [2024-05-30 14:18:52,622 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:52,623 INFO L78 Accepts]: Start accepts. Automaton has currently 1983 states, but on-demand construction may add more states Word has length 187 [2024-05-30 14:18:52,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:52,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-30 14:18:52,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:52,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1705343684, now seen corresponding path program 1 times [2024-05-30 14:18:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346998461] [2024-05-30 14:18:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:52,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:52,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:52,748 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:52,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:52,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-30 14:18:52,753 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:52,754 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/24) [2024-05-30 14:18:52,754 WARN L234 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:52,754 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-05-30 14:18:52,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:52,844 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:52,848 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:52,860 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:52,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:52,860 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:52,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:52,861 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:52,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-05-30 14:18:53,126 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2150 states. [2024-05-30 14:18:53,126 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:53,126 INFO L78 Accepts]: Start accepts. Automaton has currently 2174 states, but on-demand construction may add more states Word has length 195 [2024-05-30 14:18:53,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:53,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:53,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1972339162, now seen corresponding path program 1 times [2024-05-30 14:18:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712138585] [2024-05-30 14:18:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1886 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2024-05-30 14:18:53,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:53,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712138585] [2024-05-30 14:18:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712138585] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:53,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275302958] [2024-05-30 14:18:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,177 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:53,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:53,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,177 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:53,221 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2151 states. [2024-05-30 14:18:53,221 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,221 INFO L78 Accepts]: Start accepts. Automaton has currently 2152 states, but on-demand construction may add more states Word has length 194 [2024-05-30 14:18:53,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:53,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-30 14:18:53,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:53,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash 185659332, now seen corresponding path program 1 times [2024-05-30 14:18:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034236498] [2024-05-30 14:18:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:53,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:53,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:53,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:53,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:53,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-30 14:18:53,307 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:53,308 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/25) [2024-05-30 14:18:53,308 WARN L234 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:53,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-05-30 14:18:53,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:53,397 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:53,401 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:53,408 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:53,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:53,409 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:53,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:53,409 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:53,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-05-30 14:18:53,613 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2326 states. [2024-05-30 14:18:53,613 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:53,613 INFO L78 Accepts]: Start accepts. Automaton has currently 2351 states, but on-demand construction may add more states Word has length 202 [2024-05-30 14:18:53,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:53,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:53,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2087133587, now seen corresponding path program 1 times [2024-05-30 14:18:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707821049] [2024-05-30 14:18:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-05-30 14:18:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707821049] [2024-05-30 14:18:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707821049] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814263511] [2024-05-30 14:18:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:53,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:53,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,665 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:53,711 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2327 states. [2024-05-30 14:18:53,711 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:53,712 INFO L78 Accepts]: Start accepts. Automaton has currently 2328 states, but on-demand construction may add more states Word has length 201 [2024-05-30 14:18:53,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:53,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-30 14:18:53,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:53,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1838560208, now seen corresponding path program 1 times [2024-05-30 14:18:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302962006] [2024-05-30 14:18:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:53,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:53,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:53,872 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:53,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:53,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-30 14:18:53,873 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:53,873 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/26) [2024-05-30 14:18:53,873 WARN L234 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:53,873 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-05-30 14:18:53,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:53,961 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:53,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:53,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:53,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-05-30 14:18:53,972 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:53,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:53,972 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:53,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:53,972 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:54,280 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2509 states. [2024-05-30 14:18:54,280 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:54,281 INFO L78 Accepts]: Start accepts. Automaton has currently 2535 states, but on-demand construction may add more states Word has length 209 [2024-05-30 14:18:54,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:54,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:54,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash -938031032, now seen corresponding path program 1 times [2024-05-30 14:18:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:54,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456953294] [2024-05-30 14:18:54,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2225 trivial. 0 not checked. [2024-05-30 14:18:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456953294] [2024-05-30 14:18:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456953294] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80254296] [2024-05-30 14:18:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:54,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:54,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:54,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:54,331 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:54,377 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2510 states. [2024-05-30 14:18:54,377 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:54,377 INFO L78 Accepts]: Start accepts. Automaton has currently 2511 states, but on-demand construction may add more states Word has length 208 [2024-05-30 14:18:54,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:54,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-30 14:18:54,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:54,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -383208445, now seen corresponding path program 1 times [2024-05-30 14:18:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10344743] [2024-05-30 14:18:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:54,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:54,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:54,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:54,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:54,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-30 14:18:54,483 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:54,484 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/27) [2024-05-30 14:18:54,484 WARN L234 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:54,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-05-30 14:18:54,569 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:54,575 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:54,582 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:54,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2024-05-30 14:18:54,586 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:54,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:54,587 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:54,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:54,587 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:55,029 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2699 states. [2024-05-30 14:18:55,029 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:55,030 INFO L78 Accepts]: Start accepts. Automaton has currently 2726 states, but on-demand construction may add more states Word has length 216 [2024-05-30 14:18:55,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:55,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:55,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -277857390, now seen corresponding path program 1 times [2024-05-30 14:18:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51020759] [2024-05-30 14:18:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2405 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2024-05-30 14:18:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51020759] [2024-05-30 14:18:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51020759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:55,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:55,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:55,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064374932] [2024-05-30 14:18:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:55,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:55,090 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:55,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:55,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:55,090 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:55,138 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2700 states. [2024-05-30 14:18:55,138 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:55,139 INFO L78 Accepts]: Start accepts. Automaton has currently 2701 states, but on-demand construction may add more states Word has length 215 [2024-05-30 14:18:55,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-30 14:18:55,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:55,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1130083040, now seen corresponding path program 1 times [2024-05-30 14:18:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456260705] [2024-05-30 14:18:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:55,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:55,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:55,241 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:55,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-30 14:18:55,243 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:55,243 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/28) [2024-05-30 14:18:55,243 WARN L234 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:55,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-05-30 14:18:55,335 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:55,342 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:55,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:55,345 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:55,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2024-05-30 14:18:55,353 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:55,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:55,357 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:55,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:55,357 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:55,964 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2896 states. [2024-05-30 14:18:55,964 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:55,964 INFO L78 Accepts]: Start accepts. Automaton has currently 2924 states, but on-demand construction may add more states Word has length 223 [2024-05-30 14:18:55,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:55,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:55,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1133436550, now seen corresponding path program 1 times [2024-05-30 14:18:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118051125] [2024-05-30 14:18:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2024-05-30 14:18:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118051125] [2024-05-30 14:18:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118051125] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150967612] [2024-05-30 14:18:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:56,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:56,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:56,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:56,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:56,021 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:56,070 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2897 states. [2024-05-30 14:18:56,071 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:56,071 INFO L78 Accepts]: Start accepts. Automaton has currently 2898 states, but on-demand construction may add more states Word has length 222 [2024-05-30 14:18:56,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:56,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-30 14:18:56,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:56,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1975780866, now seen corresponding path program 1 times [2024-05-30 14:18:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363686047] [2024-05-30 14:18:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:56,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:56,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:56,181 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:56,181 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:56,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-30 14:18:56,182 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:56,182 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/29) [2024-05-30 14:18:56,182 WARN L234 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:56,182 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-05-30 14:18:56,360 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:56,368 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:56,374 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:56,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process [2024-05-30 14:18:56,383 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:56,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:56,384 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:56,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:56,385 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:56,955 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3100 states. [2024-05-30 14:18:56,955 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:56,955 INFO L78 Accepts]: Start accepts. Automaton has currently 3129 states, but on-demand construction may add more states Word has length 230 [2024-05-30 14:18:56,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:56,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:56,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1612457775, now seen corresponding path program 1 times [2024-05-30 14:18:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208645898] [2024-05-30 14:18:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2786 trivial. 0 not checked. [2024-05-30 14:18:57,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208645898] [2024-05-30 14:18:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208645898] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654351519] [2024-05-30 14:18:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:57,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:57,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:57,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:57,023 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:57,074 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3101 states. [2024-05-30 14:18:57,074 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:57,075 INFO L78 Accepts]: Start accepts. Automaton has currently 3102 states, but on-demand construction may add more states Word has length 229 [2024-05-30 14:18:57,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-30 14:18:57,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:57,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 731493428, now seen corresponding path program 1 times [2024-05-30 14:18:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947499276] [2024-05-30 14:18:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:57,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:57,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:57,199 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:57,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:57,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-30 14:18:57,200 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:57,201 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/30) [2024-05-30 14:18:57,201 WARN L234 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:57,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-05-30 14:18:57,314 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:57,322 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:57,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:57,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:57,328 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:57,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2024-05-30 14:18:57,333 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:57,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:57,334 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:57,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:57,334 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:58,007 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3311 states. [2024-05-30 14:18:58,007 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:58,007 INFO L78 Accepts]: Start accepts. Automaton has currently 3341 states, but on-demand construction may add more states Word has length 237 [2024-05-30 14:18:58,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:58,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:58,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1566780144, now seen corresponding path program 1 times [2024-05-30 14:18:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812468279] [2024-05-30 14:18:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2987 trivial. 0 not checked. [2024-05-30 14:18:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812468279] [2024-05-30 14:18:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812468279] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113284427] [2024-05-30 14:18:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:58,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:58,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:58,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:58,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:58,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:58,067 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:58,116 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3312 states. [2024-05-30 14:18:58,117 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:58,117 INFO L78 Accepts]: Start accepts. Automaton has currently 3313 states, but on-demand construction may add more states Word has length 236 [2024-05-30 14:18:58,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:58,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-30 14:18:58,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:58,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1905956929, now seen corresponding path program 1 times [2024-05-30 14:18:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665747569] [2024-05-30 14:18:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:58,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:58,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:58,354 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:58,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:58,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-30 14:18:58,356 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:58,357 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/31) [2024-05-30 14:18:58,357 WARN L234 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:58,357 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-05-30 14:18:58,448 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:58,456 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:58,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:58,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:58,460 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:58,467 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:58,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:58,468 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:58,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:58,468 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:58,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (31)] Waiting until timeout for monitored process [2024-05-30 14:18:59,020 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3529 states. [2024-05-30 14:18:59,021 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:59,021 INFO L78 Accepts]: Start accepts. Automaton has currently 3560 states, but on-demand construction may add more states Word has length 244 [2024-05-30 14:18:59,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:59,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1568078800, now seen corresponding path program 1 times [2024-05-30 14:18:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019103694] [2024-05-30 14:18:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2024-05-30 14:18:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019103694] [2024-05-30 14:18:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019103694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:59,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703898959] [2024-05-30 14:18:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:59,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:59,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:59,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:59,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:59,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:59,083 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:59,134 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3530 states. [2024-05-30 14:18:59,134 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:59,134 INFO L78 Accepts]: Start accepts. Automaton has currently 3531 states, but on-demand construction may add more states Word has length 243 [2024-05-30 14:18:59,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:59,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-30 14:18:59,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:59,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1800476300, now seen corresponding path program 1 times [2024-05-30 14:18:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400432761] [2024-05-30 14:18:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:59,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:18:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:18:59,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:18:59,271 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:18:59,271 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:18:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-30 14:18:59,272 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:18:59,273 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/32) [2024-05-30 14:18:59,273 WARN L234 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:18:59,273 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-05-30 14:18:59,364 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:18:59,372 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:18:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:18:59,376 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:18:59,388 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:18:59,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:18:59,389 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:18:59,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:18:59,389 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:18:59,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (32)] Waiting until timeout for monitored process [2024-05-30 14:18:59,897 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3754 states. [2024-05-30 14:18:59,897 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:18:59,897 INFO L78 Accepts]: Start accepts. Automaton has currently 3786 states, but on-demand construction may add more states Word has length 251 [2024-05-30 14:18:59,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:18:59,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:18:59,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:18:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1829913130, now seen corresponding path program 1 times [2024-05-30 14:18:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:18:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596579234] [2024-05-30 14:18:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:18:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:18:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:18:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2024-05-30 14:18:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:18:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596579234] [2024-05-30 14:18:59,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596579234] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:18:59,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:18:59,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:18:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060387271] [2024-05-30 14:18:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:18:59,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:18:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:18:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:18:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:18:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:59,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:18:59,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:18:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:18:59,962 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:00,013 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3755 states. [2024-05-30 14:19:00,013 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:00,013 INFO L78 Accepts]: Start accepts. Automaton has currently 3756 states, but on-demand construction may add more states Word has length 250 [2024-05-30 14:19:00,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:00,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-30 14:19:00,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:00,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash -345285312, now seen corresponding path program 1 times [2024-05-30 14:19:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:00,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874771050] [2024-05-30 14:19:00,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:00,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:00,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:00,147 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:00,147 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:00,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-30 14:19:00,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:00,148 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/33) [2024-05-30 14:19:00,148 WARN L234 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:00,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-05-30 14:19:00,241 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:00,249 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:00,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:00,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:00,253 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:00,257 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:00,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:00,257 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:00,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:00,258 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:00,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (33)] Waiting until timeout for monitored process [2024-05-30 14:19:00,714 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3986 states. [2024-05-30 14:19:00,715 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:00,715 INFO L78 Accepts]: Start accepts. Automaton has currently 4019 states, but on-demand construction may add more states Word has length 258 [2024-05-30 14:19:00,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:00,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:00,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 873850639, now seen corresponding path program 1 times [2024-05-30 14:19:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096302327] [2024-05-30 14:19:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3632 trivial. 0 not checked. [2024-05-30 14:19:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096302327] [2024-05-30 14:19:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096302327] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:00,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386826564] [2024-05-30 14:19:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:00,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:00,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:00,785 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-05-30 14:19:00,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:00,785 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:00,844 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3987 states. [2024-05-30 14:19:00,844 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:00,845 INFO L78 Accepts]: Start accepts. Automaton has currently 3988 states, but on-demand construction may add more states Word has length 257 [2024-05-30 14:19:00,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-30 14:19:00,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:00,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 671474088, now seen corresponding path program 1 times [2024-05-30 14:19:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952900261] [2024-05-30 14:19:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:00,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:00,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:00,987 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:00,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:00,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-30 14:19:00,995 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:00,996 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/34) [2024-05-30 14:19:00,996 WARN L234 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:00,996 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-05-30 14:19:01,159 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:01,180 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:01,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:01,196 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:01,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Waiting until timeout for monitored process [2024-05-30 14:19:01,203 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:01,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:01,204 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:01,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:01,204 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:02,258 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4225 states. [2024-05-30 14:19:02,258 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:02,258 INFO L78 Accepts]: Start accepts. Automaton has currently 4259 states, but on-demand construction may add more states Word has length 265 [2024-05-30 14:19:02,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:02,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:02,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -850099032, now seen corresponding path program 1 times [2024-05-30 14:19:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788136247] [2024-05-30 14:19:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3861 trivial. 0 not checked. [2024-05-30 14:19:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788136247] [2024-05-30 14:19:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788136247] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357960157] [2024-05-30 14:19:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:02,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:02,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:02,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:02,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:02,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:02,322 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:02,379 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4226 states. [2024-05-30 14:19:02,379 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:02,379 INFO L78 Accepts]: Start accepts. Automaton has currently 4227 states, but on-demand construction may add more states Word has length 264 [2024-05-30 14:19:02,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:02,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-30 14:19:02,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:02,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1840023423, now seen corresponding path program 1 times [2024-05-30 14:19:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962726180] [2024-05-30 14:19:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:02,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:02,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:02,536 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:02,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:02,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-30 14:19:02,538 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:02,539 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/35) [2024-05-30 14:19:02,539 WARN L234 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:02,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-05-30 14:19:02,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:02,649 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:02,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:02,656 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:02,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (35)] Waiting until timeout for monitored process [2024-05-30 14:19:02,668 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:02,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:02,672 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:02,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:02,673 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:03,221 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4471 states. [2024-05-30 14:19:03,221 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:03,221 INFO L78 Accepts]: Start accepts. Automaton has currently 4506 states, but on-demand construction may add more states Word has length 272 [2024-05-30 14:19:03,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:03,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:03,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1802232562, now seen corresponding path program 1 times [2024-05-30 14:19:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366303199] [2024-05-30 14:19:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4097 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4097 trivial. 0 not checked. [2024-05-30 14:19:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366303199] [2024-05-30 14:19:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366303199] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475051555] [2024-05-30 14:19:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:03,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:03,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:03,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:03,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:03,292 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:03,351 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4472 states. [2024-05-30 14:19:03,351 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:03,352 INFO L78 Accepts]: Start accepts. Automaton has currently 4473 states, but on-demand construction may add more states Word has length 271 [2024-05-30 14:19:03,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:03,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-30 14:19:03,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:03,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash 715408136, now seen corresponding path program 1 times [2024-05-30 14:19:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:03,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648126883] [2024-05-30 14:19:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:03,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:03,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:03,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:03,515 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:03,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:03,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-30 14:19:03,518 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:03,518 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/36) [2024-05-30 14:19:03,518 WARN L234 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:03,518 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-05-30 14:19:03,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:03,647 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:03,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:03,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:03,650 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:03,660 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:03,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:03,660 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:03,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:03,661 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:03,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (36)] Waiting until timeout for monitored process [2024-05-30 14:19:04,540 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4724 states. [2024-05-30 14:19:04,540 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:04,540 INFO L78 Accepts]: Start accepts. Automaton has currently 4760 states, but on-demand construction may add more states Word has length 279 [2024-05-30 14:19:04,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:04,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:04,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1711329258, now seen corresponding path program 1 times [2024-05-30 14:19:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435553425] [2024-05-30 14:19:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4340 trivial. 0 not checked. [2024-05-30 14:19:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435553425] [2024-05-30 14:19:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435553425] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734130195] [2024-05-30 14:19:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:04,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:04,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:04,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:04,717 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:04,776 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4725 states. [2024-05-30 14:19:04,776 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:04,777 INFO L78 Accepts]: Start accepts. Automaton has currently 4726 states, but on-demand construction may add more states Word has length 278 [2024-05-30 14:19:04,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:04,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-30 14:19:04,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:04,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -298088066, now seen corresponding path program 1 times [2024-05-30 14:19:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642513958] [2024-05-30 14:19:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:04,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:04,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:04,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:04,952 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:04,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-30 14:19:04,954 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:04,954 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/37) [2024-05-30 14:19:04,954 WARN L234 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:04,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-05-30 14:19:05,061 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:05,068 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:05,072 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (37)] Waiting until timeout for monitored process [2024-05-30 14:19:05,079 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:05,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:05,080 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:05,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:05,080 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:06,253 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4984 states. [2024-05-30 14:19:06,253 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:06,253 INFO L78 Accepts]: Start accepts. Automaton has currently 5021 states, but on-demand construction may add more states Word has length 286 [2024-05-30 14:19:06,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:06,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:06,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1084465075, now seen corresponding path program 1 times [2024-05-30 14:19:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067395086] [2024-05-30 14:19:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2024-05-30 14:19:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067395086] [2024-05-30 14:19:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067395086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379677365] [2024-05-30 14:19:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:06,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:06,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:06,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:06,318 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:06,384 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4985 states. [2024-05-30 14:19:06,384 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:06,385 INFO L78 Accepts]: Start accepts. Automaton has currently 4986 states, but on-demand construction may add more states Word has length 285 [2024-05-30 14:19:06,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:06,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-30 14:19:06,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:06,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash -132569044, now seen corresponding path program 1 times [2024-05-30 14:19:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:06,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580725430] [2024-05-30 14:19:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:06,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:06,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:06,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:06,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:06,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:06,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-30 14:19:06,565 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:06,565 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/38) [2024-05-30 14:19:06,565 WARN L234 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:06,565 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-05-30 14:19:06,667 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:06,675 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:06,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:06,684 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:06,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (38)] Waiting until timeout for monitored process [2024-05-30 14:19:06,690 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:06,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:06,691 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:06,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:06,691 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:07,550 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5251 states. [2024-05-30 14:19:07,550 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:07,550 INFO L78 Accepts]: Start accepts. Automaton has currently 5289 states, but on-demand construction may add more states Word has length 293 [2024-05-30 14:19:07,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:07,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:07,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 155107696, now seen corresponding path program 1 times [2024-05-30 14:19:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120676381] [2024-05-30 14:19:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4847 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4847 trivial. 0 not checked. [2024-05-30 14:19:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120676381] [2024-05-30 14:19:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120676381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565076233] [2024-05-30 14:19:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:07,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:07,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:07,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:07,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:07,619 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:07,677 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5252 states. [2024-05-30 14:19:07,677 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:07,678 INFO L78 Accepts]: Start accepts. Automaton has currently 5253 states, but on-demand construction may add more states Word has length 292 [2024-05-30 14:19:07,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:07,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-30 14:19:07,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:07,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:07,679 INFO L85 PathProgramCache]: Analyzing trace with hash 857533, now seen corresponding path program 1 times [2024-05-30 14:19:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20922279] [2024-05-30 14:19:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:07,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:07,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:07,844 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:07,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:07,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-30 14:19:07,845 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:07,845 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/39) [2024-05-30 14:19:07,845 WARN L234 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:07,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-05-30 14:19:07,950 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:07,957 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:07,964 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:07,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (39)] Waiting until timeout for monitored process [2024-05-30 14:19:07,977 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:07,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:07,978 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:07,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:07,978 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:09,949 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5525 states. [2024-05-30 14:19:09,950 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:09,950 INFO L78 Accepts]: Start accepts. Automaton has currently 5564 states, but on-demand construction may add more states Word has length 300 [2024-05-30 14:19:09,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:09,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:09,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash -249515188, now seen corresponding path program 1 times [2024-05-30 14:19:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134556821] [2024-05-30 14:19:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5111 trivial. 0 not checked. [2024-05-30 14:19:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134556821] [2024-05-30 14:19:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134556821] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856250855] [2024-05-30 14:19:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:10,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:10,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:10,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 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-05-30 14:19:10,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:10,049 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:10,115 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5526 states. [2024-05-30 14:19:10,115 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:10,115 INFO L78 Accepts]: Start accepts. Automaton has currently 5527 states, but on-demand construction may add more states Word has length 299 [2024-05-30 14:19:10,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:10,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-30 14:19:10,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:10,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1856126612, now seen corresponding path program 1 times [2024-05-30 14:19:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584639539] [2024-05-30 14:19:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:10,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:10,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:10,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:10,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:10,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-30 14:19:10,301 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:10,301 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/40) [2024-05-30 14:19:10,301 WARN L234 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:10,302 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2024-05-30 14:19:10,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:10,529 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:10,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:10,532 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:10,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (40)] Waiting until timeout for monitored process [2024-05-30 14:19:10,548 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:10,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:10,548 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:10,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:10,548 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:11,812 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5806 states. [2024-05-30 14:19:11,813 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:11,813 INFO L78 Accepts]: Start accepts. Automaton has currently 5846 states, but on-demand construction may add more states Word has length 307 [2024-05-30 14:19:11,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:11,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:11,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -707348806, now seen corresponding path program 1 times [2024-05-30 14:19:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:11,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004279484] [2024-05-30 14:19:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:11,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5382 trivial. 0 not checked. [2024-05-30 14:19:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004279484] [2024-05-30 14:19:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004279484] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963523277] [2024-05-30 14:19:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:11,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:11,878 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:11,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:11,878 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:11,942 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5807 states. [2024-05-30 14:19:11,943 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:11,943 INFO L78 Accepts]: Start accepts. Automaton has currently 5808 states, but on-demand construction may add more states Word has length 306 [2024-05-30 14:19:11,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:11,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-30 14:19:11,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:11,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -958587204, now seen corresponding path program 1 times [2024-05-30 14:19:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698635018] [2024-05-30 14:19:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:12,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:12,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:12,114 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:12,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:12,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-30 14:19:12,115 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:12,115 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/41) [2024-05-30 14:19:12,115 WARN L234 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:12,115 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2024-05-30 14:19:12,219 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:12,226 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:12,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:12,232 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:12,242 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:12,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:12,242 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:12,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:12,242 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:12,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (41)] Waiting until timeout for monitored process [2024-05-30 14:19:14,839 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6094 states. [2024-05-30 14:19:14,839 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:14,839 INFO L78 Accepts]: Start accepts. Automaton has currently 6135 states, but on-demand construction may add more states Word has length 314 [2024-05-30 14:19:14,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:14,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:14,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -779462517, now seen corresponding path program 1 times [2024-05-30 14:19:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300797552] [2024-05-30 14:19:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5660 trivial. 0 not checked. [2024-05-30 14:19:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300797552] [2024-05-30 14:19:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300797552] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009960147] [2024-05-30 14:19:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:14,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:14,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:14,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:14,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:14,920 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:14,986 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6095 states. [2024-05-30 14:19:14,987 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:14,987 INFO L78 Accepts]: Start accepts. Automaton has currently 6096 states, but on-demand construction may add more states Word has length 313 [2024-05-30 14:19:14,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-30 14:19:14,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:14,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -518130752, now seen corresponding path program 1 times [2024-05-30 14:19:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222404367] [2024-05-30 14:19:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:15,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:15,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:15,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:15,194 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-30 14:19:15,195 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:15,195 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/42) [2024-05-30 14:19:15,195 WARN L234 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:15,195 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2024-05-30 14:19:15,352 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:15,360 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:15,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:15,366 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:15,370 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:15,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:15,370 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:15,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:15,371 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:15,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (42)] Waiting until timeout for monitored process [2024-05-30 14:19:17,000 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6389 states. [2024-05-30 14:19:17,000 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:17,001 INFO L78 Accepts]: Start accepts. Automaton has currently 6431 states, but on-demand construction may add more states Word has length 321 [2024-05-30 14:19:17,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:17,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:17,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1753100984, now seen corresponding path program 1 times [2024-05-30 14:19:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511056059] [2024-05-30 14:19:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5945 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5945 trivial. 0 not checked. [2024-05-30 14:19:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511056059] [2024-05-30 14:19:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511056059] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568426756] [2024-05-30 14:19:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:17,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:17,081 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-05-30 14:19:17,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:17,081 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:17,307 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6390 states. [2024-05-30 14:19:17,307 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:17,308 INFO L78 Accepts]: Start accepts. Automaton has currently 6391 states, but on-demand construction may add more states Word has length 320 [2024-05-30 14:19:17,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-30 14:19:17,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:17,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 752801531, now seen corresponding path program 1 times [2024-05-30 14:19:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922796943] [2024-05-30 14:19:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:17,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:17,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:17,489 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:17,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-30 14:19:17,493 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:17,493 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/43) [2024-05-30 14:19:17,493 WARN L234 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:17,493 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2024-05-30 14:19:17,608 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:17,615 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:17,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:17,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:17,620 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:17,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (43)] Waiting until timeout for monitored process [2024-05-30 14:19:17,626 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:17,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:17,626 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:17,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:17,627 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:20,448 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6691 states. [2024-05-30 14:19:20,448 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:20,448 INFO L78 Accepts]: Start accepts. Automaton has currently 6734 states, but on-demand construction may add more states Word has length 328 [2024-05-30 14:19:20,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:20,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:20,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1544957302, now seen corresponding path program 1 times [2024-05-30 14:19:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212317356] [2024-05-30 14:19:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6237 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6237 trivial. 0 not checked. [2024-05-30 14:19:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212317356] [2024-05-30 14:19:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212317356] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513005185] [2024-05-30 14:19:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:20,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:20,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:20,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:20,530 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:20,601 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6692 states. [2024-05-30 14:19:20,601 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:20,602 INFO L78 Accepts]: Start accepts. Automaton has currently 6693 states, but on-demand construction may add more states Word has length 327 [2024-05-30 14:19:20,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-30 14:19:20,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:20,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash 811300144, now seen corresponding path program 1 times [2024-05-30 14:19:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274612902] [2024-05-30 14:19:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:20,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:20,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:20,786 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:20,786 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:20,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-30 14:19:20,787 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:20,787 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/44) [2024-05-30 14:19:20,787 WARN L234 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:20,787 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2024-05-30 14:19:20,906 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:20,917 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:20,921 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:20,924 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:20,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:20,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:20,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:20,925 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:20,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (44)] Waiting until timeout for monitored process [2024-05-30 14:19:23,484 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7000 states. [2024-05-30 14:19:23,485 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:23,485 INFO L78 Accepts]: Start accepts. Automaton has currently 7044 states, but on-demand construction may add more states Word has length 335 [2024-05-30 14:19:23,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:23,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:23,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1522933094, now seen corresponding path program 1 times [2024-05-30 14:19:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:23,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002782835] [2024-05-30 14:19:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6536 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6536 trivial. 0 not checked. [2024-05-30 14:19:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002782835] [2024-05-30 14:19:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002782835] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:23,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746609404] [2024-05-30 14:19:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:23,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:23,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:23,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:23,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:23,577 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:23,646 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7001 states. [2024-05-30 14:19:23,646 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:23,646 INFO L78 Accepts]: Start accepts. Automaton has currently 7002 states, but on-demand construction may add more states Word has length 334 [2024-05-30 14:19:23,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:23,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-30 14:19:23,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:23,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -630411014, now seen corresponding path program 1 times [2024-05-30 14:19:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091381537] [2024-05-30 14:19:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:23,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:23,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:23,845 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:23,845 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:23,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-30 14:19:23,846 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:23,846 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/45) [2024-05-30 14:19:23,846 WARN L234 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:23,846 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2024-05-30 14:19:23,957 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:23,964 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:23,971 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:23,975 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:23,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:23,975 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:23,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:23,975 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:23,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (45)] Waiting until timeout for monitored process [2024-05-30 14:19:27,009 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7316 states. [2024-05-30 14:19:27,009 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:27,009 INFO L78 Accepts]: Start accepts. Automaton has currently 7361 states, but on-demand construction may add more states Word has length 342 [2024-05-30 14:19:27,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:27,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:27,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1176050743, now seen corresponding path program 1 times [2024-05-30 14:19:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175823844] [2024-05-30 14:19:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6842 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6842 trivial. 0 not checked. [2024-05-30 14:19:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175823844] [2024-05-30 14:19:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175823844] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651203756] [2024-05-30 14:19:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:27,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:27,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:27,089 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:27,331 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7317 states. [2024-05-30 14:19:27,331 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:27,332 INFO L78 Accepts]: Start accepts. Automaton has currently 7318 states, but on-demand construction may add more states Word has length 341 [2024-05-30 14:19:27,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-30 14:19:27,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1651159140, now seen corresponding path program 1 times [2024-05-30 14:19:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539916867] [2024-05-30 14:19:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:27,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:27,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:27,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:27,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:27,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-30 14:19:27,507 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:27,507 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/46) [2024-05-30 14:19:27,507 WARN L234 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:27,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2024-05-30 14:19:27,629 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:27,636 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:27,685 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:27,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Waiting until timeout for monitored process [2024-05-30 14:19:27,689 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:27,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:27,689 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:27,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:27,689 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:30,206 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7639 states. [2024-05-30 14:19:30,207 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:30,207 INFO L78 Accepts]: Start accepts. Automaton has currently 7685 states, but on-demand construction may add more states Word has length 349 [2024-05-30 14:19:30,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:30,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:30,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1115057104, now seen corresponding path program 1 times [2024-05-30 14:19:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975424278] [2024-05-30 14:19:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7155 trivial. 0 not checked. [2024-05-30 14:19:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975424278] [2024-05-30 14:19:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975424278] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:30,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:30,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863241458] [2024-05-30 14:19:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:30,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:30,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:30,292 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:30,368 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7640 states. [2024-05-30 14:19:30,368 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:30,368 INFO L78 Accepts]: Start accepts. Automaton has currently 7641 states, but on-demand construction may add more states Word has length 348 [2024-05-30 14:19:30,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:30,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-30 14:19:30,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:30,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1874353977, now seen corresponding path program 1 times [2024-05-30 14:19:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:30,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878028369] [2024-05-30 14:19:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:30,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:30,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:30,572 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:30,572 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:30,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-05-30 14:19:30,573 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:30,573 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/47) [2024-05-30 14:19:30,573 WARN L234 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:30,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2024-05-30 14:19:30,685 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:30,693 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:30,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:30,696 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:30,699 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:30,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:30,700 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:30,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:30,700 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:30,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (47)] Waiting until timeout for monitored process [2024-05-30 14:19:35,656 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7969 states. [2024-05-30 14:19:35,656 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:35,657 INFO L78 Accepts]: Start accepts. Automaton has currently 8016 states, but on-demand construction may add more states Word has length 356 [2024-05-30 14:19:35,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:35,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:35,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1473212728, now seen corresponding path program 1 times [2024-05-30 14:19:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053978690] [2024-05-30 14:19:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7475 trivial. 0 not checked. [2024-05-30 14:19:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053978690] [2024-05-30 14:19:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053978690] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114184140] [2024-05-30 14:19:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:35,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:35,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:35,740 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:35,818 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7970 states. [2024-05-30 14:19:35,818 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:35,819 INFO L78 Accepts]: Start accepts. Automaton has currently 7971 states, but on-demand construction may add more states Word has length 355 [2024-05-30 14:19:35,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:35,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-05-30 14:19:35,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:35,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 938234588, now seen corresponding path program 1 times [2024-05-30 14:19:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299775741] [2024-05-30 14:19:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:35,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:36,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:36,044 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:36,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:36,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-05-30 14:19:36,045 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:36,045 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/48) [2024-05-30 14:19:36,045 WARN L234 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:36,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2024-05-30 14:19:36,165 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:36,175 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:36,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:36,180 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:36,190 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:36,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:36,190 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:36,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:36,191 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:36,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (48)] Waiting until timeout for monitored process [2024-05-30 14:19:40,561 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 8306 states. [2024-05-30 14:19:40,562 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:40,562 INFO L78 Accepts]: Start accepts. Automaton has currently 8354 states, but on-demand construction may add more states Word has length 363 [2024-05-30 14:19:40,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:40,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:40,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1625046922, now seen corresponding path program 1 times [2024-05-30 14:19:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420941004] [2024-05-30 14:19:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7802 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7802 trivial. 0 not checked. [2024-05-30 14:19:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:40,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420941004] [2024-05-30 14:19:40,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420941004] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:40,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:40,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115025735] [2024-05-30 14:19:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:40,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:40,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:40,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:40,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:40,644 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:40,721 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 8307 states. [2024-05-30 14:19:40,721 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:40,721 INFO L78 Accepts]: Start accepts. Automaton has currently 8308 states, but on-demand construction may add more states Word has length 362 [2024-05-30 14:19:40,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:40,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-30 14:19:40,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:40,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2139433928, now seen corresponding path program 1 times [2024-05-30 14:19:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:40,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801890047] [2024-05-30 14:19:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:40,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:40,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:40,954 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:40,954 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:40,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-30 14:19:40,956 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:40,956 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/49) [2024-05-30 14:19:40,956 WARN L234 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:40,956 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2024-05-30 14:19:41,113 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:41,120 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:41,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:41,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:41,128 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:41,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (49)] Waiting until timeout for monitored process [2024-05-30 14:19:41,134 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:41,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:41,135 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:41,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:41,135 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:46,653 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 8650 states. [2024-05-30 14:19:46,653 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:46,654 INFO L78 Accepts]: Start accepts. Automaton has currently 8699 states, but on-demand construction may add more states Word has length 370 [2024-05-30 14:19:46,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:46,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:46,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1121118713, now seen corresponding path program 1 times [2024-05-30 14:19:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:46,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457871516] [2024-05-30 14:19:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8136 trivial. 0 not checked. [2024-05-30 14:19:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457871516] [2024-05-30 14:19:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457871516] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827150401] [2024-05-30 14:19:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:46,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:46,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:46,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:46,739 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:46,817 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 8651 states. [2024-05-30 14:19:46,818 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:46,818 INFO L78 Accepts]: Start accepts. Automaton has currently 8652 states, but on-demand construction may add more states Word has length 369 [2024-05-30 14:19:46,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:46,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-05-30 14:19:46,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:46,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1063373336, now seen corresponding path program 1 times [2024-05-30 14:19:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170955508] [2024-05-30 14:19:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:46,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:47,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:47,062 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:47,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:47,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-05-30 14:19:47,071 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:47,071 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/50) [2024-05-30 14:19:47,071 WARN L234 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:47,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2024-05-30 14:19:47,197 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:47,203 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:47,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:47,204 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:47,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (50)] Waiting until timeout for monitored process [2024-05-30 14:19:47,208 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:47,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:47,209 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:47,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:47,209 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:50,664 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9001 states. [2024-05-30 14:19:50,664 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:50,664 INFO L78 Accepts]: Start accepts. Automaton has currently 9051 states, but on-demand construction may add more states Word has length 377 [2024-05-30 14:19:50,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:50,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:50,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 701366824, now seen corresponding path program 1 times [2024-05-30 14:19:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103279438] [2024-05-30 14:19:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8477 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8477 trivial. 0 not checked. [2024-05-30 14:19:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:50,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103279438] [2024-05-30 14:19:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103279438] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:50,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436560100] [2024-05-30 14:19:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:50,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:50,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:50,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:50,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:50,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:19:50,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:50,758 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:50,828 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9002 states. [2024-05-30 14:19:50,828 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:50,828 INFO L78 Accepts]: Start accepts. Automaton has currently 9003 states, but on-demand construction may add more states Word has length 376 [2024-05-30 14:19:50,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:50,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-30 14:19:50,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:50,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash -777764233, now seen corresponding path program 1 times [2024-05-30 14:19:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:50,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249290510] [2024-05-30 14:19:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:50,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:50,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:51,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:51,063 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:51,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-05-30 14:19:51,064 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:51,064 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/51) [2024-05-30 14:19:51,064 WARN L234 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:51,064 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2024-05-30 14:19:51,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:51,210 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:51,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:51,212 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:51,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (51)] Waiting until timeout for monitored process [2024-05-30 14:19:51,215 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:51,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:51,216 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:51,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:51,216 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:56,993 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9359 states. [2024-05-30 14:19:56,993 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:56,993 INFO L78 Accepts]: Start accepts. Automaton has currently 9410 states, but on-demand construction may add more states Word has length 384 [2024-05-30 14:19:56,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:56,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:56,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 967441414, now seen corresponding path program 1 times [2024-05-30 14:19:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214542825] [2024-05-30 14:19:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:19:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8825 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2024-05-30 14:19:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:19:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214542825] [2024-05-30 14:19:57,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214542825] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:19:57,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:19:57,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:19:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189161823] [2024-05-30 14:19:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:19:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:19:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:19:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:19:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:19:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:57,080 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:19:57,081 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-05-30 14:19:57,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:57,081 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:19:57,163 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9360 states. [2024-05-30 14:19:57,163 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:19:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:19:57,164 INFO L78 Accepts]: Start accepts. Automaton has currently 9361 states, but on-demand construction may add more states Word has length 383 [2024-05-30 14:19:57,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:19:57,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-05-30 14:19:57,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:19:57,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:19:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -427998312, now seen corresponding path program 1 times [2024-05-30 14:19:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:19:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130395341] [2024-05-30 14:19:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:19:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:19:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:57,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:19:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:19:57,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:19:57,426 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:19:57,426 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:19:57,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-05-30 14:19:57,427 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:19:57,427 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/52) [2024-05-30 14:19:57,427 WARN L234 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:19:57,427 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2024-05-30 14:19:57,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:19:57,578 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:57,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:19:57,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:19:57,581 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:19:57,585 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:19:57,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:19:57,586 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:19:57,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:19:57,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (52)] Waiting until timeout for monitored process [2024-05-30 14:19:57,586 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:02,443 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9724 states. [2024-05-30 14:20:02,443 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:02,443 INFO L78 Accepts]: Start accepts. Automaton has currently 9776 states, but on-demand construction may add more states Word has length 391 [2024-05-30 14:20:02,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:02,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:02,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1552172662, now seen corresponding path program 1 times [2024-05-30 14:20:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696580693] [2024-05-30 14:20:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2024-05-30 14:20:02,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:02,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696580693] [2024-05-30 14:20:02,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696580693] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:02,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:02,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524477418] [2024-05-30 14:20:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:02,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:02,535 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:02,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:02,535 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:02,621 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 9725 states. [2024-05-30 14:20:02,621 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:02,621 INFO L78 Accepts]: Start accepts. Automaton has currently 9726 states, but on-demand construction may add more states Word has length 390 [2024-05-30 14:20:02,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:02,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-05-30 14:20:02,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:02,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1493965942, now seen corresponding path program 1 times [2024-05-30 14:20:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930040448] [2024-05-30 14:20:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:02,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:02,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:02,886 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:02,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:02,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-05-30 14:20:02,887 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:02,887 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/53) [2024-05-30 14:20:02,887 WARN L234 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:02,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2024-05-30 14:20:03,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:03,033 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:03,035 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:03,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (53)] Waiting until timeout for monitored process [2024-05-30 14:20:03,038 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:03,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:03,039 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:03,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:03,039 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:08,298 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10096 states. [2024-05-30 14:20:08,299 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:08,299 INFO L78 Accepts]: Start accepts. Automaton has currently 10149 states, but on-demand construction may add more states Word has length 398 [2024-05-30 14:20:08,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:08,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:08,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -880016571, now seen corresponding path program 1 times [2024-05-30 14:20:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129791014] [2024-05-30 14:20:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9542 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9542 trivial. 0 not checked. [2024-05-30 14:20:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129791014] [2024-05-30 14:20:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129791014] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260401843] [2024-05-30 14:20:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:08,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:08,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:08,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:08,400 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:08,484 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10097 states. [2024-05-30 14:20:08,485 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:08,485 INFO L78 Accepts]: Start accepts. Automaton has currently 10098 states, but on-demand construction may add more states Word has length 397 [2024-05-30 14:20:08,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:08,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-05-30 14:20:08,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:08,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 158444764, now seen corresponding path program 1 times [2024-05-30 14:20:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978204371] [2024-05-30 14:20:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:08,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:08,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:08,757 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:08,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-05-30 14:20:08,760 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:08,760 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/54) [2024-05-30 14:20:08,760 WARN L234 ceAbstractionStarter]: 52 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:08,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 53 thread instances. [2024-05-30 14:20:08,890 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:08,897 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:08,898 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:08,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (54)] Waiting until timeout for monitored process [2024-05-30 14:20:08,902 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:08,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:08,903 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:08,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:08,903 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:15,414 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10475 states. [2024-05-30 14:20:15,415 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:15,415 INFO L78 Accepts]: Start accepts. Automaton has currently 10529 states, but on-demand construction may add more states Word has length 405 [2024-05-30 14:20:15,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:15,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:15,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash 500368176, now seen corresponding path program 1 times [2024-05-30 14:20:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:15,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619534330] [2024-05-30 14:20:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9911 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9911 trivial. 0 not checked. [2024-05-30 14:20:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619534330] [2024-05-30 14:20:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619534330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:15,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115370155] [2024-05-30 14:20:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:15,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:15,509 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:15,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:15,510 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:15,584 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10476 states. [2024-05-30 14:20:15,584 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:15,585 INFO L78 Accepts]: Start accepts. Automaton has currently 10477 states, but on-demand construction may add more states Word has length 404 [2024-05-30 14:20:15,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:15,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-05-30 14:20:15,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:15,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2132874421, now seen corresponding path program 1 times [2024-05-30 14:20:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107536221] [2024-05-30 14:20:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:15,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:15,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:15,863 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:15,864 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:15,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-05-30 14:20:15,864 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:15,864 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/55) [2024-05-30 14:20:15,864 WARN L234 ceAbstractionStarter]: 53 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:15,865 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 54 thread instances. [2024-05-30 14:20:16,002 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:16,307 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:16,316 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:16,322 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:16,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:16,323 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:16,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:16,323 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:16,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (55)] Waiting until timeout for monitored process [2024-05-30 14:20:20,191 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10861 states. [2024-05-30 14:20:20,191 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:20,192 INFO L78 Accepts]: Start accepts. Automaton has currently 10916 states, but on-demand construction may add more states Word has length 412 [2024-05-30 14:20:20,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:20,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:20,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash -897634748, now seen corresponding path program 1 times [2024-05-30 14:20:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056709462] [2024-05-30 14:20:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10287 trivial. 0 not checked. [2024-05-30 14:20:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056709462] [2024-05-30 14:20:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056709462] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:20,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26000759] [2024-05-30 14:20:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:20,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:20,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:20,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:20,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:20,289 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:20,370 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10862 states. [2024-05-30 14:20:20,370 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:20,464 INFO L78 Accepts]: Start accepts. Automaton has currently 10863 states, but on-demand construction may add more states Word has length 411 [2024-05-30 14:20:20,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:20,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-05-30 14:20:20,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:20,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2143112348, now seen corresponding path program 1 times [2024-05-30 14:20:20,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:20,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681673274] [2024-05-30 14:20:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:20,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:20,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:20,840 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:20,840 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:20,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-05-30 14:20:20,841 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:20,841 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/56) [2024-05-30 14:20:20,841 WARN L234 ceAbstractionStarter]: 54 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:20,841 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 55 thread instances. [2024-05-30 14:20:20,983 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:21,068 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:21,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:21,080 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:21,083 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:21,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:21,084 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:21,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:21,084 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:21,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (56)] Waiting until timeout for monitored process [2024-05-30 14:20:31,248 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 11254 states. [2024-05-30 14:20:31,248 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:31,249 INFO L78 Accepts]: Start accepts. Automaton has currently 11310 states, but on-demand construction may add more states Word has length 419 [2024-05-30 14:20:31,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:31,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:31,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1950566, now seen corresponding path program 1 times [2024-05-30 14:20:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570598951] [2024-05-30 14:20:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10670 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10670 trivial. 0 not checked. [2024-05-30 14:20:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570598951] [2024-05-30 14:20:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570598951] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:31,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14947624] [2024-05-30 14:20:31,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:31,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:31,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:31,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:31,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:31,344 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:31,472 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 11255 states. [2024-05-30 14:20:31,472 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:31,472 INFO L78 Accepts]: Start accepts. Automaton has currently 11256 states, but on-demand construction may add more states Word has length 418 [2024-05-30 14:20:31,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:31,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-05-30 14:20:31,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:31,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 580459956, now seen corresponding path program 1 times [2024-05-30 14:20:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261496096] [2024-05-30 14:20:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:31,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:31,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:31,762 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:31,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-05-30 14:20:31,763 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:31,763 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/57) [2024-05-30 14:20:31,763 WARN L234 ceAbstractionStarter]: 55 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:31,763 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 56 thread instances. [2024-05-30 14:20:31,903 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:31,911 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:31,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:31,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:31,920 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:31,923 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:31,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:31,924 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:31,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:31,924 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (57)] Waiting until timeout for monitored process [2024-05-30 14:20:44,154 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 11654 states. [2024-05-30 14:20:44,154 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:44,154 INFO L78 Accepts]: Start accepts. Automaton has currently 11711 states, but on-demand construction may add more states Word has length 426 [2024-05-30 14:20:44,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:44,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:44,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1230585981, now seen corresponding path program 1 times [2024-05-30 14:20:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102691107] [2024-05-30 14:20:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11060 trivial. 0 not checked. [2024-05-30 14:20:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102691107] [2024-05-30 14:20:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102691107] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800833524] [2024-05-30 14:20:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:44,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:44,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:44,252 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:44,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:20:44,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:44,252 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:44,329 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 11655 states. [2024-05-30 14:20:44,329 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:44,329 INFO L78 Accepts]: Start accepts. Automaton has currently 11656 states, but on-demand construction may add more states Word has length 425 [2024-05-30 14:20:44,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:44,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-05-30 14:20:44,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:44,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 706004144, now seen corresponding path program 1 times [2024-05-30 14:20:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779695368] [2024-05-30 14:20:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:44,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:44,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:44,564 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:44,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:44,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-05-30 14:20:44,565 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:44,565 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/58) [2024-05-30 14:20:44,565 WARN L234 ceAbstractionStarter]: 56 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:44,565 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 57 thread instances. [2024-05-30 14:20:44,713 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:44,722 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:44,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:44,726 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:44,730 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:44,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:44,730 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:44,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:44,731 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:44,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (58)] Waiting until timeout for monitored process [2024-05-30 14:20:52,759 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12061 states. [2024-05-30 14:20:52,760 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:52,760 INFO L78 Accepts]: Start accepts. Automaton has currently 12119 states, but on-demand construction may add more states Word has length 433 [2024-05-30 14:20:52,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:52,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:52,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 405308232, now seen corresponding path program 1 times [2024-05-30 14:20:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672808978] [2024-05-30 14:20:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:20:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11457 trivial. 0 not checked. [2024-05-30 14:20:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:20:52,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672808978] [2024-05-30 14:20:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672808978] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:20:52,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:20:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:20:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169385653] [2024-05-30 14:20:52,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:20:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:20:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:20:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:20:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:20:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:52,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:20:52,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 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-05-30 14:20:52,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:52,858 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:52,944 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12062 states. [2024-05-30 14:20:52,944 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:20:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:20:52,944 INFO L78 Accepts]: Start accepts. Automaton has currently 12063 states, but on-demand construction may add more states Word has length 432 [2024-05-30 14:20:52,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:20:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-05-30 14:20:52,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:20:52,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:20:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -568235533, now seen corresponding path program 1 times [2024-05-30 14:20:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:20:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226936214] [2024-05-30 14:20:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:20:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:20:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:53,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:20:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:20:53,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:20:53,230 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:20:53,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:20:53,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-05-30 14:20:53,231 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:20:53,231 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/59) [2024-05-30 14:20:53,231 WARN L234 ceAbstractionStarter]: 57 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:20:53,231 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 58 thread instances. [2024-05-30 14:20:53,488 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:20:53,497 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:53,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:20:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:20:53,500 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:20:53,503 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:20:53,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:20:53,504 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:20:53,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:20:53,504 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:20:53,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (59)] Waiting until timeout for monitored process [2024-05-30 14:21:01,975 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12475 states. [2024-05-30 14:21:01,975 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:01,975 INFO L78 Accepts]: Start accepts. Automaton has currently 12534 states, but on-demand construction may add more states Word has length 440 [2024-05-30 14:21:01,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:01,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:01,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2035104130, now seen corresponding path program 1 times [2024-05-30 14:21:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340010383] [2024-05-30 14:21:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:21:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11861 trivial. 0 not checked. [2024-05-30 14:21:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:21:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340010383] [2024-05-30 14:21:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340010383] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:21:02,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:21:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:21:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529446508] [2024-05-30 14:21:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:21:02,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:21:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:21:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:21:02,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:21:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:02,074 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:21:02,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:21:02,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:02,074 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:02,158 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12476 states. [2024-05-30 14:21:02,159 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:02,159 INFO L78 Accepts]: Start accepts. Automaton has currently 12477 states, but on-demand construction may add more states Word has length 439 [2024-05-30 14:21:02,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:02,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-05-30 14:21:02,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:02,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash -159576512, now seen corresponding path program 1 times [2024-05-30 14:21:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745554093] [2024-05-30 14:21:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:02,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:21:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:02,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:21:02,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:21:02,431 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:21:02,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-05-30 14:21:02,432 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:21:02,432 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/60) [2024-05-30 14:21:02,432 WARN L234 ceAbstractionStarter]: 58 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:21:02,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 59 thread instances. [2024-05-30 14:21:02,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:21:02,641 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:21:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:21:02,643 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:21:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (60)] Waiting until timeout for monitored process [2024-05-30 14:21:02,647 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:21:02,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:21:02,647 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:02,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:21:02,647 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:15,305 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12896 states. [2024-05-30 14:21:15,305 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:15,306 INFO L78 Accepts]: Start accepts. Automaton has currently 12956 states, but on-demand construction may add more states Word has length 447 [2024-05-30 14:21:15,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:15,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:15,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1793438906, now seen corresponding path program 1 times [2024-05-30 14:21:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503286107] [2024-05-30 14:21:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:21:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12272 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12272 trivial. 0 not checked. [2024-05-30 14:21:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:21:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503286107] [2024-05-30 14:21:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503286107] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:21:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:21:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:21:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576215074] [2024-05-30 14:21:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:21:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:21:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:21:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:21:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:21:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:15,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:21:15,400 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-05-30 14:21:15,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:15,400 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:15,482 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 12897 states. [2024-05-30 14:21:15,482 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:15,483 INFO L78 Accepts]: Start accepts. Automaton has currently 12898 states, but on-demand construction may add more states Word has length 446 [2024-05-30 14:21:15,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:15,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-05-30 14:21:15,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:15,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 269380594, now seen corresponding path program 1 times [2024-05-30 14:21:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503467164] [2024-05-30 14:21:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:15,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:21:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:15,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:21:15,742 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:21:15,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:21:15,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-05-30 14:21:15,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:21:15,743 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/61) [2024-05-30 14:21:15,743 WARN L234 ceAbstractionStarter]: 59 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:21:15,743 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 60 thread instances. [2024-05-30 14:21:15,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:21:15,884 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:21:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:21:15,892 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:21:15,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (61)] Waiting until timeout for monitored process [2024-05-30 14:21:15,913 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:21:15,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:21:15,913 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:15,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:21:15,913 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:28,394 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13324 states. [2024-05-30 14:21:28,394 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:28,394 INFO L78 Accepts]: Start accepts. Automaton has currently 13385 states, but on-demand construction may add more states Word has length 454 [2024-05-30 14:21:28,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:28,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:28,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash -409706815, now seen corresponding path program 1 times [2024-05-30 14:21:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:28,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995457532] [2024-05-30 14:21:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:21:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12690 trivial. 0 not checked. [2024-05-30 14:21:28,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:21:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995457532] [2024-05-30 14:21:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995457532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:21:28,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:21:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:21:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896255450] [2024-05-30 14:21:28,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:21:28,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:21:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:21:28,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:21:28,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:21:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:28,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:21:28,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:21:28,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:28,490 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:28,571 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13325 states. [2024-05-30 14:21:28,571 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:28,572 INFO L78 Accepts]: Start accepts. Automaton has currently 13326 states, but on-demand construction may add more states Word has length 453 [2024-05-30 14:21:28,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:28,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-05-30 14:21:28,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:28,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1825668500, now seen corresponding path program 1 times [2024-05-30 14:21:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602278198] [2024-05-30 14:21:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:28,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:21:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:28,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:21:28,856 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:21:28,856 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:21:28,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-05-30 14:21:28,857 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:21:28,857 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/62) [2024-05-30 14:21:28,857 WARN L234 ceAbstractionStarter]: 60 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:21:28,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 61 thread instances. [2024-05-30 14:21:28,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:21:29,002 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:29,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:21:29,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:21:29,005 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:21:29,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (62)] Waiting until timeout for monitored process [2024-05-30 14:21:29,023 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:21:29,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:21:29,023 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:29,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:21:29,023 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:39,946 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13759 states. [2024-05-30 14:21:39,947 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:39,947 INFO L78 Accepts]: Start accepts. Automaton has currently 13821 states, but on-demand construction may add more states Word has length 461 [2024-05-30 14:21:39,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:39,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:39,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -26579344, now seen corresponding path program 1 times [2024-05-30 14:21:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723335747] [2024-05-30 14:21:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:21:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13115 trivial. 0 not checked. [2024-05-30 14:21:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:21:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723335747] [2024-05-30 14:21:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723335747] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:21:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:21:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:21:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89585832] [2024-05-30 14:21:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:21:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:21:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:21:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:21:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:21:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:40,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:21:40,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:21:40,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:40,172 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:40,256 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13760 states. [2024-05-30 14:21:40,256 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:40,257 INFO L78 Accepts]: Start accepts. Automaton has currently 13761 states, but on-demand construction may add more states Word has length 460 [2024-05-30 14:21:40,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:40,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-05-30 14:21:40,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:40,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 604755505, now seen corresponding path program 1 times [2024-05-30 14:21:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:40,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015876822] [2024-05-30 14:21:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:40,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:21:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:40,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:21:40,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:21:40,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:21:40,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-05-30 14:21:40,530 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:21:40,530 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/63) [2024-05-30 14:21:40,530 WARN L234 ceAbstractionStarter]: 61 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:21:40,530 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 62 thread instances. [2024-05-30 14:21:40,666 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:21:40,675 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:21:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:21:40,679 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:21:40,683 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:21:40,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:21:40,683 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:40,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:21:40,683 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:40,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (63)] Waiting until timeout for monitored process [2024-05-30 14:21:48,802 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 14201 states. [2024-05-30 14:21:48,802 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:48,802 INFO L78 Accepts]: Start accepts. Automaton has currently 14264 states, but on-demand construction may add more states Word has length 468 [2024-05-30 14:21:48,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:48,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:48,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 119878080, now seen corresponding path program 1 times [2024-05-30 14:21:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207724447] [2024-05-30 14:21:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:21:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13547 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13547 trivial. 0 not checked. [2024-05-30 14:21:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:21:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207724447] [2024-05-30 14:21:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207724447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:21:48,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:21:48,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:21:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148872521] [2024-05-30 14:21:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:21:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:21:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:21:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:21:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:21:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:48,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:21:48,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:21:48,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:48,906 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:21:48,993 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 14202 states. [2024-05-30 14:21:48,993 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:21:48,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:21:48,993 INFO L78 Accepts]: Start accepts. Automaton has currently 14203 states, but on-demand construction may add more states Word has length 467 [2024-05-30 14:21:48,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:21:48,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-05-30 14:21:48,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:21:48,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:21:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 829997100, now seen corresponding path program 1 times [2024-05-30 14:21:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:21:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191270539] [2024-05-30 14:21:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:21:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:21:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:49,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:21:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:21:49,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:21:49,316 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:21:49,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:21:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-05-30 14:21:49,317 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:21:49,317 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/64) [2024-05-30 14:21:49,317 WARN L234 ceAbstractionStarter]: 62 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:21:49,318 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 63 thread instances. [2024-05-30 14:21:49,581 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:21:49,588 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:21:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:21:49,591 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:21:49,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (64)] Waiting until timeout for monitored process [2024-05-30 14:21:49,595 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:21:49,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:21:49,595 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:21:49,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:21:49,595 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:06,002 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 14650 states. [2024-05-30 14:22:06,002 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:06,002 INFO L78 Accepts]: Start accepts. Automaton has currently 14714 states, but on-demand construction may add more states Word has length 475 [2024-05-30 14:22:06,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:06,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:06,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 627576298, now seen corresponding path program 1 times [2024-05-30 14:22:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386927964] [2024-05-30 14:22:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13986 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13986 trivial. 0 not checked. [2024-05-30 14:22:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386927964] [2024-05-30 14:22:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386927964] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:22:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113022094] [2024-05-30 14:22:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:06,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:22:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:22:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:22:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:06,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:06,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:22:06,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:06,126 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:06,229 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 14651 states. [2024-05-30 14:22:06,230 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:06,230 INFO L78 Accepts]: Start accepts. Automaton has currently 14652 states, but on-demand construction may add more states Word has length 474 [2024-05-30 14:22:06,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:06,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-05-30 14:22:06,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:06,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1630758096, now seen corresponding path program 1 times [2024-05-30 14:22:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646934910] [2024-05-30 14:22:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:06,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:22:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:06,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:22:06,536 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:22:06,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:22:06,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-05-30 14:22:06,536 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:22:06,537 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/65) [2024-05-30 14:22:06,537 WARN L234 ceAbstractionStarter]: 63 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:22:06,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 64 thread instances. [2024-05-30 14:22:06,744 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:22:06,755 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:06,759 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:22:06,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (65)] Waiting until timeout for monitored process [2024-05-30 14:22:06,784 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:06,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:22:06,784 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:06,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:06,785 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:22,740 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 15106 states. [2024-05-30 14:22:22,740 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:22,740 INFO L78 Accepts]: Start accepts. Automaton has currently 15171 states, but on-demand construction may add more states Word has length 482 [2024-05-30 14:22:22,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:22,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:22,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1797262081, now seen corresponding path program 1 times [2024-05-30 14:22:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397771569] [2024-05-30 14:22:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14432 trivial. 0 not checked. [2024-05-30 14:22:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397771569] [2024-05-30 14:22:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397771569] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:22:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837012665] [2024-05-30 14:22:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:22,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:22:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:22:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:22:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:22,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:22,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:22:22,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:22,868 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:22,968 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 15107 states. [2024-05-30 14:22:22,968 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:22,976 INFO L78 Accepts]: Start accepts. Automaton has currently 15108 states, but on-demand construction may add more states Word has length 481 [2024-05-30 14:22:22,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:22,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-05-30 14:22:22,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:22,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash 154813320, now seen corresponding path program 1 times [2024-05-30 14:22:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:22,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374332555] [2024-05-30 14:22:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:23,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:22:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:23,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:22:23,409 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:22:23,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:22:23,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-05-30 14:22:23,410 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:22:23,410 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/66) [2024-05-30 14:22:23,410 WARN L234 ceAbstractionStarter]: 64 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:22:23,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 65 thread instances. [2024-05-30 14:22:23,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:22:23,568 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:23,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:23,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:23,570 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:22:23,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (66)] Waiting until timeout for monitored process [2024-05-30 14:22:23,594 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:23,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:22:23,594 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:23,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:23,594 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:45,326 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 15569 states. [2024-05-30 14:22:45,326 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:45,326 INFO L78 Accepts]: Start accepts. Automaton has currently 15635 states, but on-demand construction may add more states Word has length 489 [2024-05-30 14:22:45,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:45,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:45,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -952061784, now seen corresponding path program 1 times [2024-05-30 14:22:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293275052] [2024-05-30 14:22:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14885 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14885 trivial. 0 not checked. [2024-05-30 14:22:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293275052] [2024-05-30 14:22:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293275052] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:22:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576140292] [2024-05-30 14:22:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:22:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:22:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:22:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:45,451 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:45,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:22:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:45,452 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:45,539 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 15570 states. [2024-05-30 14:22:45,539 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:45,539 INFO L78 Accepts]: Start accepts. Automaton has currently 15571 states, but on-demand construction may add more states Word has length 488 [2024-05-30 14:22:45,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-05-30 14:22:45,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:45,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1807412591, now seen corresponding path program 1 times [2024-05-30 14:22:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741896536] [2024-05-30 14:22:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:45,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:22:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:45,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:22:45,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:22:45,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:22:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-05-30 14:22:45,890 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:22:45,890 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/67) [2024-05-30 14:22:45,890 WARN L234 ceAbstractionStarter]: 65 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:22:45,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 66 thread instances. [2024-05-30 14:22:46,047 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:22:46,065 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:46,070 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:22:46,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (67)] Waiting until timeout for monitored process [2024-05-30 14:22:46,093 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:46,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:22:46,093 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:46,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:46,093 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:58,277 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 16039 states. [2024-05-30 14:22:58,277 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:58,277 INFO L78 Accepts]: Start accepts. Automaton has currently 16106 states, but on-demand construction may add more states Word has length 496 [2024-05-30 14:22:58,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:58,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:58,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1301031678, now seen corresponding path program 1 times [2024-05-30 14:22:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506093792] [2024-05-30 14:22:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15345 trivial. 0 not checked. [2024-05-30 14:22:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506093792] [2024-05-30 14:22:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506093792] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:58,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:22:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970176031] [2024-05-30 14:22:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:58,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:22:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:22:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:22:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:58,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:58,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:22:58,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:58,394 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:58,501 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 16040 states. [2024-05-30 14:22:58,501 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:58,502 INFO L78 Accepts]: Start accepts. Automaton has currently 16041 states, but on-demand construction may add more states Word has length 495 [2024-05-30 14:22:58,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-05-30 14:22:58,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:22:58,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash -628214488, now seen corresponding path program 1 times [2024-05-30 14:22:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894682162] [2024-05-30 14:22:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:58,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:22:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:22:58,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:22:58,852 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:22:58,853 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:22:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-05-30 14:22:58,853 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:22:58,853 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/68) [2024-05-30 14:22:58,853 WARN L234 ceAbstractionStarter]: 66 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:22:58,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 67 thread instances. [2024-05-30 14:22:59,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:22:59,054 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:59,056 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:22:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (68)] Waiting until timeout for monitored process [2024-05-30 14:22:59,062 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:59,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:22:59,063 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:59,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:59,063 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:19,551 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 16516 states. [2024-05-30 14:23:19,551 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:23:19,552 INFO L78 Accepts]: Start accepts. Automaton has currently 16584 states, but on-demand construction may add more states Word has length 503 [2024-05-30 14:23:19,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:19,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:23:19,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 643249194, now seen corresponding path program 1 times [2024-05-30 14:23:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212779600] [2024-05-30 14:23:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:23:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15812 trivial. 0 not checked. [2024-05-30 14:23:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:23:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212779600] [2024-05-30 14:23:19,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212779600] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:23:19,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:23:19,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:23:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812389210] [2024-05-30 14:23:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:23:19,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:23:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:23:19,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:23:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:23:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:19,676 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:23:19,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:23:19,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:19,677 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:19,773 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 16517 states. [2024-05-30 14:23:19,773 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:23:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:19,773 INFO L78 Accepts]: Start accepts. Automaton has currently 16518 states, but on-demand construction may add more states Word has length 502 [2024-05-30 14:23:19,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:19,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-05-30 14:23:19,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:23:19,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash -324518034, now seen corresponding path program 1 times [2024-05-30 14:23:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:19,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799559733] [2024-05-30 14:23:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:23:19,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:23:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:23:20,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:23:20,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:23:20,143 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:23:20,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-05-30 14:23:20,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:23:20,144 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/69) [2024-05-30 14:23:20,144 WARN L234 ceAbstractionStarter]: 67 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:23:20,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 68 thread instances. [2024-05-30 14:23:20,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:23:20,458 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:23:20,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:23:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:23:20,468 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:23:20,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (69)] Waiting until timeout for monitored process [2024-05-30 14:23:20,484 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:23:20,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:23:20,484 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:23:20,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:23:20,485 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:38,484 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17000 states. [2024-05-30 14:23:38,485 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:23:38,485 INFO L78 Accepts]: Start accepts. Automaton has currently 17069 states, but on-demand construction may add more states Word has length 510 [2024-05-30 14:23:38,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:38,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:23:38,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2022217277, now seen corresponding path program 1 times [2024-05-30 14:23:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:38,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639710847] [2024-05-30 14:23:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:23:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16286 trivial. 0 not checked. [2024-05-30 14:23:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:23:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639710847] [2024-05-30 14:23:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639710847] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:23:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:23:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:23:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082459543] [2024-05-30 14:23:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:23:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:23:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:23:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:23:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:23:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:38,601 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:23:38,601 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-05-30 14:23:38,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:38,602 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:38,708 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17001 states. [2024-05-30 14:23:38,708 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:23:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:38,709 INFO L78 Accepts]: Start accepts. Automaton has currently 17002 states, but on-demand construction may add more states Word has length 509 [2024-05-30 14:23:38,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:38,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-05-30 14:23:38,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:23:38,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash 753762956, now seen corresponding path program 1 times [2024-05-30 14:23:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66615028] [2024-05-30 14:23:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:23:38,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:23:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:23:39,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:23:39,077 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:23:39,077 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:23:39,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-05-30 14:23:39,078 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:23:39,078 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/70) [2024-05-30 14:23:39,078 WARN L234 ceAbstractionStarter]: 68 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:23:39,078 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 69 thread instances. [2024-05-30 14:23:39,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:23:39,266 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:23:39,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:23:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:23:39,269 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:23:39,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (70)] Waiting until timeout for monitored process [2024-05-30 14:23:39,292 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:23:39,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:23:39,293 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:23:39,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:23:39,293 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:14,476 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17491 states. [2024-05-30 14:24:14,476 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:14,476 INFO L78 Accepts]: Start accepts. Automaton has currently 17561 states, but on-demand construction may add more states Word has length 517 [2024-05-30 14:24:14,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:14,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:14,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:14,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1537264144, now seen corresponding path program 1 times [2024-05-30 14:24:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:14,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532390938] [2024-05-30 14:24:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:14,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16767 trivial. 0 not checked. [2024-05-30 14:24:14,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532390938] [2024-05-30 14:24:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532390938] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:24:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291623391] [2024-05-30 14:24:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:24:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:24:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:24:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:14,609 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:14,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:24:14,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:14,609 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:14,711 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17492 states. [2024-05-30 14:24:14,711 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:14,712 INFO L78 Accepts]: Start accepts. Automaton has currently 17493 states, but on-demand construction may add more states Word has length 516 [2024-05-30 14:24:14,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:14,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-05-30 14:24:14,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:14,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1266500525, now seen corresponding path program 1 times [2024-05-30 14:24:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:14,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202463112] [2024-05-30 14:24:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:14,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:24:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:15,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:24:15,195 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:24:15,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:24:15,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-05-30 14:24:15,196 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:24:15,197 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/71) [2024-05-30 14:24:15,197 WARN L234 ceAbstractionStarter]: 69 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:24:15,197 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 70 thread instances. [2024-05-30 14:24:15,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:24:15,393 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:15,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:24:15,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:24:15,396 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:24:15,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (71)] Waiting until timeout for monitored process [2024-05-30 14:24:15,419 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:24:15,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:24:15,419 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:15,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:24:15,420 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:29,430 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17989 states. [2024-05-30 14:24:29,430 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:29,430 INFO L78 Accepts]: Start accepts. Automaton has currently 18060 states, but on-demand construction may add more states Word has length 524 [2024-05-30 14:24:29,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:29,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:29,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 880490812, now seen corresponding path program 1 times [2024-05-30 14:24:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198150223] [2024-05-30 14:24:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 17255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17255 trivial. 0 not checked. [2024-05-30 14:24:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198150223] [2024-05-30 14:24:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198150223] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:24:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199894399] [2024-05-30 14:24:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:29,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:24:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:24:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:24:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:29,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:29,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:24:29,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:29,563 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:29,675 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 17990 states. [2024-05-30 14:24:29,675 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:29,675 INFO L78 Accepts]: Start accepts. Automaton has currently 17991 states, but on-demand construction may add more states Word has length 523 [2024-05-30 14:24:29,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:29,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-05-30 14:24:29,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:29,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1507731148, now seen corresponding path program 1 times [2024-05-30 14:24:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:29,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722570953] [2024-05-30 14:24:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:29,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:24:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:30,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:24:30,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:24:30,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:24:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-05-30 14:24:30,137 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:24:30,137 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/72) [2024-05-30 14:24:30,137 WARN L234 ceAbstractionStarter]: 70 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:24:30,137 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 71 thread instances. [2024-05-30 14:24:30,352 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:24:30,363 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:24:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:24:30,366 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:24:30,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (72)] Waiting until timeout for monitored process [2024-05-30 14:24:30,387 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:24:30,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:24:30,388 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:30,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:24:30,388 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:51,978 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 18494 states. [2024-05-30 14:24:51,978 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:51,978 INFO L78 Accepts]: Start accepts. Automaton has currently 18566 states, but on-demand construction may add more states Word has length 531 [2024-05-30 14:24:51,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:51,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:51,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash 78451578, now seen corresponding path program 1 times [2024-05-30 14:24:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400079250] [2024-05-30 14:24:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17750 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17750 trivial. 0 not checked. [2024-05-30 14:24:52,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400079250] [2024-05-30 14:24:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400079250] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:52,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:24:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424713207] [2024-05-30 14:24:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:24:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:24:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:24:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:52,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:24:52,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:52,131 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:52,240 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 18495 states. [2024-05-30 14:24:52,240 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:52,241 INFO L78 Accepts]: Start accepts. Automaton has currently 18496 states, but on-demand construction may add more states Word has length 530 [2024-05-30 14:24:52,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:52,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-05-30 14:24:52,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:24:52,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1914049364, now seen corresponding path program 1 times [2024-05-30 14:24:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378169834] [2024-05-30 14:24:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:52,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:24:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:24:52,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:24:52,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:24:52,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:24:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-05-30 14:24:52,741 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:24:52,741 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/73) [2024-05-30 14:24:52,741 WARN L234 ceAbstractionStarter]: 71 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:24:52,741 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 72 thread instances. [2024-05-30 14:24:52,928 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:24:52,938 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:24:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:24:52,942 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:24:52,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (73)] Waiting until timeout for monitored process [2024-05-30 14:24:52,962 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:24:52,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:24:52,962 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:52,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:24:52,963 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:29,476 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 19006 states. [2024-05-30 14:25:29,476 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:25:29,476 INFO L78 Accepts]: Start accepts. Automaton has currently 19079 states, but on-demand construction may add more states Word has length 538 [2024-05-30 14:25:29,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:25:29,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:25:29,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:25:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 100750971, now seen corresponding path program 1 times [2024-05-30 14:25:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:25:29,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611319199] [2024-05-30 14:25:29,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:25:29,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:25:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:25:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18252 trivial. 0 not checked. [2024-05-30 14:25:29,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:25:29,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611319199] [2024-05-30 14:25:29,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611319199] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:25:29,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:25:29,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:25:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675638641] [2024-05-30 14:25:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:25:29,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:25:29,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:25:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:25:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:25:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:29,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:25:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 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-05-30 14:25:29,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:29,724 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:29,832 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 19007 states. [2024-05-30 14:25:29,832 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:25:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:25:29,833 INFO L78 Accepts]: Start accepts. Automaton has currently 19008 states, but on-demand construction may add more states Word has length 537 [2024-05-30 14:25:29,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:25:29,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-05-30 14:25:29,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:25:29,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:25:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 93693600, now seen corresponding path program 1 times [2024-05-30 14:25:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:25:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925738291] [2024-05-30 14:25:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:25:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:25:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:25:29,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:25:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:25:30,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:25:30,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:25:30,239 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:25:30,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-05-30 14:25:30,239 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:25:30,239 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/74) [2024-05-30 14:25:30,239 WARN L234 ceAbstractionStarter]: 72 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:25:30,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 73 thread instances. [2024-05-30 14:25:30,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:25:30,420 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:25:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:25:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:25:30,423 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:25:30,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (74)] Waiting until timeout for monitored process [2024-05-30 14:25:30,445 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:25:30,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:25:30,446 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:25:30,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:25:30,446 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:04,931 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 19525 states. [2024-05-30 14:26:04,932 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:04,932 INFO L78 Accepts]: Start accepts. Automaton has currently 19599 states, but on-demand construction may add more states Word has length 545 [2024-05-30 14:26:04,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:04,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:04,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:04,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1400509880, now seen corresponding path program 1 times [2024-05-30 14:26:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:04,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946070903] [2024-05-30 14:26:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:04,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:26:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18761 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18761 trivial. 0 not checked. [2024-05-30 14:26:05,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:26:05,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946070903] [2024-05-30 14:26:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946070903] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:26:05,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:26:05,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:26:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116489635] [2024-05-30 14:26:05,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:26:05,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:26:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:26:05,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:26:05,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:26:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:05,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:26:05,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:26:05,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:05,188 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:05,293 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 19526 states. [2024-05-30 14:26:05,293 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:05,294 INFO L78 Accepts]: Start accepts. Automaton has currently 19527 states, but on-demand construction may add more states Word has length 544 [2024-05-30 14:26:05,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-05-30 14:26:05,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:05,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -350917397, now seen corresponding path program 1 times [2024-05-30 14:26:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703785397] [2024-05-30 14:26:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:05,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:26:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:05,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:26:05,762 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:26:05,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:26:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-05-30 14:26:05,763 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:26:05,763 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/75) [2024-05-30 14:26:05,763 WARN L234 ceAbstractionStarter]: 73 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:26:05,763 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 74 thread instances. [2024-05-30 14:26:06,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:26:06,108 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:26:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:26:06,110 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:26:06,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (75)] Waiting until timeout for monitored process [2024-05-30 14:26:06,133 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:26:06,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:26:06,133 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:06,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:26:06,133 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:27,065 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 20051 states. [2024-05-30 14:26:27,066 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:27,066 INFO L78 Accepts]: Start accepts. Automaton has currently 20126 states, but on-demand construction may add more states Word has length 552 [2024-05-30 14:26:27,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:27,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:27,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 677343354, now seen corresponding path program 1 times [2024-05-30 14:26:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028408833] [2024-05-30 14:26:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:26:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19277 trivial. 0 not checked. [2024-05-30 14:26:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:26:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028408833] [2024-05-30 14:26:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028408833] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:26:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:26:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:26:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051977843] [2024-05-30 14:26:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:26:27,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:26:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:26:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:26:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:26:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:27,218 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:26:27,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:26:27,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:27,218 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:27,331 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 20052 states. [2024-05-30 14:26:27,332 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:27,332 INFO L78 Accepts]: Start accepts. Automaton has currently 20053 states, but on-demand construction may add more states Word has length 551 [2024-05-30 14:26:27,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-05-30 14:26:27,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 497293392, now seen corresponding path program 1 times [2024-05-30 14:26:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424476347] [2024-05-30 14:26:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:27,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:26:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:27,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:26:27,936 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:26:27,936 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:26:27,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-05-30 14:26:27,937 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:26:27,937 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/76) [2024-05-30 14:26:27,937 WARN L234 ceAbstractionStarter]: 74 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:26:27,937 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 75 thread instances. [2024-05-30 14:26:28,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:26:28,109 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:26:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:26:28,111 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:26:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (76)] Waiting until timeout for monitored process [2024-05-30 14:26:28,135 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:26:28,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:26:28,135 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:28,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:26:28,135 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:52,837 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 20584 states. [2024-05-30 14:26:52,837 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:52,838 INFO L78 Accepts]: Start accepts. Automaton has currently 20660 states, but on-demand construction may add more states Word has length 559 [2024-05-30 14:26:52,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:52,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:52,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1634703322, now seen corresponding path program 1 times [2024-05-30 14:26:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674217371] [2024-05-30 14:26:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:26:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2024-05-30 14:26:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:26:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674217371] [2024-05-30 14:26:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674217371] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:26:52,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:26:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:26:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730031006] [2024-05-30 14:26:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:26:52,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:26:52,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:26:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:26:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:26:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:52,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:26:52,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:26:52,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:52,987 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:26:53,092 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 20585 states. [2024-05-30 14:26:53,092 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:26:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:26:53,093 INFO L78 Accepts]: Start accepts. Automaton has currently 20586 states, but on-demand construction may add more states Word has length 558 [2024-05-30 14:26:53,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:26:53,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-05-30 14:26:53,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:26:53,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:26:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -481413398, now seen corresponding path program 1 times [2024-05-30 14:26:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:26:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916347438] [2024-05-30 14:26:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:26:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:26:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:53,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:26:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:26:53,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:26:53,537 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:26:53,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:26:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-05-30 14:26:53,538 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:26:53,538 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/77) [2024-05-30 14:26:53,538 WARN L234 ceAbstractionStarter]: 75 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:26:53,538 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 76 thread instances. [2024-05-30 14:26:53,710 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:26:53,721 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:26:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:26:53,728 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:26:53,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (77)] Waiting until timeout for monitored process [2024-05-30 14:26:53,764 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:26:53,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:26:53,765 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:26:53,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:26:53,765 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:27:20,616 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 21124 states. [2024-05-30 14:27:20,616 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:27:20,616 INFO L78 Accepts]: Start accepts. Automaton has currently 21201 states, but on-demand construction may add more states Word has length 566 [2024-05-30 14:27:20,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:27:20,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:27:20,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:27:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 540101049, now seen corresponding path program 1 times [2024-05-30 14:27:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:27:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554052018] [2024-05-30 14:27:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:27:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:27:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:27:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20330 trivial. 0 not checked. [2024-05-30 14:27:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:27:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554052018] [2024-05-30 14:27:20,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554052018] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:27:20,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:27:20,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:27:20,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173300183] [2024-05-30 14:27:20,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:27:20,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:27:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:27:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:27:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:27:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:27:20,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:27:20,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:27:20,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:27:20,768 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:27:20,884 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 21125 states. [2024-05-30 14:27:20,884 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:27:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:27:20,884 INFO L78 Accepts]: Start accepts. Automaton has currently 21126 states, but on-demand construction may add more states Word has length 565 [2024-05-30 14:27:20,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:27:20,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-05-30 14:27:20,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:27:20,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:27:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1256790980, now seen corresponding path program 1 times [2024-05-30 14:27:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:27:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124814457] [2024-05-30 14:27:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:27:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:27:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:27:21,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:27:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:27:21,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:27:21,631 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:27:21,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:27:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-05-30 14:27:21,632 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:27:21,632 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/78) [2024-05-30 14:27:21,632 WARN L234 ceAbstractionStarter]: 76 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:27:21,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 77 thread instances. [2024-05-30 14:27:21,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:27:21,880 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:27:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:27:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:27:21,883 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:27:21,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (78)] Waiting until timeout for monitored process [2024-05-30 14:27:21,908 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:27:21,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:27:21,909 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:27:21,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:27:21,909 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:28:01,114 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 21671 states. [2024-05-30 14:28:01,114 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:28:01,115 INFO L78 Accepts]: Start accepts. Automaton has currently 21749 states, but on-demand construction may add more states Word has length 573 [2024-05-30 14:28:01,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:28:01,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:28:01,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:28:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash 92322224, now seen corresponding path program 1 times [2024-05-30 14:28:01,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:28:01,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936955734] [2024-05-30 14:28:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:28:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:28:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:28:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20867 trivial. 0 not checked. [2024-05-30 14:28:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:28:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936955734] [2024-05-30 14:28:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936955734] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:28:01,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:28:01,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:28:01,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463747703] [2024-05-30 14:28:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:28:01,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:28:01,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:28:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:28:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:28:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:01,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:28:01,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:28:01,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:01,302 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:28:01,433 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 21672 states. [2024-05-30 14:28:01,433 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:28:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:01,433 INFO L78 Accepts]: Start accepts. Automaton has currently 21673 states, but on-demand construction may add more states Word has length 572 [2024-05-30 14:28:01,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:28:01,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-05-30 14:28:01,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:28:01,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:28:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1715864279, now seen corresponding path program 1 times [2024-05-30 14:28:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:28:01,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430353519] [2024-05-30 14:28:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:28:01,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:28:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:28:01,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:28:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:28:02,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:28:02,047 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:28:02,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:28:02,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-05-30 14:28:02,048 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:28:02,048 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/79) [2024-05-30 14:28:02,048 WARN L234 ceAbstractionStarter]: 77 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:28:02,048 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 78 thread instances. [2024-05-30 14:28:02,217 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:28:02,226 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:28:02,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:28:02,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:28:02,228 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:28:02,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (79)] Waiting until timeout for monitored process [2024-05-30 14:28:02,250 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:28:02,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:28:02,251 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:28:02,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:28:02,251 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:28:41,022 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 22225 states. [2024-05-30 14:28:41,022 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:28:41,022 INFO L78 Accepts]: Start accepts. Automaton has currently 22304 states, but on-demand construction may add more states Word has length 580 [2024-05-30 14:28:41,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:28:41,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:28:41,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:28:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 270132408, now seen corresponding path program 1 times [2024-05-30 14:28:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:28:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519526206] [2024-05-30 14:28:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:28:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:28:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:28:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21411 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21411 trivial. 0 not checked. [2024-05-30 14:28:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:28:41,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519526206] [2024-05-30 14:28:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519526206] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:28:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:28:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:28:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896640605] [2024-05-30 14:28:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:28:41,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:28:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:28:41,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:28:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:28:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:41,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:28:41,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:28:41,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:41,194 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:28:41,337 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 22226 states. [2024-05-30 14:28:41,337 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:28:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:28:41,337 INFO L78 Accepts]: Start accepts. Automaton has currently 22227 states, but on-demand construction may add more states Word has length 579 [2024-05-30 14:28:41,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:28:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-05-30 14:28:41,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:28:41,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:28:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -376349060, now seen corresponding path program 1 times [2024-05-30 14:28:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:28:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673988858] [2024-05-30 14:28:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:28:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:28:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:28:41,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:28:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:28:42,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:28:42,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:28:42,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:28:42,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-05-30 14:28:42,190 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:28:42,191 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/80) [2024-05-30 14:28:42,191 WARN L234 ceAbstractionStarter]: 78 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:28:42,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 79 thread instances. [2024-05-30 14:28:42,395 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:28:42,407 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:28:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:28:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:28:42,412 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:28:42,604 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:28:42,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:28:42,604 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:28:42,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:28:42,604 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:28:42,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (80)] Waiting until timeout for monitored process [2024-05-30 14:29:12,433 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 22786 states. [2024-05-30 14:29:12,433 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:29:12,433 INFO L78 Accepts]: Start accepts. Automaton has currently 22866 states, but on-demand construction may add more states Word has length 587 [2024-05-30 14:29:12,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:29:12,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:29:12,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:29:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -776950454, now seen corresponding path program 1 times [2024-05-30 14:29:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:29:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607975924] [2024-05-30 14:29:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:29:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:29:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:29:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21962 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21962 trivial. 0 not checked. [2024-05-30 14:29:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:29:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607975924] [2024-05-30 14:29:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607975924] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:29:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:29:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:29:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938648753] [2024-05-30 14:29:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:29:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:29:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:29:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:29:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:29:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:29:12,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:29:12,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:29:12,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:29:12,593 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:29:12,701 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 22787 states. [2024-05-30 14:29:12,701 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:29:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:29:12,702 INFO L78 Accepts]: Start accepts. Automaton has currently 22788 states, but on-demand construction may add more states Word has length 586 [2024-05-30 14:29:12,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:29:12,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-05-30 14:29:12,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:29:12,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:29:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash -268062168, now seen corresponding path program 1 times [2024-05-30 14:29:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:29:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580827351] [2024-05-30 14:29:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:29:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:29:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:29:12,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:29:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:29:13,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:29:13,206 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:29:13,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:29:13,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-05-30 14:29:13,207 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:29:13,207 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/81) [2024-05-30 14:29:13,207 WARN L234 ceAbstractionStarter]: 79 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:29:13,207 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 80 thread instances. [2024-05-30 14:29:13,377 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:29:13,386 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:29:13,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:29:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:29:13,388 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:29:13,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (81)] Waiting until timeout for monitored process [2024-05-30 14:29:13,411 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:29:13,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:29:13,412 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:29:13,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:29:13,412 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:30:02,610 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23354 states. [2024-05-30 14:30:02,610 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:30:02,610 INFO L78 Accepts]: Start accepts. Automaton has currently 23435 states, but on-demand construction may add more states Word has length 594 [2024-05-30 14:30:02,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:30:02,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:30:02,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:30:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1332970487, now seen corresponding path program 1 times [2024-05-30 14:30:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:30:02,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956666701] [2024-05-30 14:30:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:30:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:30:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:30:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22520 trivial. 0 not checked. [2024-05-30 14:30:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:30:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956666701] [2024-05-30 14:30:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956666701] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:30:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:30:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:30:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562293115] [2024-05-30 14:30:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:30:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:30:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:30:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:30:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:30:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:02,799 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:30:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:30:02,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:02,799 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:30:02,942 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23355 states. [2024-05-30 14:30:02,942 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:30:02,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:02,942 INFO L78 Accepts]: Start accepts. Automaton has currently 23356 states, but on-demand construction may add more states Word has length 593 [2024-05-30 14:30:02,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:30:02,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-05-30 14:30:02,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:30:02,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:30:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1219120632, now seen corresponding path program 1 times [2024-05-30 14:30:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:30:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476858223] [2024-05-30 14:30:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:30:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:30:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:30:03,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:30:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:30:03,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:30:03,556 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:30:03,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:30:03,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-05-30 14:30:03,557 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:30:03,557 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/82) [2024-05-30 14:30:03,557 WARN L234 ceAbstractionStarter]: 80 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:30:03,557 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 81 thread instances. [2024-05-30 14:30:03,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:30:03,754 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:30:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:30:03,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:30:03,789 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:30:03,970 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:30:03,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:30:03,971 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:30:03,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:30:03,971 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:30:03,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (82)] Waiting until timeout for monitored process [2024-05-30 14:30:33,343 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23929 states. [2024-05-30 14:30:33,344 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:30:33,344 INFO L78 Accepts]: Start accepts. Automaton has currently 24011 states, but on-demand construction may add more states Word has length 601 [2024-05-30 14:30:33,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:30:33,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:30:33,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:30:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1910009816, now seen corresponding path program 1 times [2024-05-30 14:30:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:30:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925521738] [2024-05-30 14:30:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:30:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:30:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:30:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23085 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23085 trivial. 0 not checked. [2024-05-30 14:30:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:30:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925521738] [2024-05-30 14:30:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925521738] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:30:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:30:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:30:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241975965] [2024-05-30 14:30:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:30:33,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:30:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:30:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:30:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:30:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:33,526 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:30:33,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:30:33,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:33,526 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:30:33,648 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23930 states. [2024-05-30 14:30:33,648 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:30:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:30:33,649 INFO L78 Accepts]: Start accepts. Automaton has currently 23931 states, but on-demand construction may add more states Word has length 600 [2024-05-30 14:30:33,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:30:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-05-30 14:30:33,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:30:33,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:30:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -468350873, now seen corresponding path program 1 times [2024-05-30 14:30:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:30:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923510942] [2024-05-30 14:30:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:30:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:30:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:30:33,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:30:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:30:34,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:30:34,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:30:34,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:30:34,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-05-30 14:30:34,203 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:30:34,203 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/83) [2024-05-30 14:30:34,203 WARN L234 ceAbstractionStarter]: 81 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:30:34,203 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 82 thread instances. [2024-05-30 14:30:34,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:30:34,661 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:30:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:30:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:30:34,668 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:30:34,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (83)] Waiting until timeout for monitored process [2024-05-30 14:30:34,688 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:30:34,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:30:34,688 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:30:34,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:30:34,689 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:31:19,569 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 24511 states. [2024-05-30 14:31:19,569 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:31:19,569 INFO L78 Accepts]: Start accepts. Automaton has currently 24594 states, but on-demand construction may add more states Word has length 608 [2024-05-30 14:31:19,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:31:19,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:31:19,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:31:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1023432202, now seen corresponding path program 1 times [2024-05-30 14:31:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:31:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754715586] [2024-05-30 14:31:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:31:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:31:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:31:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23657 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23657 trivial. 0 not checked. [2024-05-30 14:31:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:31:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754715586] [2024-05-30 14:31:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754715586] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:31:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:31:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:31:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074635002] [2024-05-30 14:31:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:31:19,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:31:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:31:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:31:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:31:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:31:19,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:31:19,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:31:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:31:19,909 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:31:20,067 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 24512 states. [2024-05-30 14:31:20,067 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:31:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:31:20,068 INFO L78 Accepts]: Start accepts. Automaton has currently 24513 states, but on-demand construction may add more states Word has length 607 [2024-05-30 14:31:20,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:31:20,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-05-30 14:31:20,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-30 14:31:20,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:31:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1687021640, now seen corresponding path program 1 times [2024-05-30 14:31:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:31:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969533557] [2024-05-30 14:31:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:31:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:31:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:31:20,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:31:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:31:21,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:31:21,109 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:31:21,109 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:31:21,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-05-30 14:31:21,110 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:31:21,110 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was UNSAFE (1/84) [2024-05-30 14:31:21,110 WARN L234 ceAbstractionStarter]: 82 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-30 14:31:21,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 83 thread instances. [2024-05-30 14:31:21,343 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 14:31:21,356 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:31:21,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:31:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:31:21,360 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 14:31:21,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (84)] Waiting until timeout for monitored process [2024-05-30 14:31:21,383 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:31:21,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 14:31:21,384 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=LoopsAndPotentialCycles, 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;@423d4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:31:21,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:31:21,384 INFO L199 cStratifiedReduction]: Start building reduction automaton Received shutdown request... [2024-05-30 14:32:04,151 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,152 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,152 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (35)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,151 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (66)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (83)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (49)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (81)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (71)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (84)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,153 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (82)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (77)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (31)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (74)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (72)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (62)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (78)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (68)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (79)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (61)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (53)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (54)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (76)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (50)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (75)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (42)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (58)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (56)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (70)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (40)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (33)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (67)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (69)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (52)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (45)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (43)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (57)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (63)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (37)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (41)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (38)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (64)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (80)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (73)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (55)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (60)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (65)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (51)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 14:32:04,263 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23766 states. [2024-05-30 14:32:04,263 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:32:04,263 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-05-30 14:32:04,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 14:32:04,264 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 14:32:04,264 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was TIMEOUT (1/85) [2024-05-30 14:32:04,265 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 83 thread instances [2024-05-30 14:32:04,265 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 14:32:04,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 02:32:04 BasicIcfg [2024-05-30 14:32:04,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 14:32:04,279 INFO L158 Benchmark]: Toolchain (without parser) took 800055.75ms. Allocated memory was 302.0MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 230.7MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-05-30 14:32:04,279 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory was 142.9MB in the beginning and 142.9MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 14:32:04,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.46ms. Allocated memory is still 302.0MB. Free memory was 230.3MB in the beginning and 201.6MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-05-30 14:32:04,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.07ms. Allocated memory is still 302.0MB. Free memory was 201.6MB in the beginning and 199.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 14:32:04,279 INFO L158 Benchmark]: Boogie Preprocessor took 22.33ms. Allocated memory is still 302.0MB. Free memory was 199.2MB in the beginning and 197.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 14:32:04,280 INFO L158 Benchmark]: RCFGBuilder took 379.61ms. Allocated memory is still 302.0MB. Free memory was 197.4MB in the beginning and 254.2MB in the end (delta: -56.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2024-05-30 14:32:04,280 INFO L158 Benchmark]: TraceAbstraction took 798987.33ms. Allocated memory was 302.0MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 253.2MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-05-30 14:32:04,280 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.15ms. Allocated memory is still 174.1MB. Free memory was 142.9MB in the beginning and 142.9MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 600.46ms. Allocated memory is still 302.0MB. Free memory was 230.3MB in the beginning and 201.6MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.07ms. Allocated memory is still 302.0MB. Free memory was 201.6MB in the beginning and 199.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.33ms. Allocated memory is still 302.0MB. Free memory was 199.2MB in the beginning and 197.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.61ms. Allocated memory is still 302.0MB. Free memory was 197.4MB in the beginning and 254.2MB in the end (delta: -56.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * TraceAbstraction took 798987.33ms. Allocated memory was 302.0MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 253.2MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 23.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 49, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 25.5ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 50, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 42, Transitions: 41, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 42, Transitions: 42, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 10.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 71, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 31.9ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 72, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 49, Transitions: 48, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 49, Transitions: 49, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 16.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 100, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 36.5ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 101, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 56, Transitions: 55, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 56, Transitions: 56, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 17.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 38.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 137, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 63, Transitions: 62, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 63, Transitions: 63, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 22.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 179, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 22.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 180, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 70, Transitions: 69, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 70, Transitions: 70, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 28.2ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 229, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 23.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 230, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 77, Transitions: 76, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 77, Transitions: 77, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 18.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 286, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 26.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 287, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 84, Transitions: 83, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 84, Transitions: 84, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 19.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 350, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 27.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 351, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 91, Transitions: 90, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 91, Transitions: 91, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 26.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 421, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 39.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 422, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 98, Transitions: 97, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 98, Transitions: 98, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 22.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 499, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 31.5ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 500, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 105, Transitions: 104, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 105, Transitions: 105, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 33.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 584, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 32.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 585, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 112, Transitions: 111, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 112, Transitions: 112, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 36.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 676, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 28.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 677, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 119, Transitions: 118, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 119, Transitions: 119, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 43.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 775, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 33.9ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 776, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 126, Transitions: 125, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 126, Transitions: 126, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 53.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 881, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 31.4ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 882, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 133, Transitions: 132, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 133, Transitions: 133, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 68.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 994, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 32.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 995, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 140, Transitions: 139, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 140, Transitions: 140, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 89.0ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1114, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 34.2ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1115, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 147, Transitions: 146, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 147, Transitions: 147, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 93.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1241, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 40.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1242, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 154, Transitions: 153, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 154, Transitions: 154, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 79.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1375, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 37.5ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1376, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 161, Transitions: 160, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 161, Transitions: 161, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 135.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1516, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 37.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1517, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 168, Transitions: 167, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 168, Transitions: 168, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 207.2ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1664, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 41.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1665, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 175, Transitions: 174, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 175, Transitions: 175, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 213.0ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1819, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 41.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1820, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 182, Transitions: 181, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 182, Transitions: 182, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 218.2ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1981, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 47.0ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1982, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 189, Transitions: 188, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 189, Transitions: 189, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 264.7ms Time before loop, 0.0ms Time in loop, 0.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2150, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 43.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2151, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 196, Transitions: 195, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 196, Transitions: 196, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 203.7ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2326, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 45.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2327, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 203, Transitions: 202, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 203, Transitions: 203, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 307.5ms Time before loop, 0.0ms Time in loop, 0.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2509, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 45.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2510, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 210, Transitions: 209, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 210, Transitions: 210, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 441.6ms Time before loop, 0.0ms Time in loop, 0.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2699, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 47.9ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2700, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 217, Transitions: 216, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 217, Transitions: 217, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 607.0ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2896, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 48.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2897, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 224, Transitions: 223, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 224, Transitions: 224, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 569.9ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3100, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 51.0ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3101, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 231, Transitions: 230, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 231, Transitions: 231, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 672.4ms Time before loop, 0.0ms Time in loop, 0.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3311, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 48.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3312, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 238, Transitions: 237, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 238, Transitions: 238, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 552.3ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3529, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 50.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3530, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 245, Transitions: 244, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 245, Transitions: 245, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 507.6ms Time before loop, 0.0ms Time in loop, 0.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3754, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 50.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3755, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 252, Transitions: 251, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 252, Transitions: 252, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 456.7ms Time before loop, 0.0ms Time in loop, 0.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3986, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 58.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3987, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 259, Transitions: 258, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 259, Transitions: 259, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 1054.1ms Time before loop, 0.0ms Time in loop, 1.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4225, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 56.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4226, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 266, Transitions: 265, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 266, Transitions: 266, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 547.9ms Time before loop, 0.0ms Time in loop, 0.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4471, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 59.1ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4472, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 273, Transitions: 272, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 273, Transitions: 273, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 878.9ms Time before loop, 0.0ms Time in loop, 0.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4724, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 58.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4725, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 280, Transitions: 279, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 280, Transitions: 280, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 1172.5ms Time before loop, 0.0ms Time in loop, 1.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4984, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 65.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4985, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 287, Transitions: 286, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 287, Transitions: 287, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 858.7ms Time before loop, 0.0ms Time in loop, 0.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5251, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 57.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5252, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 294, Transitions: 293, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 294, Transitions: 294, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 1971.1ms Time before loop, 0.0ms Time in loop, 2.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5525, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 66.0ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5526, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 301, Transitions: 300, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 301, Transitions: 301, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 1263.9ms Time before loop, 0.0ms Time in loop, 1.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5806, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 64.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5807, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 308, Transitions: 307, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 308, Transitions: 308, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 2596.0ms Time before loop, 0.0ms Time in loop, 2.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6094, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 65.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6095, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 315, Transitions: 314, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 315, Transitions: 315, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 1629.5ms Time before loop, 0.0ms Time in loop, 1.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6389, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 225.5ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6390, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 322, Transitions: 321, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 322, Transitions: 322, Traversal time: 0.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 2820.9ms Time before loop, 0.0ms Time in loop, 2.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6691, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 70.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 6692, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 329, Transitions: 328, Traversal time: 2.8s - StatisticsResult: Visitor Statistics States: 329, Transitions: 329, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 2559.1ms Time before loop, 0.0ms Time in loop, 2.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7000, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 68.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7001, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 336, Transitions: 335, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 336, Transitions: 336, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 3033.4ms Time before loop, 0.0ms Time in loop, 3.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7316, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 241.5ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7317, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 343, Transitions: 342, Traversal time: 3.0s - StatisticsResult: Visitor Statistics States: 343, Transitions: 343, Traversal time: 0.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 2517.0ms Time before loop, 0.0ms Time in loop, 2.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7639, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 75.1ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7640, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 350, Transitions: 349, Traversal time: 2.5s - StatisticsResult: Visitor Statistics States: 350, Transitions: 350, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 4955.8ms Time before loop, 0.0ms Time in loop, 5.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7969, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 77.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7970, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 357, Transitions: 356, Traversal time: 5.0s - StatisticsResult: Visitor Statistics States: 357, Transitions: 357, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 4370.8ms Time before loop, 0.0ms Time in loop, 4.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 8306, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 76.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 8307, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 364, Transitions: 363, Traversal time: 4.4s - StatisticsResult: Visitor Statistics States: 364, Transitions: 364, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 5517.9ms Time before loop, 0.0ms Time in loop, 5.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 8650, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 78.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 8651, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 371, Transitions: 370, Traversal time: 5.5s - StatisticsResult: Visitor Statistics States: 371, Transitions: 371, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 3454.5ms Time before loop, 0.0ms Time in loop, 3.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9001, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 70.0ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9002, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 378, Transitions: 377, Traversal time: 3.5s - StatisticsResult: Visitor Statistics States: 378, Transitions: 378, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 5776.6ms Time before loop, 0.0ms Time in loop, 5.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9359, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 81.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9360, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 385, Transitions: 384, Traversal time: 5.8s - StatisticsResult: Visitor Statistics States: 385, Transitions: 385, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 4856.1ms Time before loop, 0.0ms Time in loop, 4.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9724, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 85.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 9725, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 392, Transitions: 391, Traversal time: 4.9s - StatisticsResult: Visitor Statistics States: 392, Transitions: 392, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 5259.7ms Time before loop, 0.0ms Time in loop, 5.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10096, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 83.9ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10097, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 399, Transitions: 398, Traversal time: 5.3s - StatisticsResult: Visitor Statistics States: 399, Transitions: 399, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 6511.6ms Time before loop, 0.0ms Time in loop, 6.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10475, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 74.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10476, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 406, Transitions: 405, Traversal time: 6.5s - StatisticsResult: Visitor Statistics States: 406, Transitions: 406, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 3868.0ms Time before loop, 0.0ms Time in loop, 3.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10861, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 80.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10862, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 413, Transitions: 412, Traversal time: 3.9s - StatisticsResult: Visitor Statistics States: 413, Transitions: 413, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 10164.1ms Time before loop, 0.0ms Time in loop, 10.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 11254, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 127.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 11255, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 420, Transitions: 419, Traversal time: 10.2s - StatisticsResult: Visitor Statistics States: 420, Transitions: 420, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 12229.8ms Time before loop, 0.0ms Time in loop, 12.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 11654, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 76.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 11655, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 427, Transitions: 426, Traversal time: 12.2s - StatisticsResult: Visitor Statistics States: 427, Transitions: 427, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 8028.5ms Time before loop, 0.0ms Time in loop, 8.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12061, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 85.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12062, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 434, Transitions: 433, Traversal time: 8.0s - StatisticsResult: Visitor Statistics States: 434, Transitions: 434, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 8470.4ms Time before loop, 0.0ms Time in loop, 8.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12475, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 84.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12476, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 441, Transitions: 440, Traversal time: 8.5s - StatisticsResult: Visitor Statistics States: 441, Transitions: 441, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 12657.5ms Time before loop, 0.0ms Time in loop, 12.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12896, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 82.1ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 12897, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 448, Transitions: 447, Traversal time: 12.7s - StatisticsResult: Visitor Statistics States: 448, Transitions: 448, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 12480.5ms Time before loop, 0.0ms Time in loop, 12.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 13324, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 80.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 13325, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 455, Transitions: 454, Traversal time: 12.5s - StatisticsResult: Visitor Statistics States: 455, Transitions: 455, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 10922.7ms Time before loop, 0.0ms Time in loop, 10.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 13759, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 84.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 13760, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 462, Transitions: 461, Traversal time: 10.9s - StatisticsResult: Visitor Statistics States: 462, Transitions: 462, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 8118.4ms Time before loop, 0.0ms Time in loop, 8.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 14201, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 86.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 14202, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 469, Transitions: 468, Traversal time: 8.1s - StatisticsResult: Visitor Statistics States: 469, Transitions: 469, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 16406.7ms Time before loop, 0.0ms Time in loop, 16.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 14650, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 103.2ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 14651, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 476, Transitions: 475, Traversal time: 16.4s - StatisticsResult: Visitor Statistics States: 476, Transitions: 476, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 15955.2ms Time before loop, 0.0ms Time in loop, 16.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 15106, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 99.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 15107, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 483, Transitions: 482, Traversal time: 16.0s - StatisticsResult: Visitor Statistics States: 483, Transitions: 483, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 21731.4ms Time before loop, 0.0ms Time in loop, 21.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 15569, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 86.9ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 15570, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 490, Transitions: 489, Traversal time: 21.7s - StatisticsResult: Visitor Statistics States: 490, Transitions: 490, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 12183.3ms Time before loop, 0.0ms Time in loop, 12.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 16039, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 106.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 16040, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 497, Transitions: 496, Traversal time: 12.2s - StatisticsResult: Visitor Statistics States: 497, Transitions: 497, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 20488.0ms Time before loop, 0.0ms Time in loop, 20.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 16516, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 95.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 16517, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 504, Transitions: 503, Traversal time: 20.5s - StatisticsResult: Visitor Statistics States: 504, Transitions: 504, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 17999.8ms Time before loop, 0.0ms Time in loop, 18.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17000, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 106.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17001, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 511, Transitions: 510, Traversal time: 18.0s - StatisticsResult: Visitor Statistics States: 511, Transitions: 511, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 35182.6ms Time before loop, 0.0ms Time in loop, 35.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17491, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 101.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17492, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 518, Transitions: 517, Traversal time: 35.2s - StatisticsResult: Visitor Statistics States: 518, Transitions: 518, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 14010.0ms Time before loop, 0.0ms Time in loop, 14.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17989, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 111.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 17990, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 525, Transitions: 524, Traversal time: 14.0s - StatisticsResult: Visitor Statistics States: 525, Transitions: 525, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 21590.0ms Time before loop, 0.0ms Time in loop, 21.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 18494, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 108.7ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 18495, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 532, Transitions: 531, Traversal time: 21.6s - StatisticsResult: Visitor Statistics States: 532, Transitions: 532, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 36513.3ms Time before loop, 0.0ms Time in loop, 36.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 19006, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 108.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 19007, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 539, Transitions: 538, Traversal time: 36.5s - StatisticsResult: Visitor Statistics States: 539, Transitions: 539, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 34485.2ms Time before loop, 0.0ms Time in loop, 34.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 19525, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 105.1ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 19526, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 546, Transitions: 545, Traversal time: 34.5s - StatisticsResult: Visitor Statistics States: 546, Transitions: 546, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 20931.9ms Time before loop, 0.0ms Time in loop, 20.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 20051, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 113.0ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 20052, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 553, Transitions: 552, Traversal time: 20.9s - StatisticsResult: Visitor Statistics States: 553, Transitions: 553, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 24701.9ms Time before loop, 0.0ms Time in loop, 24.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 20584, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 105.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 20585, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 560, Transitions: 559, Traversal time: 24.7s - StatisticsResult: Visitor Statistics States: 560, Transitions: 560, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 26850.7ms Time before loop, 0.0ms Time in loop, 26.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 21124, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 115.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 21125, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 567, Transitions: 566, Traversal time: 26.9s - StatisticsResult: Visitor Statistics States: 567, Transitions: 567, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 39205.2ms Time before loop, 0.0ms Time in loop, 39.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 21671, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 130.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 21672, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 574, Transitions: 573, Traversal time: 39.2s - StatisticsResult: Visitor Statistics States: 574, Transitions: 574, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 38770.9ms Time before loop, 0.0ms Time in loop, 38.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 22225, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 142.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 22226, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 581, Transitions: 580, Traversal time: 38.8s - StatisticsResult: Visitor Statistics States: 581, Transitions: 581, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 29828.4ms Time before loop, 0.0ms Time in loop, 29.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 22786, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 107.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 22787, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 588, Transitions: 587, Traversal time: 29.8s - StatisticsResult: Visitor Statistics States: 588, Transitions: 588, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 49197.9ms Time before loop, 0.0ms Time in loop, 49.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23354, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 142.6ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23355, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 595, Transitions: 594, Traversal time: 49.2s - StatisticsResult: Visitor Statistics States: 595, Transitions: 595, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 29372.6ms Time before loop, 0.0ms Time in loop, 29.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23929, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 122.1ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23930, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 602, Transitions: 601, Traversal time: 29.4s - StatisticsResult: Visitor Statistics States: 602, Transitions: 602, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 44880.2ms Time before loop, 0.0ms Time in loop, 44.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 24511, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 158.4ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 24512, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 609, Transitions: 608, Traversal time: 44.9s - StatisticsResult: Visitor Statistics States: 609, Transitions: 609, Traversal time: 0.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 0 - StatisticsResult: Reduction benchmarks 42879.0ms Time before loop, 0.0ms Time in loop, 42.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23766, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 600, Transitions: 599, Traversal time: 42.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 102 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 2 thread instances CFG has 4 procedures, 131 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 3 thread instances CFG has 5 procedures, 160 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 4 thread instances CFG has 6 procedures, 189 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 62/62 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 5 thread instances CFG has 7 procedures, 218 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 95/95 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 6 thread instances CFG has 8 procedures, 247 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 135/135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 7 thread instances CFG has 9 procedures, 276 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 182/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 8 thread instances CFG has 10 procedures, 305 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 236/236 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 9 thread instances CFG has 11 procedures, 334 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 297/297 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 10 thread instances CFG has 12 procedures, 363 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 365/365 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 11 thread instances CFG has 13 procedures, 392 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 440/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 12 thread instances CFG has 14 procedures, 421 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 522/522 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 13 thread instances CFG has 15 procedures, 450 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 611/611 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 14 thread instances CFG has 16 procedures, 479 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 707/707 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 15 thread instances CFG has 17 procedures, 508 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 810/810 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 16 thread instances CFG has 18 procedures, 537 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 920/920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 17 thread instances CFG has 19 procedures, 566 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1037/1037 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 18 thread instances CFG has 20 procedures, 595 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1161/1161 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 19 thread instances CFG has 21 procedures, 624 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1292/1292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 20 thread instances CFG has 22 procedures, 653 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1430/1430 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 21 thread instances CFG has 23 procedures, 682 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1575/1575 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 22 thread instances CFG has 24 procedures, 711 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1727/1727 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 23 thread instances CFG has 25 procedures, 740 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1886/1886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 24 thread instances CFG has 26 procedures, 769 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2052/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 25 thread instances CFG has 27 procedures, 798 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2225/2225 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 26 thread instances CFG has 28 procedures, 827 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2405/2405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 27 thread instances CFG has 29 procedures, 856 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2592/2592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 28 thread instances CFG has 30 procedures, 885 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2786/2786 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 29 thread instances CFG has 31 procedures, 914 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2987/2987 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 30 thread instances CFG has 32 procedures, 943 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3195/3195 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 31 thread instances CFG has 33 procedures, 972 locations, 33 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3410/3410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 32 thread instances CFG has 34 procedures, 1001 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3632/3632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 33 thread instances CFG has 35 procedures, 1030 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3861/3861 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 34 thread instances CFG has 36 procedures, 1059 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4097/4097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 35 thread instances CFG has 37 procedures, 1088 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4340/4340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 36 thread instances CFG has 38 procedures, 1117 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4590/4590 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 37 thread instances CFG has 39 procedures, 1146 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4847/4847 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 38 thread instances CFG has 40 procedures, 1175 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5111/5111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 39 thread instances CFG has 41 procedures, 1204 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5382/5382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 40 thread instances CFG has 42 procedures, 1233 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5660/5660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 41 thread instances CFG has 43 procedures, 1262 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5945/5945 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 42 thread instances CFG has 44 procedures, 1291 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 655 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6237/6237 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 43 thread instances CFG has 45 procedures, 1320 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6536/6536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 44 thread instances CFG has 46 procedures, 1349 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 683 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6842/6842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 45 thread instances CFG has 47 procedures, 1378 locations, 47 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 7155/7155 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 46 thread instances CFG has 48 procedures, 1407 locations, 48 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 7475/7475 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 47 thread instances CFG has 49 procedures, 1436 locations, 49 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 7802/7802 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 48 thread instances CFG has 50 procedures, 1465 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 8136/8136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 49 thread instances CFG has 51 procedures, 1494 locations, 51 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 8477/8477 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 50 thread instances CFG has 52 procedures, 1523 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 8825/8825 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 51 thread instances CFG has 53 procedures, 1552 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9180/9180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 52 thread instances CFG has 54 procedures, 1581 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9542/9542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 53 thread instances CFG has 55 procedures, 1610 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9911/9911 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 54 thread instances CFG has 56 procedures, 1639 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 823 NumberOfCodeBlocks, 823 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 10287/10287 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 55 thread instances CFG has 57 procedures, 1668 locations, 57 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 10.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 10670/10670 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 56 thread instances CFG has 58 procedures, 1697 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 11060/11060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 57 thread instances CFG has 59 procedures, 1726 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 11457/11457 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 58 thread instances CFG has 60 procedures, 1755 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 439 ConstructedInterpolants, 0 QuantifiedInterpolants, 439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 11861/11861 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 59 thread instances CFG has 61 procedures, 1784 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 12272/12272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 60 thread instances CFG has 62 procedures, 1813 locations, 62 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 12690/12690 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 61 thread instances CFG has 63 procedures, 1842 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 11.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 13115/13115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 62 thread instances CFG has 64 procedures, 1871 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 13547/13547 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 63 thread instances CFG has 65 procedures, 1900 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 13986/13986 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 64 thread instances CFG has 66 procedures, 1929 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 963 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 481 ConstructedInterpolants, 0 QuantifiedInterpolants, 481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14432/14432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 65 thread instances CFG has 67 procedures, 1958 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 21.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 977 NumberOfCodeBlocks, 977 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14885/14885 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 66 thread instances CFG has 68 procedures, 1987 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 15345/15345 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 67 thread instances CFG has 69 procedures, 2016 locations, 69 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 15812/15812 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 68 thread instances CFG has 70 procedures, 2045 locations, 70 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 18.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1019 NumberOfCodeBlocks, 1019 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 16286/16286 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 69 thread instances CFG has 71 procedures, 2074 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 35.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 16767/16767 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 70 thread instances CFG has 72 procedures, 2103 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 17255/17255 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 71 thread instances CFG has 73 procedures, 2132 locations, 73 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 21.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 17750/17750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 72 thread instances CFG has 74 procedures, 2161 locations, 74 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 36.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 18252/18252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 73 thread instances CFG has 75 procedures, 2190 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 34.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1089 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 18761/18761 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 74 thread instances CFG has 76 procedures, 2219 locations, 76 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 21.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 19277/19277 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 75 thread instances CFG has 77 procedures, 2248 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 24.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 19800/19800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 76 thread instances CFG has 78 procedures, 2277 locations, 78 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 27.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 20330/20330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 77 thread instances CFG has 79 procedures, 2306 locations, 79 error locations. Started 1 CEGAR loops. OverallTime: 40.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 39.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 20867/20867 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 78 thread instances CFG has 80 procedures, 2335 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 39.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 38.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 21411/21411 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 79 thread instances CFG has 81 procedures, 2364 locations, 81 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 29.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 21962/21962 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 80 thread instances CFG has 82 procedures, 2393 locations, 82 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 49.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 1187 NumberOfCodeBlocks, 1187 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 22520/22520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 81 thread instances CFG has 83 procedures, 2422 locations, 83 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 29.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 1201 NumberOfCodeBlocks, 1201 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 23085/23085 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 82 thread instances CFG has 84 procedures, 2451 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 46.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 45.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 23657/23657 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 83 thread instances CFG has 85 procedures, 2480 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 42.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown