/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 20:22:26,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 20:22:26,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 20:22:26,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 20:22:26,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 20:22:26,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 20:22:26,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 20:22:26,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 20:22:26,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 20:22:26,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 20:22:26,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 20:22:26,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 20:22:26,707 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 20:22:26,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 20:22:26,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 20:22:26,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 20:22:26,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 20:22:26,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 20:22:26,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 20:22:26,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 20:22:26,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 20:22:26,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 20:22:26,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 20:22:26,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 20:22:26,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 20:22:26,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 20:22:26,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-05-05 20:22:26,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 20:22:26,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 20:22:26,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 20:22:26,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 20:22:26,983 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 20:22:26,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-05-05 20:22:28,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 20:22:28,251 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 20:22:28,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-05-05 20:22:28,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca8136718/c0e356696b214507a00274dccab2cadd/FLAGc060568b1 [2024-05-05 20:22:28,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca8136718/c0e356696b214507a00274dccab2cadd [2024-05-05 20:22:28,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 20:22:28,282 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 20:22:28,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 20:22:28,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 20:22:28,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 20:22:28,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600d90ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28, skipping insertion in model container [2024-05-05 20:22:28,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,326 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 20:22:28,625 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-05-05 20:22:28,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 20:22:28,673 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 20:22:28,703 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-05-05 20:22:28,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 20:22:28,775 INFO L206 MainTranslator]: Completed translation [2024-05-05 20:22:28,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28 WrapperNode [2024-05-05 20:22:28,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 20:22:28,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 20:22:28,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 20:22:28,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 20:22:28,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,877 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 288 [2024-05-05 20:22:28,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 20:22:28,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 20:22:28,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 20:22:28,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 20:22:28,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 20:22:28,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 20:22:28,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 20:22:28,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 20:22:28,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (1/1) ... [2024-05-05 20:22:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 20:22:28,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:28,988 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-05 20:22:29,052 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-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 20:22:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-05 20:22:29,081 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-05 20:22:29,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 20:22:29,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 20:22:29,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 20:22:29,084 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 20:22:29,201 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 20:22:29,202 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 20:22:29,455 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 20:22:29,488 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 20:22:29,488 INFO L309 CfgBuilder]: Removed 35 assume(true) statements. [2024-05-05 20:22:29,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 08:22:29 BoogieIcfgContainer [2024-05-05 20:22:29,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 20:22:29,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 20:22:29,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 20:22:29,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 20:22:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 08:22:28" (1/3) ... [2024-05-05 20:22:29,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec1e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 08:22:29, skipping insertion in model container [2024-05-05 20:22:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 08:22:28" (2/3) ... [2024-05-05 20:22:29,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec1e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 08:22:29, skipping insertion in model container [2024-05-05 20:22:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 08:22:29" (3/3) ... [2024-05-05 20:22:29,495 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-05-05 20:22:29,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 20:22:29,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 20:22:29,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-05 20:22:29,507 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 20:22:29,547 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-05 20:22:29,578 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:22:29,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:22:29,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:29,581 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-05 20:22:29,611 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-05 20:22:29,648 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:22:29,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:29,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:22:29,673 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:22:29,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-05 20:22:29,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 20:22:29,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 700882477, now seen corresponding path program 1 times [2024-05-05 20:22:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251978538] [2024-05-05 20:22:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:30,000 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-05 20:22:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:30,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251978538] [2024-05-05 20:22:30,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251978538] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:30,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:30,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:22:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850632542] [2024-05-05 20:22:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:22:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:22:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:22:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:30,058 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:30,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-05 20:22:30,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 20:22:30,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 20:22:30,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1073560970, now seen corresponding path program 1 times [2024-05-05 20:22:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247336267] [2024-05-05 20:22:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247336267] [2024-05-05 20:22:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247336267] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689955178] [2024-05-05 20:22:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:30,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:30,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:30,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 20:22:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:30,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:22:30,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:30,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689955178] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:30,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:22:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551590352] [2024-05-05 20:22:30,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:30,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:22:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:22:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:22:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:30,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:30,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 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-05 20:22:30,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:30,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:30,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-05-05 20:22:30,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 20:22:30,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash 870645974, now seen corresponding path program 2 times [2024-05-05 20:22:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638026285] [2024-05-05 20:22:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638026285] [2024-05-05 20:22:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638026285] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173148535] [2024-05-05 20:22:30,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:30,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:30,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:30,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-05 20:22:30,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:30,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:30,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:22:30,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:31,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173148535] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:31,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:22:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228520255] [2024-05-05 20:22:31,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:22:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:22:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:22:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:31,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:31,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 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-05 20:22:31,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:31,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:31,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:31,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:31,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:31,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 20:22:31,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1644696982, now seen corresponding path program 3 times [2024-05-05 20:22:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467140032] [2024-05-05 20:22:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:31,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:31,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467140032] [2024-05-05 20:22:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467140032] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:31,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847079809] [2024-05-05 20:22:31,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:22:31,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:31,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:31,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:31,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-05 20:22:31,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-05 20:22:31,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:31,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-05 20:22:31,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:32,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 20:22:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847079809] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:32,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:32,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-05-05 20:22:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170581592] [2024-05-05 20:22:32,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:32,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:22:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:22:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:22:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:32,146 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:32,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 23 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-05 20:22:32,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:32,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:32,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:32,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:32,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:32,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:32,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 20:22:32,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1535464883, now seen corresponding path program 4 times [2024-05-05 20:22:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151064113] [2024-05-05 20:22:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:32,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:22:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:32,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:22:32,648 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:22:32,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-05-05 20:22:32,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-05 20:22:32,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-05-05 20:22:32,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-05-05 20:22:32,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-05 20:22:32,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-05 20:22:32,658 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1] [2024-05-05 20:22:32,659 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:22:32,660 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-05 20:22:32,697 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-05 20:22:32,701 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:22:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:22:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:32,719 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-05 20:22:32,723 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:22:32,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:32,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:22:32,724 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:22:32,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-05 20:22:32,740 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-05 20:22:32,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:32,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -368786518, now seen corresponding path program 1 times [2024-05-05 20:22:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704862257] [2024-05-05 20:22:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704862257] [2024-05-05 20:22:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704862257] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:32,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:22:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152619929] [2024-05-05 20:22:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:32,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:22:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:22:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:22:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:32,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:32,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-05 20:22:32,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:32,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-05 20:22:32,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:32,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1959824080, now seen corresponding path program 1 times [2024-05-05 20:22:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:32,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154230137] [2024-05-05 20:22:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154230137] [2024-05-05 20:22:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154230137] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287751394] [2024-05-05 20:22:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:32,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:32,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-05 20:22:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:32,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:22:32,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:32,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287751394] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:32,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:22:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874225703] [2024-05-05 20:22:32,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:22:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:32,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:22:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:22:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:32,993 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:32,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-05 20:22:32,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:32,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:33,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:33,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:33,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:33,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash 507978672, now seen corresponding path program 2 times [2024-05-05 20:22:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605155501] [2024-05-05 20:22:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605155501] [2024-05-05 20:22:33,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605155501] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78973866] [2024-05-05 20:22:33,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:33,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-05 20:22:33,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:33,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:33,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:22:33,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:33,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78973866] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:33,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:22:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43338207] [2024-05-05 20:22:33,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:22:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:22:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:22:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:33,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:33,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 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-05 20:22:33,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:33,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:33,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:33,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-05-05 20:22:33,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-05 20:22:33,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:33,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1231429808, now seen corresponding path program 3 times [2024-05-05 20:22:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379908890] [2024-05-05 20:22:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:34,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:34,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379908890] [2024-05-05 20:22:34,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379908890] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:34,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039928953] [2024-05-05 20:22:34,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:22:34,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:34,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:34,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-05 20:22:34,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-05 20:22:34,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:34,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:22:34,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:34,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:22:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-05 20:22:34,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:22:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-05 20:22:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039928953] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:34,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 32 [2024-05-05 20:22:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287347789] [2024-05-05 20:22:34,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:34,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-05 20:22:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-05 20:22:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-05-05 20:22:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:34,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:34,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.28125) internal successors, (201), 32 states have internal predecessors, (201), 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-05 20:22:34,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:34,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:34,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:34,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:35,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:35,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:35,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:35,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash -712979179, now seen corresponding path program 1 times [2024-05-05 20:22:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:35,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609360017] [2024-05-05 20:22:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:35,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609360017] [2024-05-05 20:22:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609360017] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396272670] [2024-05-05 20:22:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:35,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:35,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:35,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:35,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-05 20:22:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:35,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:22:35,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:35,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-05 20:22:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396272670] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:36,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:22:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78200058] [2024-05-05 20:22:36,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:22:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:22:36,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:22:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:36,074 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:36,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 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-05 20:22:36,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:36,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:36,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:36,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:36,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:36,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:36,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-05 20:22:36,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-05 20:22:36,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1752755861, now seen corresponding path program 2 times [2024-05-05 20:22:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779203130] [2024-05-05 20:22:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:36,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:22:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:36,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:22:36,590 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:22:36,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-05-05 20:22:36,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-05 20:22:36,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-05-05 20:22:36,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-05-05 20:22:36,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-05 20:22:36,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-05 20:22:36,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-05 20:22:36,592 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1] [2024-05-05 20:22:36,592 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:22:36,592 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-05-05 20:22:36,616 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-05 20:22:36,643 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:22:36,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:22:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:36,662 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-05 20:22:36,666 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:22:36,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:36,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:22:36,667 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:22:36,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-05 20:22:36,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:36,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 598061514, now seen corresponding path program 1 times [2024-05-05 20:22:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672749749] [2024-05-05 20:22:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:36,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:36,690 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-05 20:22:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-05 20:22:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672749749] [2024-05-05 20:22:36,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672749749] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:36,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:36,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:22:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452952438] [2024-05-05 20:22:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:22:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:36,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:22:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:22:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:36,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:36,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-05 20:22:36,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:36,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-05 20:22:36,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:36,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1195334197, now seen corresponding path program 1 times [2024-05-05 20:22:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881735919] [2024-05-05 20:22:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881735919] [2024-05-05 20:22:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881735919] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175265597] [2024-05-05 20:22:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:36,863 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:36,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-05 20:22:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:37,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:22:37,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:37,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175265597] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:37,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:22:37,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076124091] [2024-05-05 20:22:37,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:37,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:22:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:22:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:22:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:37,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:37,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-05 20:22:37,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:37,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:37,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-05-05 20:22:37,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:37,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:37,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -500207019, now seen corresponding path program 2 times [2024-05-05 20:22:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275886858] [2024-05-05 20:22:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275886858] [2024-05-05 20:22:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275886858] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165161215] [2024-05-05 20:22:37,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:37,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-05 20:22:37,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:37,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:37,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:22:37,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:37,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165161215] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:22:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398205502] [2024-05-05 20:22:37,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:37,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:22:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:22:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:22:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:37,632 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:37,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 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-05 20:22:37,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:37,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:37,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:37,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:37,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-05 20:22:37,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:37,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1267378837, now seen corresponding path program 3 times [2024-05-05 20:22:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603539933] [2024-05-05 20:22:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603539933] [2024-05-05 20:22:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603539933] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072068846] [2024-05-05 20:22:38,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:22:38,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:38,191 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:38,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-05 20:22:38,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-05 20:22:38,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:38,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:22:38,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:38,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:22:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-05 20:22:38,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:38,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:22:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-05 20:22:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072068846] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:38,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 32 [2024-05-05 20:22:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138197597] [2024-05-05 20:22:38,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:38,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-05 20:22:38,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-05 20:22:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-05-05 20:22:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:38,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.0) internal successors, (256), 32 states have internal predecessors, (256), 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-05 20:22:38,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:38,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:38,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:38,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:39,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:39,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-05 20:22:39,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:39,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -624715901, now seen corresponding path program 1 times [2024-05-05 20:22:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927816351] [2024-05-05 20:22:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927816351] [2024-05-05 20:22:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927816351] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893005862] [2024-05-05 20:22:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:39,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:39,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:39,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:39,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-05 20:22:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:39,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:22:39,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:40,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-05 20:22:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893005862] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:40,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:40,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:22:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222238068] [2024-05-05 20:22:40,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:40,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:22:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:22:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:22:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:40,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 23 states have internal predecessors, (123), 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-05 20:22:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:40,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:40,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-05 20:22:40,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:40,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -64027805, now seen corresponding path program 2 times [2024-05-05 20:22:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430664477] [2024-05-05 20:22:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430664477] [2024-05-05 20:22:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430664477] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701769611] [2024-05-05 20:22:41,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:41,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:41,350 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:41,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-05 20:22:41,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:41,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:41,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:22:41,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:22:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:41,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:41,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:22:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701769611] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:41,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-05 20:22:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188208042] [2024-05-05 20:22:41,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:41,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-05 20:22:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:42,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-05 20:22:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-05 20:22:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:42,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:42,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 26 states have internal predecessors, (212), 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-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:42,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:42,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-05 20:22:42,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:42,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2137989880, now seen corresponding path program 1 times [2024-05-05 20:22:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744645606] [2024-05-05 20:22:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744645606] [2024-05-05 20:22:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744645606] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398440037] [2024-05-05 20:22:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:43,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:43,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:43,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:43,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-05 20:22:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:43,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:22:43,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:43,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:22:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:43,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:43,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:22:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-05 20:22:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398440037] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:43,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-05 20:22:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056873351] [2024-05-05 20:22:43,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:43,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-05 20:22:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-05 20:22:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-05 20:22:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:43,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.076923076923077) internal successors, (236), 26 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:44,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:44,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-05 20:22:44,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 20:22:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1993793129, now seen corresponding path program 1 times [2024-05-05 20:22:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:44,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942567563] [2024-05-05 20:22:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:44,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:22:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:44,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:22:44,306 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-05-05 20:22:44,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-05 20:22:44,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-05 20:22:44,323 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-05-05 20:22:44,324 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:22:44,324 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-05-05 20:22:44,351 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-05 20:22:44,354 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:22:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:22:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:44,370 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-05 20:22:44,372 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:22:44,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:44,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:22:44,373 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:22:44,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-05 20:22:44,388 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-05 20:22:44,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:44,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1194040010, now seen corresponding path program 1 times [2024-05-05 20:22:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067503120] [2024-05-05 20:22:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-05-05 20:22:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067503120] [2024-05-05 20:22:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067503120] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:22:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14474788] [2024-05-05 20:22:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:44,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:22:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:22:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:22:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:44,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:44,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-05 20:22:44,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:44,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-05 20:22:44,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:44,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1156516566, now seen corresponding path program 1 times [2024-05-05 20:22:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425179575] [2024-05-05 20:22:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425179575] [2024-05-05 20:22:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425179575] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540625660] [2024-05-05 20:22:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:44,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:44,610 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:44,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-05 20:22:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:44,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:22:44,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:44,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540625660] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:44,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:22:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939701175] [2024-05-05 20:22:44,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:44,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:22:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:22:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:22:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:44,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:44,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05 20:22:44,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:44,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:44,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-05 20:22:45,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:45,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2005481558, now seen corresponding path program 2 times [2024-05-05 20:22:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70419124] [2024-05-05 20:22:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70419124] [2024-05-05 20:22:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70419124] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611871171] [2024-05-05 20:22:45,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:45,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:45,171 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:45,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-05 20:22:45,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:45,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:45,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:22:45,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:45,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611871171] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:45,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:22:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568273924] [2024-05-05 20:22:45,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:45,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:22:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:22:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:22:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:45,492 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:45,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:22:45,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:45,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:45,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:45,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:45,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:45,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:45,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1755640662, now seen corresponding path program 3 times [2024-05-05 20:22:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873263910] [2024-05-05 20:22:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873263910] [2024-05-05 20:22:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873263910] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904849760] [2024-05-05 20:22:46,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:22:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:46,073 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:46,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-05-05 20:22:46,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-05 20:22:46,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:46,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-05 20:22:46,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:46,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:22:46,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:46,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:22:46,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:46,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:22:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-05 20:22:46,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:46,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1008) |c_~#cache~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:22:46,985 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1008) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:22:47,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:47,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:22:47,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:47,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:22:47,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:22:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 30 not checked. [2024-05-05 20:22:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904849760] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:47,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-05 20:22:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882243383] [2024-05-05 20:22:47,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:47,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-05 20:22:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-05 20:22:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1040, Unknown=2, NotChecked=134, Total=1332 [2024-05-05 20:22:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:47,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:47,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.432432432432432) internal successors, (349), 37 states have internal predecessors, (349), 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-05 20:22:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:48,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-05-05 20:22:48,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:48,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2128885073, now seen corresponding path program 1 times [2024-05-05 20:22:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960170320] [2024-05-05 20:22:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:48,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:48,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960170320] [2024-05-05 20:22:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960170320] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:48,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096475025] [2024-05-05 20:22:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:48,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:48,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:48,521 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-05-05 20:22:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:48,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:22:48,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:48,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-05 20:22:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096475025] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:48,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:22:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767425786] [2024-05-05 20:22:48,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:48,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:22:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:22:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:22:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:48,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:48,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:22:48,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:48,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:48,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:48,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:48,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:49,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:49,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:49,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:49,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1394231343, now seen corresponding path program 2 times [2024-05-05 20:22:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720852554] [2024-05-05 20:22:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 65 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:22:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720852554] [2024-05-05 20:22:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720852554] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28673731] [2024-05-05 20:22:49,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:49,800 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:49,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-05-05 20:22:49,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:49,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:49,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:22:49,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:50,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:22:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:22:50,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:50,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:22:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:22:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28673731] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:50,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-05 20:22:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337065093] [2024-05-05 20:22:50,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:50,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-05 20:22:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-05 20:22:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-05-05 20:22:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:50,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:50,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.923076923076923) internal successors, (258), 26 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:50,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:22:51,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:51,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-05 20:22:51,202 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:51,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:51,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2146101693, now seen corresponding path program 1 times [2024-05-05 20:22:51,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:51,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864518041] [2024-05-05 20:22:51,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:22:51,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864518041] [2024-05-05 20:22:51,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864518041] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128738212] [2024-05-05 20:22:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:51,770 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:51,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-05-05 20:22:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:51,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2024-05-05 20:22:51,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:52,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:22:52,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:52,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:22:52,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:52,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:22:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:22:52,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:52,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1270) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:22:52,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:52,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:22:52,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:52,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:22:52,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:22:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 35 not checked. [2024-05-05 20:22:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128738212] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:52,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:52,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2024-05-05 20:22:52,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357871323] [2024-05-05 20:22:52,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:52,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-05-05 20:22:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-05-05 20:22:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=858, Unknown=3, NotChecked=60, Total=1056 [2024-05-05 20:22:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:52,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:52,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.030303030303031) internal successors, (298), 33 states have internal predecessors, (298), 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-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:22:52,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:22:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:53,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:53,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-05-05 20:22:53,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-05 20:22:53,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2005270274, now seen corresponding path program 1 times [2024-05-05 20:22:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502109298] [2024-05-05 20:22:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:53,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:22:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:22:53,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:22:53,371 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:22:53,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-05-05 20:22:53,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-05 20:22:53,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-05 20:22:53,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-05 20:22:53,373 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-05-05 20:22:53,373 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:22:53,373 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-05-05 20:22:53,402 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-05-05 20:22:53,405 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:22:53,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:22:53,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:53,406 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-05 20:22:53,410 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:22:53,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:53,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:22:53,411 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:22:53,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-05 20:22:53,424 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-05 20:22:53,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:53,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1601781207, now seen corresponding path program 1 times [2024-05-05 20:22:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632150160] [2024-05-05 20:22:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-05-05 20:22:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632150160] [2024-05-05 20:22:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632150160] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:22:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476313254] [2024-05-05 20:22:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:22:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:53,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:22:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:22:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:53,579 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:53,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-05 20:22:53,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:53,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-05 20:22:53,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:53,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 906566645, now seen corresponding path program 1 times [2024-05-05 20:22:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038809503] [2024-05-05 20:22:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038809503] [2024-05-05 20:22:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038809503] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81314035] [2024-05-05 20:22:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:53,742 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:53,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-05-05 20:22:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:53,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:22:53,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:53,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81314035] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:54,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:22:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119755991] [2024-05-05 20:22:54,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:22:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:22:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:22:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:54,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:54,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-05 20:22:54,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:54,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:54,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-05 20:22:54,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:54,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1260418475, now seen corresponding path program 2 times [2024-05-05 20:22:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:54,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858749859] [2024-05-05 20:22:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:54,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:54,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858749859] [2024-05-05 20:22:54,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858749859] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:54,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410223697] [2024-05-05 20:22:54,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:22:54,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:54,450 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:54,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-05-05 20:22:54,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:22:54,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:54,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:22:54,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:54,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410223697] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:54,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:22:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444860245] [2024-05-05 20:22:54,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:54,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:22:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:22:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:22:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:54,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:54,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 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-05 20:22:54,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:54,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:54,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:55,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:55,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:55,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1702297365, now seen corresponding path program 3 times [2024-05-05 20:22:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211366674] [2024-05-05 20:22:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211366674] [2024-05-05 20:22:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211366674] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225258741] [2024-05-05 20:22:55,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:22:55,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:55,410 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-05-05 20:22:55,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-05 20:22:55,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:22:55,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-05 20:22:55,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:56,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:22:56,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:56,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:22:56,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:22:56,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:22:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-05-05 20:22:56,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:56,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1674) |c_~#cache~0.base|) (+ (* |c_t_funThread4of5ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:22:56,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1674) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:22:56,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:56,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:22:56,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:22:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:22:56,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:22:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 30 not checked. [2024-05-05 20:22:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225258741] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:56,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-05 20:22:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111611343] [2024-05-05 20:22:56,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-05 20:22:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:56,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-05 20:22:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1040, Unknown=2, NotChecked=134, Total=1332 [2024-05-05 20:22:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:56,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:56,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 10.621621621621621) internal successors, (393), 37 states have internal predecessors, (393), 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-05 20:22:56,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:56,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:56,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:56,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:57,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:57,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:57,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1030522031, now seen corresponding path program 1 times [2024-05-05 20:22:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593246141] [2024-05-05 20:22:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593246141] [2024-05-05 20:22:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593246141] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:22:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492239731] [2024-05-05 20:22:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:22:58,170 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:22:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-05-05 20:22:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:58,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:22:58,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:22:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:58,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:22:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-05 20:22:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492239731] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:22:58,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:22:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:22:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40931628] [2024-05-05 20:22:58,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:22:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:22:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:22:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:22:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:58,656 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 23 states have internal predecessors, (190), 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-05 20:22:58,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:58,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:58,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:58,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:58,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:58,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-05-05 20:22:59,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:22:59,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:59,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:59,112 INFO L85 PathProgramCache]: Analyzing trace with hash 828394063, now seen corresponding path program 2 times [2024-05-05 20:22:59,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:59,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331258284] [2024-05-05 20:22:59,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:22:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:22:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-05 20:22:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:22:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331258284] [2024-05-05 20:22:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331258284] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:22:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:22:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-05 20:22:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386549376] [2024-05-05 20:22:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:22:59,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-05 20:22:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:22:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-05 20:22:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-05-05 20:22:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:59,753 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:22:59,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 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-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:59,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:22:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:22:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:22:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:22:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:22:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:22:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:22:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-05 20:22:59,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:22:59,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:22:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1122362463, now seen corresponding path program 1 times [2024-05-05 20:22:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:22:59,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184590312] [2024-05-05 20:22:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:22:59,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 50 proven. 65 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:23:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184590312] [2024-05-05 20:23:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184590312] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607509318] [2024-05-05 20:23:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:00,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:00,950 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:00,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-05-05 20:23:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:01,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:23:01,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 65 proven. 50 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:23:01,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:01,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 40 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:23:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607509318] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:02,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:02,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 31 [2024-05-05 20:23:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633672480] [2024-05-05 20:23:02,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-05 20:23:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-05 20:23:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2024-05-05 20:23:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:02,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:02,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 14.0) internal successors, (434), 31 states have internal predecessors, (434), 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-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:02,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 20:23:02,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:03,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:23:03,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 77453119, now seen corresponding path program 1 times [2024-05-05 20:23:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:03,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141152017] [2024-05-05 20:23:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:23:03,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141152017] [2024-05-05 20:23:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141152017] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975948230] [2024-05-05 20:23:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:03,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:03,895 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:03,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-05-05 20:23:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:04,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:23:04,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:04,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:04,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:04,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975948230] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:04,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 31 [2024-05-05 20:23:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783567054] [2024-05-05 20:23:04,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-05 20:23:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-05 20:23:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-05-05 20:23:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:04,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:04,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.612903225806452) internal successors, (360), 31 states have internal predecessors, (360), 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-05 20:23:04,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:04,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 20:23:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:23:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 20:23:05,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:05,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-05-05 20:23:05,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:23:05,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 32601087, now seen corresponding path program 1 times [2024-05-05 20:23:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377890195] [2024-05-05 20:23:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 100 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:23:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377890195] [2024-05-05 20:23:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377890195] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858622236] [2024-05-05 20:23:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:06,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:06,321 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-05-05 20:23:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:06,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 35 conjunts are in the unsatisfiable core [2024-05-05 20:23:06,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:07,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:07,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:07,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:07,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:07,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:07,235 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2204 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2204) |c_~#cache~0.base|) (+ (* |c_t_funThread4of5ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:23:07,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:23:07,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:07,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:23:07,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:23:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 15 not checked. [2024-05-05 20:23:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858622236] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:07,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2024-05-05 20:23:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920267799] [2024-05-05 20:23:07,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:07,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-05 20:23:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-05 20:23:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=4, NotChecked=66, Total=1260 [2024-05-05 20:23:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:07,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:07,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.5) internal successors, (378), 36 states have internal predecessors, (378), 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-05 20:23:07,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:07,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:07,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 20:23:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-05 20:23:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-05 20:23:08,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:08,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-05-05 20:23:08,612 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:23:08,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1360042307, now seen corresponding path program 1 times [2024-05-05 20:23:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840947515] [2024-05-05 20:23:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840947515] [2024-05-05 20:23:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840947515] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368532815] [2024-05-05 20:23:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:09,006 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:09,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-05-05 20:23:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:09,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:23:09,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:09,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-05 20:23:09,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:09,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 35 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-05 20:23:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368532815] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:09,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-05 20:23:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801665166] [2024-05-05 20:23:09,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:23:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:09,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:23:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:23:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:09,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:09,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.851851851851851) internal successors, (401), 27 states have internal predecessors, (401), 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-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-05 20:23:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-05 20:23:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-05 20:23:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-05 20:23:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-05 20:23:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-05 20:23:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:10,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-05-05 20:23:10,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-05 20:23:10,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1244947077, now seen corresponding path program 1 times [2024-05-05 20:23:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184871313] [2024-05-05 20:23:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:23:10,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:23:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:23:10,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:23:10,572 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2024-05-05 20:23:10,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2024-05-05 20:23:10,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-05-05 20:23:10,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-05-05 20:23:10,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-05-05 20:23:10,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-05 20:23:10,574 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-05-05 20:23:10,580 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:23:10,580 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-05-05 20:23:10,610 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-05-05 20:23:10,613 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:23:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:23:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:10,614 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-05 20:23:10,617 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:23:10,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:10,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:23:10,618 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:23:10,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-05 20:23:10,623 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-05 20:23:10,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:10,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 879549218, now seen corresponding path program 1 times [2024-05-05 20:23:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919457853] [2024-05-05 20:23:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-05-05 20:23:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919457853] [2024-05-05 20:23:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919457853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:23:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:23:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:23:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761720820] [2024-05-05 20:23:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:23:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:23:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:23:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:23:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:10,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-05 20:23:10,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:11,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-05 20:23:11,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:11,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -309198185, now seen corresponding path program 1 times [2024-05-05 20:23:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793851144] [2024-05-05 20:23:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793851144] [2024-05-05 20:23:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793851144] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634607472] [2024-05-05 20:23:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:11,101 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:11,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-05-05 20:23:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:11,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:23:11,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:11,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634607472] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:11,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:23:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173451191] [2024-05-05 20:23:11,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:11,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:23:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:23:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:23:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:11,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:11,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 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-05 20:23:11,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:11,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:11,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:11,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-05-05 20:23:11,818 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:11,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 845749271, now seen corresponding path program 2 times [2024-05-05 20:23:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:11,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051527416] [2024-05-05 20:23:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:11,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:11,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051527416] [2024-05-05 20:23:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051527416] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:11,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858615007] [2024-05-05 20:23:11,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:23:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:11,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:11,952 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:11,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-05-05 20:23:12,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:23:12,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:23:12,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:23:12,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:12,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858615007] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:12,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:23:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332057717] [2024-05-05 20:23:12,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:12,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:23:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:12,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:23:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:23:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:12,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:12,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.38888888888889) internal successors, (223), 18 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:23:12,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:12,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:12,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:12,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:12,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:12,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash 236564247, now seen corresponding path program 3 times [2024-05-05 20:23:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:12,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491994972] [2024-05-05 20:23:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491994972] [2024-05-05 20:23:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491994972] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948908236] [2024-05-05 20:23:12,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:23:12,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:13,002 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:13,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-05-05 20:23:13,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-05 20:23:13,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:23:13,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-05 20:23:13,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:14,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:23:14,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:23:14,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:14,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 20:23:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 141 proven. 5 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-05 20:23:14,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:14,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2868 (Array Int Int))) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2868) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4))))) is different from false [2024-05-05 20:23:14,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:14,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:23:14,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:14,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:23:14,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:23:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 152 trivial. 15 not checked. [2024-05-05 20:23:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948908236] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:14,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-05 20:23:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547814940] [2024-05-05 20:23:14,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:14,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-05 20:23:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-05 20:23:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1095, Unknown=10, NotChecked=68, Total=1332 [2024-05-05 20:23:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:14,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:14,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 11.81081081081081) internal successors, (437), 37 states have internal predecessors, (437), 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-05 20:23:14,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:14,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:14,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:14,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:15,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:16,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-05-05 20:23:16,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:16,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 705816712, now seen corresponding path program 1 times [2024-05-05 20:23:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129948819] [2024-05-05 20:23:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:16,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129948819] [2024-05-05 20:23:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129948819] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607312353] [2024-05-05 20:23:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:16,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:16,454 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-05-05 20:23:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:16,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:23:16,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:16,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-05 20:23:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607312353] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:16,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:23:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637354571] [2024-05-05 20:23:16,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:16,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:23:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:23:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:23:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:17,056 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:17,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 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-05 20:23:17,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:17,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:17,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:17,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:17,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:17,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-05-05 20:23:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:17,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:17,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 272802312, now seen corresponding path program 2 times [2024-05-05 20:23:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651834060] [2024-05-05 20:23:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-05 20:23:18,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:18,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651834060] [2024-05-05 20:23:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651834060] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247036043] [2024-05-05 20:23:18,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:23:18,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:18,176 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:18,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-05-05 20:23:18,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:23:18,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:23:18,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:23:18,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:18,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-05 20:23:18,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:18,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-05 20:23:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247036043] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:18,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-05 20:23:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039023996] [2024-05-05 20:23:18,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:18,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-05 20:23:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-05 20:23:19,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-05-05 20:23:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:19,044 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 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-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:19,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:19,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:19,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-05-05 20:23:19,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:19,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash 370425860, now seen corresponding path program 1 times [2024-05-05 20:23:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490181672] [2024-05-05 20:23:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-05-05 20:23:20,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490181672] [2024-05-05 20:23:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490181672] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:23:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:23:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-05 20:23:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412866103] [2024-05-05 20:23:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:23:20,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-05 20:23:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-05 20:23:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-05-05 20:23:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:20,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:20,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 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-05 20:23:20,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:20,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:20,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:20,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:20,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:20,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:20,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:20,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-05 20:23:20,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:20,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -698615587, now seen corresponding path program 1 times [2024-05-05 20:23:20,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248356381] [2024-05-05 20:23:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-05-05 20:23:23,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:23,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248356381] [2024-05-05 20:23:23,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248356381] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:23,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743640888] [2024-05-05 20:23:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:23,038 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:23,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-05-05 20:23:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:23,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:23:23,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:24,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:23:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 146 proven. 10 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:24,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:24,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2024-05-05 20:23:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743640888] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:24,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10, 9] total 45 [2024-05-05 20:23:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750762990] [2024-05-05 20:23:24,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:24,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-05-05 20:23:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-05-05 20:23:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2024-05-05 20:23:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:24,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:24,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.244444444444444) internal successors, (506), 45 states have internal predecessors, (506), 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-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:24,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:24,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-05 20:23:27,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:27,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,40 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:27,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:27,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -672720256, now seen corresponding path program 1 times [2024-05-05 20:23:27,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:27,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724157931] [2024-05-05 20:23:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:27,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 126 proven. 50 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-05 20:23:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724157931] [2024-05-05 20:23:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724157931] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117180696] [2024-05-05 20:23:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:28,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:28,328 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:28,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-05-05 20:23:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:28,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-05 20:23:28,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:28,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:29,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:29,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:29,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:29,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 15 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-05 20:23:29,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:29,326 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3526 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_3526) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:23:29,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:29,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:23:29,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:23:29,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:23:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 106 proven. 5 refuted. 0 times theorem prover too weak. 275 trivial. 35 not checked. [2024-05-05 20:23:29,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117180696] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:29,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:29,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2024-05-05 20:23:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371327944] [2024-05-05 20:23:29,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:29,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-05 20:23:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:29,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-05 20:23:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1050, Unknown=6, NotChecked=66, Total=1260 [2024-05-05 20:23:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:29,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:29,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.055555555555555) internal successors, (398), 36 states have internal predecessors, (398), 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-05 20:23:29,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-05 20:23:29,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:23:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:23:31,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:31,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-05-05 20:23:31,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:31,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1375090395, now seen corresponding path program 1 times [2024-05-05 20:23:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440517494] [2024-05-05 20:23:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 20 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440517494] [2024-05-05 20:23:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440517494] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345191552] [2024-05-05 20:23:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:31,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:31,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:31,748 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:31,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-05-05 20:23:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:32,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:23:32,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:32,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 116 proven. 45 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:32,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:32,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 20 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:23:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345191552] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:32,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:32,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-05 20:23:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565734600] [2024-05-05 20:23:32,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:32,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:23:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:23:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:23:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:32,911 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.074074074074073) internal successors, (434), 27 states have internal predecessors, (434), 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-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:23:32,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:33,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-05-05 20:23:33,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:33,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1396044319, now seen corresponding path program 1 times [2024-05-05 20:23:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634669243] [2024-05-05 20:23:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 35 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:23:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634669243] [2024-05-05 20:23:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634669243] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556826542] [2024-05-05 20:23:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:33,833 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:33,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-05-05 20:23:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:34,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-05 20:23:34,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:34,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:23:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:23:34,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:34,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 35 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:23:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556826542] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:34,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-05 20:23:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188100028] [2024-05-05 20:23:34,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:23:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:23:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:23:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:34,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:34,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.444444444444445) internal successors, (417), 27 states have internal predecessors, (417), 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-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:34,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:23:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:35,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:35,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:35,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:35,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash -762435814, now seen corresponding path program 1 times [2024-05-05 20:23:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018503521] [2024-05-05 20:23:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 95 proven. 61 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018503521] [2024-05-05 20:23:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018503521] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594692698] [2024-05-05 20:23:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:36,640 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:36,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-05-05 20:23:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:37,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:23:37,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:37,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 121 proven. 50 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-05 20:23:37,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:37,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:23:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 40 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-05 20:23:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594692698] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:37,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 9] total 35 [2024-05-05 20:23:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594433703] [2024-05-05 20:23:37,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-05 20:23:37,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-05 20:23:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2024-05-05 20:23:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:37,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:37,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 13.714285714285714) internal successors, (480), 35 states have internal predecessors, (480), 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-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:37,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:23:38,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:38,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-05-05 20:23:38,836 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:38,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 742268639, now seen corresponding path program 1 times [2024-05-05 20:23:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5630420] [2024-05-05 20:23:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5630420] [2024-05-05 20:23:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5630420] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159728250] [2024-05-05 20:23:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:39,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:39,188 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:39,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-05-05 20:23:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:39,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-05 20:23:39,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:40,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:23:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 121 proven. 35 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:40,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:40,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2024-05-05 20:23:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 25 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:23:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159728250] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:40,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:40,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-05 20:23:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163007324] [2024-05-05 20:23:40,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:40,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:23:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:23:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:23:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:40,576 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:40,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.296296296296296) internal successors, (413), 27 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:23:40,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:23:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:23:41,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:41,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:41,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-05 20:23:41,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 855758243, now seen corresponding path program 1 times [2024-05-05 20:23:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733929451] [2024-05-05 20:23:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:23:41,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:23:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:23:41,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:23:41,366 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:23:41,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-05-05 20:23:41,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-05-05 20:23:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-05 20:23:41,370 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-05 20:23:41,384 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:23:41,384 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-05-05 20:23:41,444 INFO L144 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-05-05 20:23:41,448 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:23:41,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:23:41,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:41,449 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-05 20:23:41,452 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:23:41,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:41,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:23:41,453 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:23:41,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-05-05 20:23:41,467 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-05 20:23:41,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:41,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 141764636, now seen corresponding path program 1 times [2024-05-05 20:23:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112910642] [2024-05-05 20:23:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-05-05 20:23:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112910642] [2024-05-05 20:23:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112910642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:23:41,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:23:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:23:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13782744] [2024-05-05 20:23:41,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:23:41,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:23:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:23:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:23:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:41,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:41,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-05 20:23:41,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-05 20:23:42,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:42,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1987018939, now seen corresponding path program 1 times [2024-05-05 20:23:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964822649] [2024-05-05 20:23:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:42,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964822649] [2024-05-05 20:23:42,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964822649] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:42,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843688565] [2024-05-05 20:23:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:42,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:42,113 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:42,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-05-05 20:23:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:42,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:23:42,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:42,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843688565] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:42,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:42,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:23:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462041046] [2024-05-05 20:23:42,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:42,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:23:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:23:42,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:23:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:42,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:42,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 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-05 20:23:42,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:42,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:42,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,47 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:43,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:43,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1310761317, now seen corresponding path program 2 times [2024-05-05 20:23:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:43,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532344456] [2024-05-05 20:23:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532344456] [2024-05-05 20:23:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532344456] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074961681] [2024-05-05 20:23:43,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:23:43,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:43,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:43,132 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:43,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-05-05 20:23:43,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:23:43,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:23:43,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:23:43,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:43,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074961681] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:43,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:23:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640112481] [2024-05-05 20:23:43,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:43,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:23:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:43,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:23:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:23:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:43,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:43,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 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-05 20:23:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:43,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,48 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:44,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:44,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1531866533, now seen corresponding path program 3 times [2024-05-05 20:23:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635333926] [2024-05-05 20:23:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635333926] [2024-05-05 20:23:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635333926] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770855411] [2024-05-05 20:23:44,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:23:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:44,394 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:44,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-05-05 20:23:47,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-05 20:23:47,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:23:47,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 67 conjunts are in the unsatisfiable core [2024-05-05 20:23:47,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:48,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:23:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:48,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:48,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:23:48,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 20:23:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2024-05-05 20:23:49,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:23:49,248 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2024-05-05 20:23:49,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 27 [2024-05-05 20:23:49,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:23:49,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:23:49,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,466 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-05-05 20:23:49,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2024-05-05 20:23:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2024-05-05 20:23:49,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:23:49,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2024-05-05 20:23:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 191 proven. 35 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-05-05 20:23:50,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:50,815 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2024-05-05 20:23:50,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 58 [2024-05-05 20:23:50,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:50,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 131 [2024-05-05 20:23:50,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2024-05-05 20:23:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2024-05-05 20:23:50,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:23:50,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:23:50,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:50,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 85 [2024-05-05 20:23:52,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:52,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:23:52,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:23:52,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-05-05 20:23:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:23:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 157 proven. 69 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-05-05 20:23:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770855411] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:52,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 23] total 59 [2024-05-05 20:23:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397284461] [2024-05-05 20:23:52,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-05-05 20:23:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:52,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-05-05 20:23:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3001, Unknown=13, NotChecked=0, Total=3422 [2024-05-05 20:23:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:52,839 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:52,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 13.779661016949152) internal successors, (813), 59 states have internal predecessors, (813), 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-05 20:23:52,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:52,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:52,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:52,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 20:23:55,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:55,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2024-05-05 20:23:55,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:55,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash 788582943, now seen corresponding path program 1 times [2024-05-05 20:23:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520510213] [2024-05-05 20:23:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520510213] [2024-05-05 20:23:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520510213] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:23:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64878871] [2024-05-05 20:23:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:23:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:23:55,726 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:23:55,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-05-05 20:23:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:56,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:23:56,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:23:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:56,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:23:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-05 20:23:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64878871] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:23:56,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:23:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:23:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151018826] [2024-05-05 20:23:56,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:23:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:23:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:23:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:23:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:56,501 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:56,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:23:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 20:23:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 20:23:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:56,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2024-05-05 20:23:56,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2024-05-05 20:23:56,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:56,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1166815295, now seen corresponding path program 2 times [2024-05-05 20:23:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643841003] [2024-05-05 20:23:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:23:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-05-05 20:23:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:23:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643841003] [2024-05-05 20:23:58,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643841003] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:23:58,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:23:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-05-05 20:23:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073566529] [2024-05-05 20:23:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:23:58,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-05 20:23:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:23:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-05 20:23:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-05 20:23:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:58,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:23:58,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 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-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:58,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:23:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:23:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:23:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:23:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:23:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:23:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:23:59,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-05 20:23:59,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:23:59,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:23:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2135733999, now seen corresponding path program 1 times [2024-05-05 20:23:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:23:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969383680] [2024-05-05 20:23:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:23:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:23:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 10 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-05 20:24:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:00,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969383680] [2024-05-05 20:24:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969383680] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:00,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881588580] [2024-05-05 20:24:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:00,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:00,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:00,064 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:00,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-05-05 20:24:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:00,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:24:00,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:00,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-05 20:24:00,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:00,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:24:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-05 20:24:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881588580] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:00,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:00,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 29 [2024-05-05 20:24:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271283423] [2024-05-05 20:24:00,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-05 20:24:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-05 20:24:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2024-05-05 20:24:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:01,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:01,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 14.724137931034482) internal successors, (427), 29 states have internal predecessors, (427), 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-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:01,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:02,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2024-05-05 20:24:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-05-05 20:24:02,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:02,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1152550354, now seen corresponding path program 1 times [2024-05-05 20:24:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051303084] [2024-05-05 20:24:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-05-05 20:24:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051303084] [2024-05-05 20:24:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051303084] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808365051] [2024-05-05 20:24:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:03,457 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-05-05 20:24:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:03,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:24:03,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:04,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 200 proven. 10 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-05 20:24:04,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2024-05-05 20:24:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 15 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-05 20:24:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808365051] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:04,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-05 20:24:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960836882] [2024-05-05 20:24:04,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-05 20:24:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-05 20:24:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2024-05-05 20:24:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:04,900 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:04,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 18.346153846153847) internal successors, (477), 26 states have internal predecessors, (477), 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-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:04,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:06,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:06,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-05-05 20:24:06,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:06,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1828277365, now seen corresponding path program 1 times [2024-05-05 20:24:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:06,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978412103] [2024-05-05 20:24:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 144 proven. 96 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-05 20:24:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978412103] [2024-05-05 20:24:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978412103] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109915851] [2024-05-05 20:24:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:07,112 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-05-05 20:24:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:07,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:24:07,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:07,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 125 proven. 5 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-05-05 20:24:07,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:08,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:24:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 125 proven. 5 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-05-05 20:24:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109915851] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:08,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 9] total 36 [2024-05-05 20:24:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492177727] [2024-05-05 20:24:08,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:08,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-05 20:24:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-05 20:24:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2024-05-05 20:24:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:08,420 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:08,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 15.5) internal successors, (558), 36 states have internal predecessors, (558), 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-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:08,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:08,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:24:10,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:10,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,53 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:10,218 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:10,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1168848476, now seen corresponding path program 1 times [2024-05-05 20:24:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59444250] [2024-05-05 20:24:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 20 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-05 20:24:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59444250] [2024-05-05 20:24:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59444250] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826375692] [2024-05-05 20:24:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:10,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:10,722 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-05-05 20:24:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:11,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-05 20:24:11,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:11,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 170 proven. 45 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-05 20:24:11,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:11,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:24:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 20 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-05 20:24:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826375692] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:11,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-05 20:24:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791105073] [2024-05-05 20:24:11,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:11,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:24:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:24:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:24:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:12,043 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:12,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.62962962962963) internal successors, (449), 27 states have internal predecessors, (449), 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-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-05 20:24:12,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-05 20:24:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:12,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:12,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,54 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:12,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:12,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1758158926, now seen corresponding path program 1 times [2024-05-05 20:24:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009224215] [2024-05-05 20:24:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 164 proven. 66 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:24:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:13,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009224215] [2024-05-05 20:24:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009224215] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:13,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416454297] [2024-05-05 20:24:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:13,694 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-05-05 20:24:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:14,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-05 20:24:14,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:14,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:24:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:24:15,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-05 20:24:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 191 proven. 39 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-05 20:24:15,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:27,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:27,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-05 20:24:27,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:27,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2024-05-05 20:24:27,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:24:27,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:27,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2024-05-05 20:24:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416454297] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:28,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 12] total 42 [2024-05-05 20:24:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465412429] [2024-05-05 20:24:28,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-05 20:24:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-05 20:24:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1534, Unknown=6, NotChecked=0, Total=1722 [2024-05-05 20:24:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:28,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:28,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 12.095238095238095) internal successors, (508), 42 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:28,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:29,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,55 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:29,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1512932875, now seen corresponding path program 1 times [2024-05-05 20:24:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362559900] [2024-05-05 20:24:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 105 proven. 130 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:24:30,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:30,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362559900] [2024-05-05 20:24:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362559900] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451872461] [2024-05-05 20:24:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:30,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:30,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:30,262 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:30,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-05-05 20:24:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:30,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-05 20:24:30,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:31,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:24:31,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:24:31,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-05 20:24:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 137 proven. 98 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-05 20:24:31,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:44,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:44,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-05 20:24:44,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:44,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2024-05-05 20:24:44,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:24:44,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:24:44,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2024-05-05 20:24:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 160 proven. 65 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:24:44,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451872461] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:44,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:44,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 12] total 42 [2024-05-05 20:24:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741043111] [2024-05-05 20:24:44,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-05 20:24:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-05 20:24:44,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1532, Unknown=6, NotChecked=0, Total=1722 [2024-05-05 20:24:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:44,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:44,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 13.19047619047619) internal successors, (554), 42 states have internal predecessors, (554), 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-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:44,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:44,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:45,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:45,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2024-05-05 20:24:45,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:45,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash 595562646, now seen corresponding path program 1 times [2024-05-05 20:24:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:45,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541966177] [2024-05-05 20:24:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:45,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541966177] [2024-05-05 20:24:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541966177] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939709961] [2024-05-05 20:24:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:46,293 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:46,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-05-05 20:24:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:46,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-05 20:24:46,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:47,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 145 proven. 75 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:47,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:24:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939709961] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:47,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:47,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-05 20:24:47,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101811175] [2024-05-05 20:24:47,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:47,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:24:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:24:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:24:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:47,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:47,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.962962962962964) internal successors, (431), 27 states have internal predecessors, (431), 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-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:47,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:47,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:47,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:24:48,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:48,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,57 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:48,685 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:48,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1135005866, now seen corresponding path program 1 times [2024-05-05 20:24:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53515748] [2024-05-05 20:24:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-05-05 20:24:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53515748] [2024-05-05 20:24:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53515748] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677286026] [2024-05-05 20:24:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:49,202 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:49,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-05-05 20:24:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:49,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 20:24:49,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:50,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:24:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 175 proven. 50 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:24:50,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:24:50,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-05-05 20:24:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 40 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:24:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677286026] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:24:50,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:24:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-05 20:24:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186543665] [2024-05-05 20:24:50,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:24:50,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-05 20:24:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:24:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-05 20:24:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-05-05 20:24:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:50,404 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:24:50,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.962962962962962) internal successors, (458), 27 states have internal predecessors, (458), 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-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:24:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:24:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:24:51,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2024-05-05 20:24:51,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,58 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:51,571 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:24:51,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:24:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 924656902, now seen corresponding path program 1 times [2024-05-05 20:24:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:24:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152316905] [2024-05-05 20:24:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:24:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 154 proven. 66 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:24:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152316905] [2024-05-05 20:24:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152316905] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:24:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750751557] [2024-05-05 20:24:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:24:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:24:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:24:52,209 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:24:52,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-05-05 20:24:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:24:52,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-05 20:24:52,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:24:53,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:24:53,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:24:53,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-05 20:24:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 154 proven. 66 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:24:53,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:25:06,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:06,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-05 20:25:06,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:06,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2024-05-05 20:25:06,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:25:06,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:06,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2024-05-05 20:25:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 165 proven. 50 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-05 20:25:06,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750751557] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:25:06,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:25:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 12] total 41 [2024-05-05 20:25:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210565237] [2024-05-05 20:25:06,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:25:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-05 20:25:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:25:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-05 20:25:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1433, Unknown=6, NotChecked=0, Total=1640 [2024-05-05 20:25:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:06,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:25:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.75609756097561) internal successors, (482), 41 states have internal predecessors, (482), 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-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:25:06,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:25:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:25:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:25:07,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2024-05-05 20:25:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2024-05-05 20:25:07,712 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:25:07,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1299871125, now seen corresponding path program 1 times [2024-05-05 20:25:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:07,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764434601] [2024-05-05 20:25:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 100 proven. 125 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:25:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:25:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764434601] [2024-05-05 20:25:08,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764434601] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:25:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011384260] [2024-05-05 20:25:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:25:08,349 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:25:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-05-05 20:25:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:08,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-05 20:25:08,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:25:09,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:25:09,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:09,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-05 20:25:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 100 proven. 125 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-05 20:25:10,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:25:22,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:22,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-05 20:25:22,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2024-05-05 20:25:22,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:25:22,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:25:22,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2024-05-05 20:25:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 126 proven. 94 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-05 20:25:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011384260] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:25:22,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:25:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 12] total 41 [2024-05-05 20:25:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312719306] [2024-05-05 20:25:22,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:25:22,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-05 20:25:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:25:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-05 20:25:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1432, Unknown=6, NotChecked=0, Total=1640 [2024-05-05 20:25:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:22,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:25:22,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 12.829268292682928) internal successors, (526), 41 states have internal predecessors, (526), 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-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:25:22,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 20:25:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:25:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-05 20:25:23,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2024-05-05 20:25:24,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2024-05-05 20:25:24,066 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-05 20:25:24,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 260589196, now seen corresponding path program 1 times [2024-05-05 20:25:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741309350] [2024-05-05 20:25:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:25:24,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 20:25:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 20:25:24,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 20:25:24,126 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-05-05 20:25:24,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-05-05 20:25:24,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-05 20:25:24,127 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-05 20:25:24,128 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-05 20:25:24,128 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-05-05 20:25:24,174 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-05-05 20:25:24,178 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 20:25:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 20:25:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:25:24,179 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-05 20:25:24,198 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-05 20:25:24,199 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 20:25:24,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:24,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 20:25:24,200 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5530b52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 20:25:24,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-05-05 20:25:24,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:25:24,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash -857728578, now seen corresponding path program 1 times [2024-05-05 20:25:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249379253] [2024-05-05 20:25:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-05-05 20:25:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:25:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249379253] [2024-05-05 20:25:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249379253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:25:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:25:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-05 20:25:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266120498] [2024-05-05 20:25:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:25:24,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-05 20:25:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:25:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-05 20:25:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-05 20:25:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:24,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:25:24,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-05 20:25:24,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-05 20:25:25,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:25:25,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -56031683, now seen corresponding path program 1 times [2024-05-05 20:25:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359671914] [2024-05-05 20:25:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:25:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359671914] [2024-05-05 20:25:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359671914] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:25:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627725238] [2024-05-05 20:25:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:25,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:25:25,274 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:25:25,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-05-05 20:25:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:25,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-05 20:25:25,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:25:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:25,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:25:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627725238] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:25:25,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:25:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-05 20:25:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448879946] [2024-05-05 20:25:25,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:25:25,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-05 20:25:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:25:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 20:25:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-05 20:25:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:25,940 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:25:25,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.1) internal successors, (291), 10 states have internal predecessors, (291), 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-05 20:25:25,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:25,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:26,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2024-05-05 20:25:26,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,62 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:26,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:25:26,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1251200323, now seen corresponding path program 2 times [2024-05-05 20:25:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559397818] [2024-05-05 20:25:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:25:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559397818] [2024-05-05 20:25:26,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559397818] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:25:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735662079] [2024-05-05 20:25:26,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 20:25:26,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:25:26,459 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:25:26,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-05-05 20:25:27,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 20:25:27,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:25:27,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 20:25:27,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:25:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:27,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:25:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735662079] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:25:27,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:25:27,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-05 20:25:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128962873] [2024-05-05 20:25:27,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:25:27,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 20:25:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:25:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 20:25:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-05 20:25:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:27,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:25:27,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.27777777777778) internal successors, (311), 18 states have internal predecessors, (311), 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-05 20:25:27,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:27,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:27,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:25:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:25:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:25:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:25:27,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2024-05-05 20:25:27,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,63 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:27,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:25:27,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:25:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1485722691, now seen corresponding path program 3 times [2024-05-05 20:25:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:25:27,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380736008] [2024-05-05 20:25:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:25:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:25:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:25:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:25:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:25:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380736008] [2024-05-05 20:25:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380736008] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:25:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988158027] [2024-05-05 20:25:28,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 20:25:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:25:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:25:28,098 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:25:28,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-05-05 20:25:31,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-05 20:25:31,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 20:25:31,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 122 conjunts are in the unsatisfiable core [2024-05-05 20:25:31,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:25:31,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-05 20:25:31,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:31,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:25:31,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:31,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-05 20:25:32,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 20:25:32,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-05-05 20:25:32,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:25:33,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:33,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-05-05 20:25:33,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:33,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:25:33,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:33,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:25:33,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:33,393 INFO L349 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2024-05-05 20:25:33,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2024-05-05 20:25:33,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:33,798 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-05-05 20:25:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 62 [2024-05-05 20:25:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:34,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2024-05-05 20:25:34,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:34,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-05-05 20:25:35,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:35,201 INFO L349 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2024-05-05 20:25:35,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2024-05-05 20:25:41,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-05-05 20:25:41,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:41,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-05-05 20:25:41,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:41,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:41,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:41,744 INFO L349 Elim1Store]: treesize reduction 40, result has 48.7 percent of original size [2024-05-05 20:25:41,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 56 [2024-05-05 20:25:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:42,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 130 [2024-05-05 20:25:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:43,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 130 [2024-05-05 20:25:44,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:44,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:44,703 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2024-05-05 20:25:44,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2024-05-05 20:25:45,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:45,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:45,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:45,662 INFO L349 Elim1Store]: treesize reduction 64, result has 37.3 percent of original size [2024-05-05 20:25:45,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 59 [2024-05-05 20:25:51,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:51,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-05-05 20:25:52,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-05-05 20:25:52,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:52,293 INFO L349 Elim1Store]: treesize reduction 42, result has 48.8 percent of original size [2024-05-05 20:25:52,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 68 [2024-05-05 20:25:53,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:53,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 167 [2024-05-05 20:25:53,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:25:53,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 167 [2024-05-05 20:25:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 157 proven. 170 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-05 20:25:55,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:25:56,525 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse3 (store .cse0 .cse1 1)) (.cse4 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse3 .cse4 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0)) (not (= (select .cse3 .cse4) 0)))))) is different from false [2024-05-05 20:25:59,894 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse7 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse8 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse5 (store .cse7 .cse8 1)) (.cse6 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse10 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse5 .cse6 1)))) (let ((.cse1 (store (select (store .cse10 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse9 (select (store (store .cse10 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse1) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse4 (+ |c_~#cache~0.offset| 4))) (let ((.cse2 (store .cse9 .cse4 1)) (.cse3 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse0 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse1) |c_~#cache~0.base| (store .cse2 .cse3 1)))) (store .cse0 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse0 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse4) 0)) (not (= (select .cse5 .cse6) 0)) (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse4) 0)) (not (= (select .cse2 .cse3) 0)))))))))) is different from false [2024-05-05 20:26:00,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse3 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse0 (select (store .cse3 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse9 (store .cse0 .cse1 1)) (.cse10 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse11 (store .cse3 |c_~#cache~0.base| (store .cse9 .cse10 1)))) (let ((.cse4 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse8 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse4) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse7 (+ |c_~#cache~0.offset| 4))) (let ((.cse5 (store .cse8 .cse7 1)) (.cse6 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store (store .cse3 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse4) |c_~#cache~0.base| (store .cse5 .cse6 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0)) (not (= (select .cse8 .cse7) 0)) (not (= (select .cse9 .cse10) 0)) (not (= (select .cse5 .cse6) 0))))))))))) is different from false [2024-05-05 20:26:00,745 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse5 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse2 (select (store .cse5 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse9 (store .cse2 .cse3 1)) (.cse10 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse9 .cse10 1)))) (let ((.cse6 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse0 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse6) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse1 (+ |c_~#cache~0.offset| 4))) (let ((.cse7 (store .cse0 .cse1 1)) (.cse8 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select (select (store (let ((.cse4 (store (store .cse5 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse6) |c_~#cache~0.base| (store .cse7 .cse8 1)))) (store .cse4 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse4 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse1) 0)) (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse10) 0))))))))))) is different from false [2024-05-05 20:26:05,787 INFO L349 Elim1Store]: treesize reduction 54, result has 43.2 percent of original size [2024-05-05 20:26:05,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1912 treesize of output 760 [2024-05-05 20:26:08,999 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-05-05 20:26:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 3890 treesize of output 3747 [2024-05-05 20:26:09,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:26:09,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3275838 treesize of output 3252904 [2024-05-05 20:26:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11018 treesize of output 10506 [2024-05-05 20:26:11,414 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-05 20:26:11,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10603 treesize of output 10539 [2024-05-05 20:26:11,669 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-05-05 20:26:11,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11606 treesize of output 11498 [2024-05-05 20:26:11,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8044 treesize of output 7788 [2024-05-05 20:26:12,160 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-05 20:26:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 176 [2024-05-05 20:26:12,389 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-05 20:26:12,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1420 treesize of output 1356 [2024-05-05 20:26:14,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:26:14,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:26:14,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:26:14,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2024-05-05 20:26:15,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:26:16,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:26:16,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 1049 treesize of output 2005 [2024-05-05 20:29:25,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:29:25,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:29:25,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:29:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2024-05-05 20:29:25,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-05 20:29:25,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 20:29:25,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-05 20:29:25,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:29:25,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-05-05 20:29:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 110 proven. 200 refuted. 6 times theorem prover too weak. 142 trivial. 1 not checked. [2024-05-05 20:29:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988158027] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:29:29,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:29:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 42, 39] total 94 [2024-05-05 20:29:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332926852] [2024-05-05 20:29:29,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:29:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-05-05 20:29:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:29:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-05-05 20:29:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=7138, Unknown=133, NotChecked=716, Total=8742 [2024-05-05 20:29:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:29:30,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:29:30,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 10.606382978723405) internal successors, (997), 94 states have internal predecessors, (997), 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-05 20:29:30,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:29:30,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:29:30,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:29:30,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:29:36,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:44,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:46,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:49,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:51,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:53,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:55,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:57,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:29:59,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:02,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:05,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:07,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:09,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:11,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:13,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:15,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:24,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:27,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:29,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:31,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:33,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:36,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:38,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:40,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:42,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:45,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:47,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:49,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:51,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:53,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:56,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:30:58,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:00,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:01,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:03,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:06,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:07,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:09,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:11,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:31:16,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:19,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:22,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:27,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:29,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:31,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:33,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:35,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:39,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:41,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:43,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:45,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:47,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:49,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:51,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:53,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:55,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:31:57,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:02,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:04,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:06,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:08,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:10,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:11,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:13,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:15,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:19,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:22,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:26,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:28,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:30,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:32,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:35,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#pthreadsMutex| 4))) (let ((.cse54 (select .cse21 4))) (let ((.cse19 (= .cse54 0)) (.cse18 (exists ((|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1)))) (.cse20 (= .cse54 1)) (.cse28 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse6 (+ |c_~#cache~0.offset| 4)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (and (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse0 .cse1 1)) (.cse5 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse4 .cse5) 0)))))) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse11 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (let ((.cse9 (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse7 (store .cse9 .cse1 1)) (.cse8 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse1) 0)) (not (= (select (select (store (let ((.cse10 (store .cse11 |c_~#cache~0.base| (store .cse7 .cse8 1)))) (store .cse10 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse10 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse17 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (let ((.cse15 (select (store .cse17 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse13 (store .cse15 .cse1 1)) (.cse14 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse13 .cse14) 0)) (not (= (select .cse15 .cse1) 0)) (not (= (select (select (store (let ((.cse16 (store .cse17 |c_~#cache~0.base| (store .cse13 .cse14 1)))) (store .cse16 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse16 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (or (and .cse18 (or .cse19 (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)) .cse20))) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (<= 28 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset|))) .cse20)) (or (and .cse20 (let ((.cse22 (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)))))) (or (and .cse22 .cse18) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|))))) (and .cse22 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))))))) (and .cse19 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_t_funThread6of8ForFork0_~i~0#1| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse29 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse30 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse28 .cse29 1)))) (let ((.cse24 (store (select (store .cse30 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse27 (select (store (store .cse30 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse24) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse25 (store .cse27 .cse1 1)) (.cse26 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse23 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse24) |c_~#cache~0.base| (store .cse25 .cse26 1)))) (store .cse23 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse23 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse25 .cse26) 0)) (not (= 0 (select .cse27 .cse1))) (not (= (select .cse28 .cse29) 0))))))))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)) (or (and (or .cse19 .cse20) .cse18) (and (exists ((v_prenex_3 Int)) (and (= (select .cse21 (+ v_prenex_3 4)) 0) (<= 28 v_prenex_3))) .cse20)) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 0 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| 4) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse37 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse38 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse35 (let ((.cse36 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse37 .cse38 1)))) (store .cse36 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (let ((.cse33 (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse31 (store .cse33 .cse1 1)) (.cse32 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse31 .cse32) 0)) (not (= (select .cse33 .cse1) 0)) (not (= (select (select (store (let ((.cse34 (store .cse35 |c_~#cache~0.base| (store .cse31 .cse32 1)))) (store .cse34 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse34 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (not (= (select .cse37 .cse38) 0))))) (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread5of8ForFork0_~i~0#1| 0) (= |c_t_funThread3of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse44 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse45 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse28 .cse44 1)))) (let ((.cse43 (store (select (store .cse45 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse39 (select (store (store .cse45 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse40 (store .cse39 .cse6 1)) (.cse41 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse39 .cse6) 0)) (not (= (select .cse40 .cse41) 0)) (not (= (select (select (store (let ((.cse42 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#cache~0.base| (store .cse40 .cse41 1)))) (store .cse42 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse42 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse28 .cse44) 0))))))))) (= |c_~#cache~0.offset| 0) (<= 1 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread7of8ForFork0_~i~0#1| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse51 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse52 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse47 (let ((.cse53 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse51 .cse52 1)))) (store .cse53 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse53 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (let ((.cse50 (select (store .cse47 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse48 (store .cse50 .cse1 1)) (.cse49 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse46 (store .cse47 |c_~#cache~0.base| (store .cse48 .cse49 1)))) (store .cse46 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse46 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse50 .cse1) 0)) (not (= (select .cse48 .cse49) 0)) (not (= (select .cse51 .cse52) 0)))))))) (= |c_~#cache~0.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| 4))))) is different from false [2024-05-05 20:32:37,467 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#pthreadsMutex| 4))) (let ((.cse54 (select .cse21 4))) (let ((.cse19 (= .cse54 0)) (.cse18 (exists ((|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1)))) (.cse20 (= .cse54 1)) (.cse28 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse6 (+ |c_~#cache~0.offset| 4)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (and (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse0 .cse1 1)) (.cse5 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse4 .cse5) 0)))))) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse11 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (let ((.cse9 (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse7 (store .cse9 .cse1 1)) (.cse8 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse1) 0)) (not (= (select (select (store (let ((.cse10 (store .cse11 |c_~#cache~0.base| (store .cse7 .cse8 1)))) (store .cse10 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse10 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse17 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (let ((.cse15 (select (store .cse17 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse13 (store .cse15 .cse1 1)) (.cse14 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse13 .cse14) 0)) (not (= (select .cse15 .cse1) 0)) (not (= (select (select (store (let ((.cse16 (store .cse17 |c_~#cache~0.base| (store .cse13 .cse14 1)))) (store .cse16 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse16 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (or (and .cse18 (or .cse19 (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)) .cse20))) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (<= 28 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset|))) .cse20)) (or (and .cse20 (let ((.cse22 (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)))))) (or (and .cse22 .cse18) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|))))) (and .cse22 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))))))) (and .cse19 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse21 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse21 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_t_funThread6of8ForFork0_~i~0#1| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse29 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse30 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse28 .cse29 1)))) (let ((.cse24 (store (select (store .cse30 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse27 (select (store (store .cse30 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse24) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse25 (store .cse27 .cse1 1)) (.cse26 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse23 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse24) |c_~#cache~0.base| (store .cse25 .cse26 1)))) (store .cse23 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse23 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse25 .cse26) 0)) (not (= 0 (select .cse27 .cse1))) (not (= (select .cse28 .cse29) 0))))))))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)) (or (and (or .cse19 .cse20) .cse18) (and (exists ((v_prenex_3 Int)) (and (= (select .cse21 (+ v_prenex_3 4)) 0) (<= 28 v_prenex_3))) .cse20)) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 0 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| 4) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse37 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse38 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse35 (let ((.cse36 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse37 .cse38 1)))) (store .cse36 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (let ((.cse33 (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse31 (store .cse33 .cse1 1)) (.cse32 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse31 .cse32) 0)) (not (= (select .cse33 .cse1) 0)) (not (= (select (select (store (let ((.cse34 (store .cse35 |c_~#cache~0.base| (store .cse31 .cse32 1)))) (store .cse34 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse34 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (not (= (select .cse37 .cse38) 0))))) (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread5of8ForFork0_~i~0#1| 0) (= |c_t_funThread3of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse44 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse45 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse28 .cse44 1)))) (let ((.cse43 (store (select (store .cse45 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse39 (select (store (store .cse45 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse40 (store .cse39 .cse6 1)) (.cse41 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse39 .cse6) 0)) (not (= (select .cse40 .cse41) 0)) (not (= (select (select (store (let ((.cse42 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#cache~0.base| (store .cse40 .cse41 1)))) (store .cse42 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse42 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse28 .cse44) 0))))))))) (= |c_~#cache~0.offset| 0) (<= 1 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread7of8ForFork0_~i~0#1| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse51 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse52 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse47 (let ((.cse53 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse51 .cse52 1)))) (store .cse53 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse53 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (let ((.cse50 (select (store .cse47 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse48 (store .cse50 .cse1 1)) (.cse49 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse46 (store .cse47 |c_~#cache~0.base| (store .cse48 .cse49 1)))) (store .cse46 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse46 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse50 .cse1) 0)) (not (= (select .cse48 .cse49) 0)) (not (= (select .cse51 .cse52) 0)))))))) (= |c_~#cache~0.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| 4))))) is different from true [2024-05-05 20:32:50,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-05 20:32:52,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-05 20:32:55,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:32:59,980 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#pthreadsMutex| 4)) (.cse5 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse7 (+ |c_~#cache~0.offset| 4)) (.cse3 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse8 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (and (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse6 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0)))) (let ((.cse2 (select (store .cse6 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse0 (store .cse2 .cse3 1)) (.cse1 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select (select (store (let ((.cse4 (store .cse6 |c_~#cache~0.base| (store .cse0 .cse1 1)))) (store .cse4 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse4 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0))))))) (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse13 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0)))) (let ((.cse11 (select (store .cse13 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse9 (store .cse11 .cse3 1)) (.cse10 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse9 .cse10) 0)) (not (= (select .cse11 .cse3) 0)) (not (= (select (select (store (let ((.cse12 (store .cse13 |c_~#cache~0.base| (store .cse9 .cse10 1)))) (store .cse12 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse12 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0))))))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse19 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse20 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse21 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse19 .cse20 1)))) (let ((.cse15 (store (select (store .cse21 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))) (let ((.cse18 (select (store (store .cse21 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse15) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse16 (store .cse18 .cse3 1)) (.cse17 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse14 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse15) |c_~#cache~0.base| (store .cse16 .cse17 1)))) (store .cse14 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse14 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0)) (not (= (select .cse16 .cse17) 0)) (not (= 0 (select .cse18 .cse3))) (not (= (select .cse19 .cse20) 0))))))))) (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse22 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 0)) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse22 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse22 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| 4) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse29 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse30 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse29 .cse30 1)))) (store .cse28 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse28 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))))) (let ((.cse25 (select (store .cse27 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse23 (store .cse25 .cse3 1)) (.cse24 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse23 .cse24) 0)) (not (= (select .cse25 .cse3) 0)) (not (= (select (select (store (let ((.cse26 (store .cse27 |c_~#cache~0.base| (store .cse23 .cse24 1)))) (store .cse26 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0))))))) (not (= (select .cse29 .cse30) 0))))) (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread3of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |c_t_funThread8of8ForFork0_~i~0#1| 0) (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse22 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse22 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_~#cache~0.offset| 0) (<= |c_~#__global_lock~0.base| 3) (= (select .cse22 4) 1) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse36 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse37 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse32 (let ((.cse38 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse36 .cse37 1)))) (store .cse38 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse38 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))))) (let ((.cse35 (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse33 (store .cse35 .cse3 1)) (.cse34 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse31 (store .cse32 |c_~#cache~0.base| (store .cse33 .cse34 1)))) (store .cse31 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse31 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0)) (not (= (select .cse35 .cse3) 0)) (not (= (select .cse33 .cse34) 0)) (not (= (select .cse36 .cse37) 0)))))))) (= |c_~#cache~0.base| 4) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) is different from true [2024-05-05 20:33:02,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:04,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:06,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:08,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:10,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:12,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-05 20:33:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-05-05 20:33:21,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2024-05-05 20:33:21,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,64 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:33:21,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:33:21,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:33:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1428148498, now seen corresponding path program 1 times [2024-05-05 20:33:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:33:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785124208] [2024-05-05 20:33:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:33:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:33:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:33:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785124208] [2024-05-05 20:33:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785124208] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:33:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161641928] [2024-05-05 20:33:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:22,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:33:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:33:22,203 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:33:22,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-05-05 20:33:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:22,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 20:33:22,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:33:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:33:22,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:33:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-05 20:33:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161641928] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:33:23,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:33:23,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-05 20:33:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763261119] [2024-05-05 20:33:23,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:33:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-05 20:33:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:33:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-05 20:33:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-05 20:33:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:23,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:33:23,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.08695652173913) internal successors, (324), 23 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 20:33:23,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:23,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:23,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:23,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-05-05 20:33:23,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-05-05 20:33:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:23,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2024-05-05 20:33:23,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,65 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:33:23,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:33:23,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:33:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 106181778, now seen corresponding path program 2 times [2024-05-05 20:33:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:33:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123444866] [2024-05-05 20:33:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:33:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-05-05 20:33:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:33:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123444866] [2024-05-05 20:33:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123444866] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:33:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:33:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-05 20:33:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610083349] [2024-05-05 20:33:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:33:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-05 20:33:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:33:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-05 20:33:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-05 20:33:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:24,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:33:24,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.727272727272727) internal successors, (327), 11 states have internal predecessors, (327), 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-05 20:33:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-05-05 20:33:24,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:24,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:29,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:33:31,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:33:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:33:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-05 20:33:37,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:33:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:33:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1051252219, now seen corresponding path program 1 times [2024-05-05 20:33:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:33:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581546876] [2024-05-05 20:33:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:33:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-05-05 20:33:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:33:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581546876] [2024-05-05 20:33:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581546876] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:33:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147420871] [2024-05-05 20:33:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:33:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:33:38,668 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:33:38,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-05-05 20:33:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:39,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 87 conjunts are in the unsatisfiable core [2024-05-05 20:33:39,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:33:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:33:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:33:42,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-05 20:33:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:42,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-05 20:33:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:42,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-05 20:33:42,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-05 20:33:42,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-05 20:33:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 191 proven. 158 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2024-05-05 20:33:43,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:33:43,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7844 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7844) |c_~#cache~0.base|) (+ (* |c_t_funThread8of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:33:43,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7844 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_7844) |c_~#cache~0.base|) (+ (* |c_t_funThread8of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:33:43,292 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7844 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#cache~0.base| (store (select |c_#pthreadsMutex| |c_~#cache~0.base|) (+ (* 28 |c_t_funThread3of8ForFork0_~i~0#1|) |c_~#cache~0.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_7844) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:33:43,327 INFO L349 Elim1Store]: treesize reduction 35, result has 40.7 percent of original size [2024-05-05 20:33:43,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2024-05-05 20:33:43,350 INFO L349 Elim1Store]: treesize reduction 15, result has 57.1 percent of original size [2024-05-05 20:33:43,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 50 [2024-05-05 20:33:43,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:33:43,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2024-05-05 20:33:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 80 proven. 165 refuted. 0 times theorem prover too weak. 300 trivial. 37 not checked. [2024-05-05 20:33:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147420871] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:33:44,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:33:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 27] total 64 [2024-05-05 20:33:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600556379] [2024-05-05 20:33:44,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:33:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-05 20:33:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:33:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-05 20:33:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=3090, Unknown=17, NotChecked=360, Total=4032 [2024-05-05 20:33:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:45,282 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:33:45,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 14.734375) internal successors, (943), 64 states have internal predecessors, (943), 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-05 20:33:45,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:45,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:45,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:45,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:33:45,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:45,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:45,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-05 20:33:49,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2024-05-05 20:33:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2024-05-05 20:33:49,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:33:49,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:33:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1834771001, now seen corresponding path program 1 times [2024-05-05 20:33:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:33:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198672255] [2024-05-05 20:33:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:33:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-05-05 20:33:50,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:33:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198672255] [2024-05-05 20:33:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198672255] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 20:33:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 20:33:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-05 20:33:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949442533] [2024-05-05 20:33:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 20:33:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-05 20:33:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:33:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-05 20:33:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-05-05 20:33:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:50,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:33:50,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 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-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-05 20:33:50,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:33:52,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:33:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-05 20:33:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:33:56,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-05 20:33:56,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-05 20:33:56,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 20:33:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1499849825, now seen corresponding path program 1 times [2024-05-05 20:33:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 20:33:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443225130] [2024-05-05 20:33:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 20:33:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 206 proven. 5 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-05-05 20:33:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 20:33:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443225130] [2024-05-05 20:33:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443225130] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 20:33:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404217440] [2024-05-05 20:33:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 20:33:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 20:33:57,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 20:33:57,353 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 20:33:57,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2024-05-05 20:33:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 20:33:58,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-05 20:33:58,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 20:33:58,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 20:33:59,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:59,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-05 20:33:59,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:33:59,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-05 20:33:59,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-05 20:33:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 263 proven. 24 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-05-05 20:33:59,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 20:33:59,564 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8156 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_8156) |c_~#cache~0.base|) (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:33:59,583 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8156 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_8156) |c_~#cache~0.base|) (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-05 20:34:05,901 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2024-05-05 20:34:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 34 [2024-05-05 20:34:05,924 INFO L349 Elim1Store]: treesize reduction 11, result has 64.5 percent of original size [2024-05-05 20:34:05,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 50 [2024-05-05 20:34:05,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-05-05 20:34:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 250 proven. 20 refuted. 0 times theorem prover too weak. 300 trivial. 2 not checked. [2024-05-05 20:34:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404217440] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 20:34:06,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 20:34:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-05-05 20:34:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689407708] [2024-05-05 20:34:06,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 20:34:06,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-05 20:34:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 20:34:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-05 20:34:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1347, Unknown=10, NotChecked=154, Total=1722 [2024-05-05 20:34:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:34:06,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 20:34:06,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 14.833333333333334) internal successors, (623), 42 states have internal predecessors, (623), 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-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 20:34:06,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 20:34:17,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:19,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:21,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:23,334 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse14 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| 4)) (.cse47 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse13 (not (= |c_~#cache~0.base| |c_~#__global_lock~0.base|))) (.cse15 (not (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) (.cse16 (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|))) (.cse17 (not (= |c_~#cache~0.base| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|)))) (and (let ((.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse6 (store .cse0 .cse1 1)) (.cse7 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse11 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse6 .cse7 1)))) (let ((.cse10 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse2 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse2 .cse3 1)) (.cse5 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse2 .cse3) 0)) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse7) 0)) (not (= (select (select (store (let ((.cse8 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse8 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0))))))))))) (or .cse13 (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse0 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)))) (or (not (= (select .cse14 .cse3) 0)) .cse15 .cse16 .cse17) (<= 0 |c_t_funThread1of8ForFork0_~i~0#1|) (let ((.cse27 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse28 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse19 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse27 .cse28 1)))) (let ((.cse23 (select .cse19 |c_~#cache~0.base|)) (.cse24 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse26 (store .cse19 |c_~#cache~0.base| (store .cse23 .cse24 1)))) (let ((.cse20 (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse25 (select (store (store .cse26 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse21 (store .cse25 .cse3 1)) (.cse22 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse18 (store (store .cse19 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#cache~0.base| (store .cse21 .cse22 1)))) (store .cse18 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse18 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse23 .cse24) 0)) (not (= 0 (select .cse21 .cse22))) (not (= 0 (select .cse25 .cse3))))))))))) (not (= (select .cse27 .cse28) 0)))) (or .cse15 .cse17 (forall ((v_ArrVal_7217 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) .cse3) 0)))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse34 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse35 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse0 .cse34 1)))) (let ((.cse33 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse29 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse3 1)) (.cse31 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse29 .cse3) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#cache~0.base| (store .cse30 .cse31 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse0 .cse34) 0))))))))) (let ((.cse36 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse37 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 4))) (or (not (= (select .cse36 .cse37) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse42 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse36 .cse37 1)))) (let ((.cse44 (select .cse42 |c_~#cache~0.base|)) (.cse45 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse46 (store .cse42 |c_~#cache~0.base| (store .cse44 .cse45 1)))) (let ((.cse43 (store (select (store .cse46 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse38 (select (store (store .cse46 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse39 (store .cse38 .cse3 1)) (.cse40 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse38 .cse3) 0)) (not (= (select .cse39 .cse40) 0)) (not (= (select (select (store (let ((.cse41 (store (store .cse42 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#cache~0.base| (store .cse39 .cse40 1)))) (store .cse41 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse41 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= 0 (select .cse44 .cse45))))))))))))) (= |c_~#cache~0.offset| 0) (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse14 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (<= |c_~#__global_lock~0.base| 3) (or .cse15 .cse17 (not (= (select .cse0 .cse3) 0))) (or .cse15 (not (= (select .cse47 .cse3) 0)) (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) .cse17) (or (forall ((v_ArrVal_7217 (Array Int Int)) (|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4))))) .cse13) .cse13 (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse47 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (= |c_~#cache~0.base| 4) (or .cse15 .cse16 (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) .cse17))) is different from true [2024-05-05 20:34:25,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:27,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:29,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:40,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:42,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:45,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:55,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:57,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:34:59,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:01,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:03,881 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| 4)) (.cse86 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse13 (not (= |c_~#cache~0.base| |c_~#__global_lock~0.base|))) (.cse15 (not (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) (.cse16 (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|))) (.cse17 (not (= |c_~#cache~0.base| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|)))) (and (or (not (= (select .cse0 .cse1) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse6 (store .cse0 .cse1 1)) (.cse7 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse11 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse6 .cse7 1)))) (let ((.cse10 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse2 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse2 .cse3 1)) (.cse5 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse2 .cse3) 0)) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse7) 0)) (not (= (select (select (store (let ((.cse8 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse8 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)))))))))) (or .cse13 (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse0 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)))) (or (not (= (select .cse14 .cse3) 0)) .cse15 .cse16 .cse17) (let ((.cse27 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse28 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse19 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse27 .cse28 1)))) (let ((.cse23 (select .cse19 |c_~#cache~0.base|)) (.cse24 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse26 (store .cse19 |c_~#cache~0.base| (store .cse23 .cse24 1)))) (let ((.cse20 (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse25 (select (store (store .cse26 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse21 (store .cse25 .cse3 1)) (.cse22 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse18 (store (store .cse19 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#cache~0.base| (store .cse21 .cse22 1)))) (store .cse18 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse18 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse23 .cse24) 0)) (not (= 0 (select .cse21 .cse22))) (not (= 0 (select .cse25 .cse3))))))))))) (not (= (select .cse27 .cse28) 0)))) (or .cse15 .cse17 (forall ((v_ArrVal_7217 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) .cse3) 0)))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse34 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse35 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse0 .cse34 1)))) (let ((.cse33 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse29 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse3 1)) (.cse31 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse29 .cse3) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#cache~0.base| (store .cse30 .cse31 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse0 .cse34) 0))))))))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse45 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse46 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse37 (let ((.cse48 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse45 .cse46 1)))) (store .cse48 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse48 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse43 (select (store .cse37 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse41 (store .cse43 .cse1 1)) (.cse42 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse47 (store .cse37 |c_~#cache~0.base| (store .cse41 .cse42 1)))) (let ((.cse38 (store (select (store .cse47 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse44 (select (store (store .cse47 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse38) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse39 (store .cse44 .cse3 1)) (.cse40 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse36 (store (store .cse37 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse38) |c_~#cache~0.base| (store .cse39 .cse40 1)))) (store .cse36 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse41 .cse42) 0)) (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.offset|) (not (= (select .cse43 .cse1) 0)) (not (= (select .cse39 .cse40) 0)) (not (= (select .cse44 .cse3) 0)) (not (= (select .cse45 .cse46) 0)))))))))))) (let ((.cse49 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse50 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 4))) (or (not (= (select .cse49 .cse50) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse55 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse49 .cse50 1)))) (let ((.cse57 (select .cse55 |c_~#cache~0.base|)) (.cse58 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse59 (store .cse55 |c_~#cache~0.base| (store .cse57 .cse58 1)))) (let ((.cse56 (store (select (store .cse59 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse51 (select (store (store .cse59 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse56) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse52 (store .cse51 .cse3 1)) (.cse53 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse51 .cse3) 0)) (not (= (select .cse52 .cse53) 0)) (not (= (select (select (store (let ((.cse54 (store (store .cse55 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse56) |c_~#cache~0.base| (store .cse52 .cse53 1)))) (store .cse54 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse54 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= 0 (select .cse57 .cse58))))))))))))) (let ((.cse71 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse72 (+ |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse67 (let ((.cse70 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse71 .cse72 1)))) (store .cse70 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse70 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse63 (select (store .cse67 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse64 (store .cse63 .cse1 1)) (.cse65 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse69 (store .cse67 |c_~#cache~0.base| (store .cse64 .cse65 1)))) (let ((.cse68 (store (select (store .cse69 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse60 (select (store (store .cse69 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse68) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse61 (store .cse60 .cse3 1)) (.cse62 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse60 .cse3) 0)) (not (= 0 (select .cse61 .cse62))) (not (= (select .cse63 .cse1) 0)) (not (= (select .cse64 .cse65) 0)) (not (= (select (select (store (let ((.cse66 (store (store .cse67 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse68) |c_~#cache~0.base| (store .cse61 .cse62 1)))) (store .cse66 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse66 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0))))))))))) (not (= (select .cse71 .cse72) 0)))) (= |c_~#cache~0.offset| 0) (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse14 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (<= |c_~#__global_lock~0.base| 3) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse81 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse85 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse0 .cse81 1)))) (let ((.cse84 (store (select (store .cse85 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse80 (select (store (store .cse85 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse84) |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse74 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse84)) (.cse78 (store .cse80 .cse1 1)) (.cse79 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse83 (store .cse74 |c_~#cache~0.base| (store .cse78 .cse79 1)))) (let ((.cse75 (store (select (store .cse83 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse82 (select (store (store .cse83 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse75) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse76 (store .cse82 .cse3 1)) (.cse77 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| (+ (* |c_t_funThread1of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (select (select (store (let ((.cse73 (store (store .cse74 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse75) |c_~#cache~0.base| (store .cse76 .cse77 1)))) (store .cse73 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse73 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse78 .cse79) 0)) (not (= (select .cse76 .cse77) 0)) (not (= (select .cse80 .cse1) 0)) (not (= (select .cse0 .cse81) 0)) (not (= (select .cse82 .cse3) 0))))))))))))) (or .cse15 .cse17 (not (= (select .cse0 .cse3) 0))) (or .cse15 (not (= (select .cse86 .cse3) 0)) (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) .cse17) (or (forall ((v_ArrVal_7217 (Array Int Int)) (|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4))))) .cse13) .cse13 (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse86 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (= |c_~#cache~0.base| 4) (or .cse15 .cse16 (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) .cse17))) is different from true [2024-05-05 20:35:15,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:18,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:20,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:31,955 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse8 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse21 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse16 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse1 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| 4)) (.cse49 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse0 (not (= |c_~#cache~0.base| |c_~#__global_lock~0.base|))) (.cse4 (not (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) (.cse5 (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|))) (.cse6 (not (= |c_~#cache~0.base| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|)))) (and (or .cse0 (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse1 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)))) (or (not (= (select .cse2 .cse3) 0)) .cse4 .cse5 .cse6) (or .cse4 .cse6 (forall ((v_ArrVal_7217 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) .cse3) 0)))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse18 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse19 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse9 (let ((.cse22 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse18 .cse19 1)))) (store .cse22 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse22 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse15 (select (store .cse9 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse13 (store .cse15 .cse16 1)) (.cse14 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse20 (store .cse9 |c_~#cache~0.base| (store .cse13 .cse14 1)))) (let ((.cse10 (store (select (store .cse20 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse21 0))) (let ((.cse17 (select (store (store .cse20 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse11 (store .cse17 .cse3 1)) (.cse12 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse7 (store (store .cse9 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#cache~0.base| (store .cse11 .cse12 1)))) (store .cse7 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse7 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse13 .cse14) 0)) (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.offset|) (not (= (select .cse15 .cse16) 0)) (not (= (select .cse11 .cse12) 0)) (not (= (select .cse17 .cse3) 0)) (not (= (select .cse18 .cse19) 0)))))))))))) (let ((.cse34 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse35 (+ |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse30 (let ((.cse33 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse34 .cse35 1)))) (store .cse33 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse33 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse26 (select (store .cse30 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse27 (store .cse26 .cse16 1)) (.cse28 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse32 (store .cse30 |c_~#cache~0.base| (store .cse27 .cse28 1)))) (let ((.cse31 (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse21 0))) (let ((.cse23 (select (store (store .cse32 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse31) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse24 (store .cse23 .cse3 1)) (.cse25 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse23 .cse3) 0)) (not (= 0 (select .cse24 .cse25))) (not (= (select .cse26 .cse16) 0)) (not (= (select .cse27 .cse28) 0)) (not (= (select (select (store (let ((.cse29 (store (store .cse30 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse31) |c_~#cache~0.base| (store .cse24 .cse25 1)))) (store .cse29 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse29 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0))))))))))) (not (= (select .cse34 .cse35) 0)))) (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse2 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse44 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse48 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse1 .cse44 1)))) (let ((.cse47 (store (select (store .cse48 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse43 (select (store (store .cse48 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse47) |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse37 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse47)) (.cse41 (store .cse43 .cse16 1)) (.cse42 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse46 (store .cse37 |c_~#cache~0.base| (store .cse41 .cse42 1)))) (let ((.cse38 (store (select (store .cse46 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse21 0))) (let ((.cse45 (select (store (store .cse46 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse38) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse39 (store .cse45 .cse3 1)) (.cse40 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| (+ (* |c_t_funThread1of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (select (select (store (let ((.cse36 (store (store .cse37 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse38) |c_~#cache~0.base| (store .cse39 .cse40 1)))) (store .cse36 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse41 .cse42) 0)) (not (= (select .cse39 .cse40) 0)) (not (= (select .cse43 .cse16) 0)) (not (= (select .cse1 .cse44) 0)) (not (= (select .cse45 .cse3) 0))))))))))))) (or .cse4 .cse6 (not (= (select .cse1 .cse3) 0))) (or .cse4 (not (= (select .cse49 .cse3) 0)) (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) .cse6) (or (forall ((v_ArrVal_7217 (Array Int Int)) (|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4))))) .cse0) .cse0 (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse49 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse0) (or .cse4 .cse5 (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) .cse6))) is different from true [2024-05-05 20:35:51,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:53,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:56,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:35:58,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:02,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:06,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:07,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:09,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:11,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:13,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:15,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:17,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:19,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:27,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:29,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:31,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:33,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:35,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:37,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:38,787 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-05 20:36:39,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (61)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Forceful destruction successful, exit code 0 [2024-05-05 20:36:39,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 20:36:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-05 20:36:39,889 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-05 20:36:39,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2024-05-05 20:36:39,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2024-05-05 20:36:39,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-05-05 20:36:39,890 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2024-05-05 20:36:39,891 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-05-05 20:36:39,904 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 8 thread instances [2024-05-05 20:36:39,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 20:36:39,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 08:36:39 BasicIcfg [2024-05-05 20:36:39,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 20:36:39,915 INFO L158 Benchmark]: Toolchain (without parser) took 851633.29ms. Allocated memory was 280.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 209.1MB in the beginning and 896.2MB in the end (delta: -687.1MB). Peak memory consumption was 453.2MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,915 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 280.0MB. Free memory is still 249.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 20:36:39,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.62ms. Allocated memory is still 280.0MB. Free memory was 208.6MB in the beginning and 178.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.46ms. Allocated memory is still 280.0MB. Free memory was 178.7MB in the beginning and 248.7MB in the end (delta: -70.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,915 INFO L158 Benchmark]: Boogie Preprocessor took 60.39ms. Allocated memory is still 280.0MB. Free memory was 248.7MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,915 INFO L158 Benchmark]: RCFGBuilder took 551.14ms. Allocated memory is still 280.0MB. Free memory was 247.1MB in the beginning and 217.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,916 INFO L158 Benchmark]: TraceAbstraction took 850423.41ms. Allocated memory was 280.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 216.7MB in the beginning and 896.2MB in the end (delta: -679.5MB). Peak memory consumption was 460.9MB. Max. memory is 8.0GB. [2024-05-05 20:36:39,916 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.10ms. Allocated memory is still 280.0MB. Free memory is still 249.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.62ms. Allocated memory is still 280.0MB. Free memory was 208.6MB in the beginning and 178.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 100.46ms. Allocated memory is still 280.0MB. Free memory was 178.7MB in the beginning and 248.7MB in the end (delta: -70.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.39ms. Allocated memory is still 280.0MB. Free memory was 248.7MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 551.14ms. Allocated memory is still 280.0MB. Free memory was 247.1MB in the beginning and 217.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 850423.41ms. Allocated memory was 280.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 216.7MB in the beginning and 896.2MB in the end (delta: -679.5MB). Peak memory consumption was 460.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 485, independent: 355, independent conditional: 355, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 355, independent: 355, independent conditional: 355, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355, independent: 355, independent conditional: 355, 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: 355, independent: 355, independent conditional: 355, 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: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 77, independent: 77, independent conditional: 21, independent unconditional: 56, 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: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 355, independent: 278, independent conditional: 134, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 77, unknown conditional: 21, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 21, Positive unconditional cache size: 56, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 355, independent: 355, independent conditional: 155, independent unconditional: 200, 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: 77, independent: 77, independent conditional: 21, independent unconditional: 56, 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: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 355, independent: 278, independent conditional: 134, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 77, unknown conditional: 21, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 21, Positive unconditional cache size: 56, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 130 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2756, independent: 2287, independent conditional: 2287, independent unconditional: 0, dependent: 469, dependent conditional: 469, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2287, independent: 2287, independent conditional: 2287, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2287, independent: 2287, independent conditional: 2287, 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: 2287, independent: 2287, independent conditional: 2287, 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: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 402, independent: 402, independent conditional: 132, independent unconditional: 270, 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: 402, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2287, independent: 1885, independent conditional: 854, independent unconditional: 1031, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 132, unknown unconditional: 270] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 132, Positive unconditional cache size: 270, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 2287, independent: 2287, independent conditional: 986, independent unconditional: 1301, 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: 402, independent: 402, independent conditional: 132, independent unconditional: 270, 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: 402, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2287, independent: 1885, independent conditional: 854, independent unconditional: 1031, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 132, unknown unconditional: 270] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 132, Positive unconditional cache size: 270, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 469 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8878, independent: 7683, independent conditional: 7683, independent unconditional: 0, dependent: 1195, dependent conditional: 1195, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7683, independent: 7683, independent conditional: 7683, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7683, independent: 7683, independent conditional: 7683, 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: 7683, independent: 7683, independent conditional: 7683, 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: 7683, independent: 7683, independent conditional: 3268, independent unconditional: 4415, 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: 7683, independent: 7683, independent conditional: 3117, independent unconditional: 4566, 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: 7683, independent: 7683, independent conditional: 3117, independent unconditional: 4566, 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: 894, independent: 894, independent conditional: 254, independent unconditional: 640, 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: 894, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7683, independent: 6789, independent conditional: 2863, independent unconditional: 3926, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 894, unknown conditional: 254, unknown unconditional: 640] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 254, Positive unconditional cache size: 640, 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: 151, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7683, independent: 7683, independent conditional: 3268, independent unconditional: 4415, 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: 7683, independent: 7683, independent conditional: 3117, independent unconditional: 4566, 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: 7683, independent: 7683, independent conditional: 3117, independent unconditional: 4566, 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: 894, independent: 894, independent conditional: 254, independent unconditional: 640, 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: 894, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7683, independent: 6789, independent conditional: 2863, independent unconditional: 3926, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 894, unknown conditional: 254, unknown unconditional: 640] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 254, Positive unconditional cache size: 640, 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: 151 ], Independence queries for same thread: 1195 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21827, independent: 19502, independent conditional: 19502, independent unconditional: 0, dependent: 2325, dependent conditional: 2325, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19502, independent: 19502, independent conditional: 19502, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19502, independent: 19502, independent conditional: 19502, 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: 19502, independent: 19502, independent conditional: 19502, 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: 19508, independent: 19502, independent conditional: 8140, independent unconditional: 11362, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19508, independent: 19502, independent conditional: 7955, independent unconditional: 11547, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19508, independent: 19502, independent conditional: 7955, independent unconditional: 11547, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1871, independent: 1867, independent conditional: 600, independent unconditional: 1267, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1871, independent: 1853, independent conditional: 0, independent unconditional: 1853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 51, independent conditional: 7, independent unconditional: 43, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19508, independent: 17635, independent conditional: 7355, independent unconditional: 10280, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1871, unknown conditional: 602, unknown unconditional: 1269] , Statistics on independence cache: Total cache size (in pairs): 1871, Positive cache size: 1867, Positive conditional cache size: 600, Positive unconditional cache size: 1267, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 185, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19508, independent: 19502, independent conditional: 8140, independent unconditional: 11362, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19508, independent: 19502, independent conditional: 7955, independent unconditional: 11547, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19508, independent: 19502, independent conditional: 7955, independent unconditional: 11547, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1871, independent: 1867, independent conditional: 600, independent unconditional: 1267, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1871, independent: 1853, independent conditional: 0, independent unconditional: 1853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 51, independent conditional: 7, independent unconditional: 43, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19508, independent: 17635, independent conditional: 7355, independent unconditional: 10280, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1871, unknown conditional: 602, unknown unconditional: 1269] , Statistics on independence cache: Total cache size (in pairs): 1871, Positive cache size: 1867, Positive conditional cache size: 600, Positive unconditional cache size: 1267, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 185 ], Independence queries for same thread: 2325 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 60675, independent: 55662, independent conditional: 55662, independent unconditional: 0, dependent: 5013, dependent conditional: 5013, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55684, independent: 55662, independent conditional: 55662, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55684, independent: 55662, independent conditional: 55662, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55684, independent: 55662, independent conditional: 55662, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21968, independent unconditional: 33694, dependent: 133, dependent conditional: 63, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21022, independent unconditional: 34640, dependent: 133, dependent conditional: 52, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21022, independent unconditional: 34640, dependent: 133, dependent conditional: 52, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3339, independent: 3300, independent conditional: 969, independent unconditional: 2331, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3339, independent: 3251, independent conditional: 0, independent unconditional: 3251, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 88, independent: 49, independent conditional: 29, independent unconditional: 20, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 49, independent conditional: 29, independent unconditional: 20, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 90, independent conditional: 45, independent unconditional: 44, dependent: 73, dependent conditional: 55, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 55795, independent: 52362, independent conditional: 20053, independent unconditional: 32309, dependent: 94, dependent conditional: 24, dependent unconditional: 70, unknown: 3339, unknown conditional: 997, unknown unconditional: 2342] , Statistics on independence cache: Total cache size (in pairs): 3339, Positive cache size: 3300, Positive conditional cache size: 969, Positive unconditional cache size: 2331, Negative cache size: 39, Negative conditional cache size: 28, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 957, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21968, independent unconditional: 33694, dependent: 133, dependent conditional: 63, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21022, independent unconditional: 34640, dependent: 133, dependent conditional: 52, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55795, independent: 55662, independent conditional: 21022, independent unconditional: 34640, dependent: 133, dependent conditional: 52, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3339, independent: 3300, independent conditional: 969, independent unconditional: 2331, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3339, independent: 3251, independent conditional: 0, independent unconditional: 3251, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 88, independent: 49, independent conditional: 29, independent unconditional: 20, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 49, independent conditional: 29, independent unconditional: 20, dependent: 39, dependent conditional: 28, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 90, independent conditional: 45, independent unconditional: 44, dependent: 73, dependent conditional: 55, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 55795, independent: 52362, independent conditional: 20053, independent unconditional: 32309, dependent: 94, dependent conditional: 24, dependent unconditional: 70, unknown: 3339, unknown conditional: 997, unknown unconditional: 2342] , Statistics on independence cache: Total cache size (in pairs): 3339, Positive cache size: 3300, Positive conditional cache size: 969, Positive unconditional cache size: 2331, Negative cache size: 39, Negative conditional cache size: 28, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 957 ], Independence queries for same thread: 4991 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 131060, independent: 121670, independent conditional: 121670, independent unconditional: 0, dependent: 9390, dependent conditional: 9390, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121715, independent: 121670, independent conditional: 121670, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121715, independent: 121670, independent conditional: 121670, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121715, independent: 121670, independent conditional: 121670, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 47465, independent unconditional: 74205, dependent: 302, dependent conditional: 174, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 45580, independent unconditional: 76090, dependent: 302, dependent conditional: 135, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 45580, independent unconditional: 76090, dependent: 302, dependent conditional: 135, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5353, independent: 5296, independent conditional: 1556, independent unconditional: 3740, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5353, independent: 5230, independent conditional: 0, independent unconditional: 5230, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 123, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 123, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 123, independent conditional: 41, independent unconditional: 83, dependent: 106, dependent conditional: 87, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 121972, independent: 116374, independent conditional: 44024, independent unconditional: 72350, dependent: 245, dependent conditional: 91, dependent unconditional: 154, unknown: 5353, unknown conditional: 1600, unknown unconditional: 3753] , Statistics on independence cache: Total cache size (in pairs): 5353, Positive cache size: 5296, Positive conditional cache size: 1556, Positive unconditional cache size: 3740, Negative cache size: 57, Negative conditional cache size: 44, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1924, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 47465, independent unconditional: 74205, dependent: 302, dependent conditional: 174, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 45580, independent unconditional: 76090, dependent: 302, dependent conditional: 135, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121972, independent: 121670, independent conditional: 45580, independent unconditional: 76090, dependent: 302, dependent conditional: 135, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5353, independent: 5296, independent conditional: 1556, independent unconditional: 3740, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5353, independent: 5230, independent conditional: 0, independent unconditional: 5230, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 123, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 123, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 57, dependent conditional: 44, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 123, independent conditional: 41, independent unconditional: 83, dependent: 106, dependent conditional: 87, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 121972, independent: 116374, independent conditional: 44024, independent unconditional: 72350, dependent: 245, dependent conditional: 91, dependent unconditional: 154, unknown: 5353, unknown conditional: 1600, unknown unconditional: 3753] , Statistics on independence cache: Total cache size (in pairs): 5353, Positive cache size: 5296, Positive conditional cache size: 1556, Positive unconditional cache size: 3740, Negative cache size: 57, Negative conditional cache size: 44, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1924 ], Independence queries for same thread: 9345 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228991, independent: 213912, independent conditional: 213912, independent unconditional: 0, dependent: 15079, dependent conditional: 15079, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 213976, independent: 213912, independent conditional: 213912, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213976, independent: 213912, independent conditional: 213912, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213976, independent: 213912, independent conditional: 213912, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 82097, independent unconditional: 131815, dependent: 527, dependent conditional: 346, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 77300, independent unconditional: 136612, dependent: 527, dependent conditional: 240, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 77300, independent unconditional: 136612, dependent: 527, dependent conditional: 240, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7504, independent: 7420, independent conditional: 2080, independent unconditional: 5340, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7504, independent: 7310, independent conditional: 0, independent unconditional: 7310, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 194, independent: 110, independent conditional: 51, independent unconditional: 59, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 194, independent: 110, independent conditional: 51, independent unconditional: 59, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, independent: 135, independent conditional: 45, independent unconditional: 90, dependent: 171, dependent conditional: 148, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 214439, independent: 206492, independent conditional: 75220, independent unconditional: 131272, dependent: 443, dependent conditional: 173, dependent unconditional: 270, unknown: 7504, unknown conditional: 2147, unknown unconditional: 5357] , Statistics on independence cache: Total cache size (in pairs): 7504, Positive cache size: 7420, Positive conditional cache size: 2080, Positive unconditional cache size: 5340, Negative cache size: 84, Negative conditional cache size: 67, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4903, Maximal queried relation: 12, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 82097, independent unconditional: 131815, dependent: 527, dependent conditional: 346, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 77300, independent unconditional: 136612, dependent: 527, dependent conditional: 240, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214439, independent: 213912, independent conditional: 77300, independent unconditional: 136612, dependent: 527, dependent conditional: 240, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7504, independent: 7420, independent conditional: 2080, independent unconditional: 5340, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7504, independent: 7310, independent conditional: 0, independent unconditional: 7310, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 194, independent: 110, independent conditional: 51, independent unconditional: 59, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 194, independent: 110, independent conditional: 51, independent unconditional: 59, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, independent: 135, independent conditional: 45, independent unconditional: 90, dependent: 171, dependent conditional: 148, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 214439, independent: 206492, independent conditional: 75220, independent unconditional: 131272, dependent: 443, dependent conditional: 173, dependent unconditional: 270, unknown: 7504, unknown conditional: 2147, unknown unconditional: 5357] , Statistics on independence cache: Total cache size (in pairs): 7504, Positive cache size: 7420, Positive conditional cache size: 2080, Positive unconditional cache size: 5340, Negative cache size: 84, Negative conditional cache size: 67, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4903 ], Independence queries for same thread: 15015 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 293638, independent: 276136, independent conditional: 276136, independent unconditional: 0, dependent: 17502, dependent conditional: 17502, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 276214, independent: 276136, independent conditional: 276136, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276214, independent: 276136, independent conditional: 276136, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 276214, independent: 276136, independent conditional: 276136, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 111339, independent unconditional: 164797, dependent: 325, dependent conditional: 148, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 110223, independent unconditional: 165913, dependent: 325, dependent conditional: 104, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 110223, independent unconditional: 165913, dependent: 325, dependent conditional: 104, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10032, independent: 9921, independent conditional: 3039, independent unconditional: 6882, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10032, independent: 9788, independent conditional: 0, independent unconditional: 9788, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 244, independent: 133, independent conditional: 69, independent unconditional: 64, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 244, independent: 133, independent conditional: 69, independent unconditional: 64, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 298, independent: 114, independent conditional: 33, independent unconditional: 82, dependent: 183, dependent conditional: 138, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276461, independent: 266215, independent conditional: 107184, independent unconditional: 159031, dependent: 214, dependent conditional: 27, dependent unconditional: 187, unknown: 10032, unknown conditional: 3116, unknown unconditional: 6916] , Statistics on independence cache: Total cache size (in pairs): 10032, Positive cache size: 9921, Positive conditional cache size: 3039, Positive unconditional cache size: 6882, Negative cache size: 111, Negative conditional cache size: 77, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1160, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 111339, independent unconditional: 164797, dependent: 325, dependent conditional: 148, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 110223, independent unconditional: 165913, dependent: 325, dependent conditional: 104, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276461, independent: 276136, independent conditional: 110223, independent unconditional: 165913, dependent: 325, dependent conditional: 104, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10032, independent: 9921, independent conditional: 3039, independent unconditional: 6882, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10032, independent: 9788, independent conditional: 0, independent unconditional: 9788, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 244, independent: 133, independent conditional: 69, independent unconditional: 64, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 244, independent: 133, independent conditional: 69, independent unconditional: 64, dependent: 111, dependent conditional: 77, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 298, independent: 114, independent conditional: 33, independent unconditional: 82, dependent: 183, dependent conditional: 138, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276461, independent: 266215, independent conditional: 107184, independent unconditional: 159031, dependent: 214, dependent conditional: 27, dependent unconditional: 187, unknown: 10032, unknown conditional: 3116, unknown unconditional: 6916] , Statistics on independence cache: Total cache size (in pairs): 10032, Positive cache size: 9921, Positive conditional cache size: 3039, Positive unconditional cache size: 6882, Negative cache size: 111, Negative conditional cache size: 77, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1160 ], Independence queries for same thread: 17424 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 288 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, 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: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 985 SizeOfPredicates, 22 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 50/443 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 351 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, 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: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 948 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2660 SizeOfPredicates, 35 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 474/1097 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 414 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.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: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1711 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2354 ConstructedInterpolants, 0 QuantifiedInterpolants, 7058 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1646 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 2435/3108 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 477 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.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: 122, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2150 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2986 ConstructedInterpolants, 83 QuantifiedInterpolants, 13195 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2064 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 3054/3787 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 540 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 4.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: 186, 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.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 3936 NumberOfCodeBlocks, 3874 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5363 ConstructedInterpolants, 83 QuantifiedInterpolants, 28792 SizeOfPredicates, 82 NumberOfNonLiveVariables, 3728 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 6195/7188 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, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 6 thread instances CFG has 8 procedures, 603 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 9.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: 274, 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.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 6316 NumberOfCodeBlocks, 6259 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8840 ConstructedInterpolants, 83 QuantifiedInterpolants, 43779 SizeOfPredicates, 120 NumberOfNonLiveVariables, 6380 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 11264/12599 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, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 7 thread instances CFG has 9 procedures, 666 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 102.7s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 14.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: 360, 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.6s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 72.7s InterpolantComputationTime, 9003 NumberOfCodeBlocks, 8951 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 12752 ConstructedInterpolants, 294 QuantifiedInterpolants, 72231 SizeOfPredicates, 195 NumberOfNonLiveVariables, 9238 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 17409/19576 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, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 8 thread instances CFG has 10 procedures, 729 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 675.7s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 408.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: 278, 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.3s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 256.5s InterpolantComputationTime, 5826 NumberOfCodeBlocks, 5779 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 8126 ConstructedInterpolants, 478 QuantifiedInterpolants, 108857 SizeOfPredicates, 128 NumberOfNonLiveVariables, 5336 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 8773/10179 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, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown