/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 17:38:49,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 17:38:49,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 17:38:49,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 17:38:49,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 17:38:49,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 17:38:49,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 17:38:49,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 17:38:49,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 17:38:49,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 17:38:49,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 17:38:49,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 17:38:49,136 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 17:38:49,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 17:38:49,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 17:38:49,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 17:38:49,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 17:38:49,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 17:38:49,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 17:38:49,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 17:38:49,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 17:38:49,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 17:38:49,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 17:38:49,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 17:38:49,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 17:38:49,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 17:38:49,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 17:38:49,140 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 17:38:49,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 17:38:49,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 17:38:49,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 17:38:49,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 17:38:49,143 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 17:38:49,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 17:38:49,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 17:38:49,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 17:38:49,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 17:38:49,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 17:38:49,404 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 17:38:49,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2024-05-06 17:38:50,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 17:38:50,625 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 17:38:50,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2024-05-06 17:38:50,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d0d00eb57/7df781891cea4a3eb32f4301793b2a58/FLAGbc7fbfb84 [2024-05-06 17:38:50,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d0d00eb57/7df781891cea4a3eb32f4301793b2a58 [2024-05-06 17:38:50,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 17:38:50,643 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 17:38:50,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 17:38:50,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 17:38:50,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 17:38:50,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d97d5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50, skipping insertion in model container [2024-05-06 17:38:50,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,665 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 17:38:50,774 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3089,3102] [2024-05-06 17:38:50,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 17:38:50,783 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 17:38:50,799 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3089,3102] [2024-05-06 17:38:50,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 17:38:50,805 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 17:38:50,805 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 17:38:50,810 INFO L206 MainTranslator]: Completed translation [2024-05-06 17:38:50,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50 WrapperNode [2024-05-06 17:38:50,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 17:38:50,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 17:38:50,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 17:38:50,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 17:38:50,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,838 INFO L138 Inliner]: procedures = 22, calls = 55, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 164 [2024-05-06 17:38:50,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 17:38:50,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 17:38:50,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 17:38:50,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 17:38:50,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 17:38:50,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 17:38:50,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 17:38:50,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 17:38:50,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (1/1) ... [2024-05-06 17:38:50,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 17:38:50,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:38:50,889 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-06 17:38:50,898 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-06 17:38:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 17:38:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 17:38:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 17:38:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 17:38:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 17:38:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 17:38:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 17:38:50,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 17:38:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 17:38:50,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 17:38:50,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 17:38:50,928 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 17:38:51,015 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 17:38:51,016 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 17:38:51,201 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 17:38:51,242 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 17:38:51,242 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 17:38:51,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:38:51 BoogieIcfgContainer [2024-05-06 17:38:51,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 17:38:51,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 17:38:51,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 17:38:51,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 17:38:51,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:38:50" (1/3) ... [2024-05-06 17:38:51,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509cd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:38:51, skipping insertion in model container [2024-05-06 17:38:51,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:38:50" (2/3) ... [2024-05-06 17:38:51,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509cd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:38:51, skipping insertion in model container [2024-05-06 17:38:51,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:38:51" (3/3) ... [2024-05-06 17:38:51,252 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2024-05-06 17:38:51,258 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 17:38:51,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 17:38:51,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 17:38:51,266 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 17:38:51,323 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 17:38:51,354 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 17:38:51,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 17:38:51,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:38:51,355 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-06 17:38:51,356 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-06 17:38:51,394 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 17:38:51,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:51,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 17:38:51,414 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;@58f8010a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 17:38:51,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 17:38:51,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:38:51,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2129780817, now seen corresponding path program 1 times [2024-05-06 17:38:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:38:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504732535] [2024-05-06 17:38:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:38:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504732535] [2024-05-06 17:38:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504732535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:38:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:38:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 17:38:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104090323] [2024-05-06 17:38:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:38:51,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 17:38:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:38:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 17:38:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 17:38:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:51,839 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:38:51,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:38:51,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 17:38:51,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:38:51,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1476311126, now seen corresponding path program 1 times [2024-05-06 17:38:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:38:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726671857] [2024-05-06 17:38:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:38:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726671857] [2024-05-06 17:38:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726671857] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:38:52,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:38:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-06 17:38:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563302411] [2024-05-06 17:38:52,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:38:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 17:38:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:38:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 17:38:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-06 17:38:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:52,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:38:52,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:38:52,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:52,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -426759160, now seen corresponding path program 1 times [2024-05-06 17:38:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:52,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1393109004, now seen corresponding path program 2 times [2024-05-06 17:38:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 17:38:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-06 17:38:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash -426759160, now seen corresponding path program 3 times [2024-05-06 17:38:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1657464604, now seen corresponding path program 1 times [2024-05-06 17:38:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash 521426791, now seen corresponding path program 1 times [2024-05-06 17:38:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:53,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1530696446, now seen corresponding path program 1 times [2024-05-06 17:38:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1751884970, now seen corresponding path program 1 times [2024-05-06 17:38:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 17:38:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-05-06 17:38:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash -426759160, now seen corresponding path program 4 times [2024-05-06 17:38:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1657464604, now seen corresponding path program 2 times [2024-05-06 17:38:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 521426791, now seen corresponding path program 2 times [2024-05-06 17:38:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1530696446, now seen corresponding path program 2 times [2024-05-06 17:38:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:54,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2103963749, now seen corresponding path program 1 times [2024-05-06 17:38:55,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 17:38:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-05-06 17:38:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -426759160, now seen corresponding path program 5 times [2024-05-06 17:38:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1657464604, now seen corresponding path program 3 times [2024-05-06 17:38:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash 521426791, now seen corresponding path program 3 times [2024-05-06 17:38:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:55,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -389144577, now seen corresponding path program 1 times [2024-05-06 17:38:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:56,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 17:38:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2024-05-06 17:38:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -426759160, now seen corresponding path program 6 times [2024-05-06 17:38:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1657464604, now seen corresponding path program 4 times [2024-05-06 17:38:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash 521426791, now seen corresponding path program 4 times [2024-05-06 17:38:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:56,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 789804141, now seen corresponding path program 1 times [2024-05-06 17:38:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:57,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1285875066, now seen corresponding path program 1 times [2024-05-06 17:38:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:57,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:38:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:38:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash -690434571, now seen corresponding path program 2 times [2024-05-06 17:38:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 17:38:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2024-05-06 17:38:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 17:38:58,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:38:58,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1749264878, now seen corresponding path program 2 times [2024-05-06 17:38:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:38:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526468983] [2024-05-06 17:38:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:38:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526468983] [2024-05-06 17:38:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526468983] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:38:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:38:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 17:38:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497518101] [2024-05-06 17:38:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:38:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 17:38:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:38:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 17:38:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-06 17:38:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:38:58,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:38:58,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:58,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:58,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-06 17:38:58,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:38:58,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -458699744, now seen corresponding path program 3 times [2024-05-06 17:38:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:38:58,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400637833] [2024-05-06 17:38:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:38:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400637833] [2024-05-06 17:38:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400637833] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:38:58,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:38:58,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 17:38:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723416170] [2024-05-06 17:38:58,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:38:58,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 17:38:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:38:58,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 17:38:58,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-06 17:38:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:38:58,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:38:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:59,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-06 17:38:59,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:38:59,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:38:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2096490234, now seen corresponding path program 4 times [2024-05-06 17:38:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:38:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025814637] [2024-05-06 17:38:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:38:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:38:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:38:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:38:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:38:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025814637] [2024-05-06 17:38:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025814637] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:38:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:38:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-06 17:38:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401609174] [2024-05-06 17:38:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:38:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 17:38:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:38:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 17:38:59,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-06 17:38:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:59,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:38:59,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:38:59,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:38:59,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:38:59,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:59,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:38:59,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:00,300 INFO L85 PathProgramCache]: Analyzing trace with hash 144390364, now seen corresponding path program 2 times [2024-05-06 17:39:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:39:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1667750904, now seen corresponding path program 1 times [2024-05-06 17:39:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:39:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1239506589, now seen corresponding path program 1 times [2024-05-06 17:39:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:39:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:00,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34 [2024-05-06 17:39:00,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:39:00,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:39:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash 631733698, now seen corresponding path program 5 times [2024-05-06 17:39:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:39:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720289745] [2024-05-06 17:39:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:39:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:39:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:39:00,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720289745] [2024-05-06 17:39:00,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720289745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:39:00,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:39:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 17:39:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713574729] [2024-05-06 17:39:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:39:00,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 17:39:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:39:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 17:39:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 17:39:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:00,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:39:00,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:00,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1229615401, now seen corresponding path program 3 times [2024-05-06 17:39:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:01,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:39:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:39:01,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-05-06 17:39:01,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:39:01,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:39:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1869713338, now seen corresponding path program 6 times [2024-05-06 17:39:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:39:01,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799697127] [2024-05-06 17:39:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:39:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:39:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:39:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799697127] [2024-05-06 17:39:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799697127] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:39:02,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:39:02,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 17:39:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069886180] [2024-05-06 17:39:02,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:39:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 17:39:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:39:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 17:39:02,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-06 17:39:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:02,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:39:02,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:39:02,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:02,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:02,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:02,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:02,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:02,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:39:02,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 17:39:02,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-06 17:39:02,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:39:02,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:39:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -295977832, now seen corresponding path program 7 times [2024-05-06 17:39:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:39:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243368933] [2024-05-06 17:39:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:39:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:39:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:39:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:39:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:39:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243368933] [2024-05-06 17:39:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243368933] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:39:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:39:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 17:39:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295156751] [2024-05-06 17:39:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:39:03,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 17:39:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:39:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 17:39:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-06 17:39:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:03,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:39:03,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-06 17:39:03,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:39:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 17:39:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 17:39:03,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 17:39:03,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 17:39:03,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 17:39:03,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 17:39:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-06 17:39:03,900 INFO L448 BasicCegarLoop]: Path program histogram: [7, 6, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-05-06 17:39:03,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 17:39:03,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 17:39:03,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:39:03 BasicIcfg [2024-05-06 17:39:03,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 17:39:03,905 INFO L158 Benchmark]: Toolchain (without parser) took 13262.32ms. Allocated memory was 340.8MB in the beginning and 771.8MB in the end (delta: 431.0MB). Free memory was 269.3MB in the beginning and 585.1MB in the end (delta: -315.7MB). Peak memory consumption was 116.3MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,906 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 340.8MB. Free memory is still 308.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 17:39:03,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.57ms. Allocated memory is still 340.8MB. Free memory was 269.1MB in the beginning and 257.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.87ms. Allocated memory is still 340.8MB. Free memory was 257.5MB in the beginning and 255.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,907 INFO L158 Benchmark]: Boogie Preprocessor took 23.37ms. Allocated memory is still 340.8MB. Free memory was 255.5MB in the beginning and 254.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,907 INFO L158 Benchmark]: RCFGBuilder took 380.33ms. Allocated memory is still 340.8MB. Free memory was 254.2MB in the beginning and 299.4MB in the end (delta: -45.2MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,908 INFO L158 Benchmark]: TraceAbstraction took 12660.02ms. Allocated memory was 340.8MB in the beginning and 771.8MB in the end (delta: 431.0MB). Free memory was 298.3MB in the beginning and 585.1MB in the end (delta: -286.7MB). Peak memory consumption was 144.2MB. Max. memory is 8.0GB. [2024-05-06 17:39:03,909 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 340.8MB. Free memory is still 308.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.57ms. Allocated memory is still 340.8MB. Free memory was 269.1MB in the beginning and 257.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.87ms. Allocated memory is still 340.8MB. Free memory was 257.5MB in the beginning and 255.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.37ms. Allocated memory is still 340.8MB. Free memory was 255.5MB in the beginning and 254.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 380.33ms. Allocated memory is still 340.8MB. Free memory was 254.2MB in the beginning and 299.4MB in the end (delta: -45.2MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 12660.02ms. Allocated memory was 340.8MB in the beginning and 771.8MB in the end (delta: 431.0MB). Free memory was 298.3MB in the beginning and 585.1MB in the end (delta: -286.7MB). Peak memory consumption was 144.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 86384, independent: 86011, independent conditional: 85973, independent unconditional: 38, dependent: 373, dependent conditional: 373, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86362, independent: 86011, independent conditional: 85973, independent unconditional: 38, dependent: 351, dependent conditional: 351, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86362, independent: 86011, independent conditional: 85973, independent unconditional: 38, dependent: 351, dependent conditional: 351, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86362, independent: 86011, independent conditional: 85973, independent unconditional: 38, dependent: 351, dependent conditional: 351, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 42031, independent unconditional: 43980, dependent: 1847, dependent conditional: 1496, dependent unconditional: 351, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 19099, independent unconditional: 66912, dependent: 1847, dependent conditional: 1226, dependent unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 19099, independent unconditional: 66912, dependent: 1847, dependent conditional: 1226, dependent unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 722, independent: 601, independent conditional: 126, independent unconditional: 475, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 722, independent: 585, independent conditional: 0, independent unconditional: 585, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 137, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 137, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 25, independent conditional: 12, independent unconditional: 14, dependent: 173, dependent conditional: 128, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 87858, independent: 85410, independent conditional: 18973, independent unconditional: 66437, dependent: 1726, dependent conditional: 1117, dependent unconditional: 609, unknown: 722, unknown conditional: 235, unknown unconditional: 487] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 601, Positive conditional cache size: 126, Positive unconditional cache size: 475, Negative cache size: 121, Negative conditional cache size: 109, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23202, Maximal queried relation: 11, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 42031, independent unconditional: 43980, dependent: 1847, dependent conditional: 1496, dependent unconditional: 351, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 19099, independent unconditional: 66912, dependent: 1847, dependent conditional: 1226, dependent unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87858, independent: 86011, independent conditional: 19099, independent unconditional: 66912, dependent: 1847, dependent conditional: 1226, dependent unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 722, independent: 601, independent conditional: 126, independent unconditional: 475, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 722, independent: 585, independent conditional: 0, independent unconditional: 585, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 137, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 137, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 121, dependent conditional: 109, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 25, independent conditional: 12, independent unconditional: 14, dependent: 173, dependent conditional: 128, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 87858, independent: 85410, independent conditional: 18973, independent unconditional: 66437, dependent: 1726, dependent conditional: 1117, dependent unconditional: 609, unknown: 722, unknown conditional: 235, unknown unconditional: 487] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 601, Positive conditional cache size: 126, Positive unconditional cache size: 475, Negative cache size: 121, Negative conditional cache size: 109, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23202 ], Independence queries for same thread: 22 - PositiveResult [Line: 124]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 10.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 826 ConstructedInterpolants, 0 QuantifiedInterpolants, 3132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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: 7.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 164, ConditionalCommutativityTraceChecks: 26, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 17:39:03,930 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-06 17:39:04,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...