/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/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 07:29:58,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 07:29:58,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 07:29:58,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 07:29:58,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 07:29:58,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 07:29:58,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 07:29:58,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 07:29:58,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 07:29:58,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 07:29:58,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 07:29:58,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 07:29:58,984 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 07:29:58,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 07:29:58,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 07:29:58,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 07:29:58,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 07:29:58,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 07:29:58,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 07:29:58,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 07:29:58,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 07:29:58,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 07:29:58,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 07:29:58,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 07:29:58,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 07:29:58,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 07:29:58,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 07:29:58,993 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 07:29:58,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 07:29:58,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 07:29:58,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 07:29:58,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 07:29:58,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 07:29:58,995 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 07:29:58,995 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-04 07:29:59,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 07:29:59,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 07:29:59,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 07:29:59,189 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-05-04 07:29:59,191 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-05-04 07:29:59,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-3.wvr.bpl [2024-05-04 07:29:59,192 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-3.wvr.bpl' [2024-05-04 07:29:59,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 07:29:59,263 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-05-04 07:29:59,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 07:29:59,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 07:29:59,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 07:29:59,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,286 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-05-04 07:29:59,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 07:29:59,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 07:29:59,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 07:29:59,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 07:29:59,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 07:29:59,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 07:29:59,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 07:29:59,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 07:29:59,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/1) ... [2024-05-04 07:29:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 07:29:59,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 07:29:59,325 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-04 07:29:59,341 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-04 07:29:59,362 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-05-04 07:29:59,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 07:29:59,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 07:29:59,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-05-04 07:29:59,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 07:29:59,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 07:29:59,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-05-04 07:29:59,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 07:29:59,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 07:29:59,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-05-04 07:29:59,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-04 07:29:59,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-04 07:29:59,364 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 07:29:59,412 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 07:29:59,413 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 07:29:59,486 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 07:29:59,502 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 07:29:59,502 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-04 07:29:59,504 INFO L201 PluginConnector]: Adding new model ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:29:59 BoogieIcfgContainer [2024-05-04 07:29:59,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 07:29:59,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 07:29:59,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 07:29:59,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 07:29:59,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 07:29:59" (1/2) ... [2024-05-04 07:29:59,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7924cc3f and model type ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:29:59, skipping insertion in model container [2024-05-04 07:29:59,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:29:59" (2/2) ... [2024-05-04 07:29:59,510 INFO L112 eAbstractionObserver]: Analyzing ICFG ticket-3.wvr.bpl [2024-05-04 07:29:59,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 07:29:59,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 07:29:59,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 07:29:59,523 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 07:29:59,548 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-04 07:29:59,575 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 07:29:59,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 07:29:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 07:29:59,577 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-04 07:29:59,577 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-04 07:29:59,604 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 07:29:59,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:29:59,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 07:29:59,626 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e25d7af, 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-04 07:29:59,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-04 07:29:59,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 07:29:59,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:29:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1536484735, now seen corresponding path program 1 times [2024-05-04 07:29:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 07:29:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432456746] [2024-05-04 07:29:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:29:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:29:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:29:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:29:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 07:29:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432456746] [2024-05-04 07:29:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432456746] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 07:29:59,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 07:29:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-04 07:29:59,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774571082] [2024-05-04 07:29:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 07:29:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-04 07:29:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 07:30:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 07:30:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-04 07:30:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:00,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 07:30:00,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-04 07:30:00,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 1 times [2024-05-04 07:30:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 1 times [2024-05-04 07:30:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 687237365, now seen corresponding path program 2 times [2024-05-04 07:30:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-04 07:30:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 3 times [2024-05-04 07:30:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 2 times [2024-05-04 07:30:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:00,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 1 times [2024-05-04 07:30:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 984331181, now seen corresponding path program 1 times [2024-05-04 07:30:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2141379529, now seen corresponding path program 1 times [2024-05-04 07:30:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 07:30:01,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-05-04 07:30:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 4 times [2024-05-04 07:30:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 3 times [2024-05-04 07:30:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:01,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 2 times [2024-05-04 07:30:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1049462279, now seen corresponding path program 1 times [2024-05-04 07:30:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-05-04 07:30:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 5 times [2024-05-04 07:30:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 4 times [2024-05-04 07:30:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 3 times [2024-05-04 07:30:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1463877634, now seen corresponding path program 1 times [2024-05-04 07:30:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:02,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-05-04 07:30:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 6 times [2024-05-04 07:30:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:02,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 5 times [2024-05-04 07:30:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 4 times [2024-05-04 07:30:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 449495951, now seen corresponding path program 1 times [2024-05-04 07:30:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1049472659, now seen corresponding path program 2 times [2024-05-04 07:30:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1773108214, now seen corresponding path program 2 times [2024-05-04 07:30:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 07:30:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-05-04 07:30:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 7 times [2024-05-04 07:30:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 6 times [2024-05-04 07:30:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 5 times [2024-05-04 07:30:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:03,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1590098861, now seen corresponding path program 2 times [2024-05-04 07:30:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2024-05-04 07:30:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 8 times [2024-05-04 07:30:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 7 times [2024-05-04 07:30:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 6 times [2024-05-04 07:30:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:04,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1022231443, now seen corresponding path program 9 times [2024-05-04 07:30:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:05,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 07:30:05,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2024-05-04 07:30:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 10 times [2024-05-04 07:30:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 8 times [2024-05-04 07:30:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,538 INFO L85 PathProgramCache]: Analyzing trace with hash -319627408, now seen corresponding path program 7 times [2024-05-04 07:30:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1076178027, now seen corresponding path program 2 times [2024-05-04 07:30:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:05,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash 519474117, now seen corresponding path program 1 times [2024-05-04 07:30:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:06,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable42,SelfDestructingSolverStorable0,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-04 07:30:06,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 07:30:06,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:30:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 879871125, now seen corresponding path program 2 times [2024-05-04 07:30:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 07:30:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678526636] [2024-05-04 07:30:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 07:30:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678526636] [2024-05-04 07:30:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678526636] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 07:30:06,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 07:30:06,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-04 07:30:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619026098] [2024-05-04 07:30:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 07:30:06,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-04 07:30:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 07:30:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-04 07:30:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:06,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 07:30:06,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-04 07:30:06,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:06,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 358385555, now seen corresponding path program 11 times [2024-05-04 07:30:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2089770793, now seen corresponding path program 9 times [2024-05-04 07:30:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1162633399, now seen corresponding path program 3 times [2024-05-04 07:30:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 07:30:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2024-05-04 07:30:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47 [2024-05-04 07:30:07,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 07:30:07,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:30:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -63748289, now seen corresponding path program 3 times [2024-05-04 07:30:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 07:30:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861648361] [2024-05-04 07:30:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:07,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 07:30:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861648361] [2024-05-04 07:30:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861648361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 07:30:07,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 07:30:07,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-04 07:30:07,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923040247] [2024-05-04 07:30:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 07:30:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-04 07:30:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 07:30:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 07:30:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-04 07:30:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:07,221 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 07:30:07,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-04 07:30:07,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:07,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1041790068, now seen corresponding path program 3 times [2024-05-04 07:30:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:07,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 07:30:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 07:30:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-05-04 07:30:07,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 07:30:07,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:30:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash -651321557, now seen corresponding path program 4 times [2024-05-04 07:30:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 07:30:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133037883] [2024-05-04 07:30:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 07:30:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133037883] [2024-05-04 07:30:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133037883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 07:30:07,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 07:30:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-04 07:30:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606773723] [2024-05-04 07:30:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 07:30:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 07:30:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 07:30:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 07:30:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-04 07:30:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:07,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 07:30:07,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-04 07:30:07,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:07,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:07,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 07:30:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-04 07:30:08,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 07:30:08,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 07:30:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1962564319, now seen corresponding path program 5 times [2024-05-04 07:30:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 07:30:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923124522] [2024-05-04 07:30:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 07:30:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 07:30:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 07:30:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 07:30:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 07:30:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923124522] [2024-05-04 07:30:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923124522] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 07:30:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 07:30:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-04 07:30:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581933439] [2024-05-04 07:30:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 07:30:08,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 07:30:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 07:30:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 07:30:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-04 07:30:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:08,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 07:30:08,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-04 07:30:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 07:30:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 07:30:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 07:30:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 07:30:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 07:30:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 07:30:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2024-05-04 07:30:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-04 07:30:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-04 07:30:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-04 07:30:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-04 07:30:08,676 INFO L448 BasicCegarLoop]: Path program histogram: [11, 9, 7, 5, 3, 3, 2, 2, 1, 1] [2024-05-04 07:30:08,677 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 07:30:08,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 07:30:08,680 INFO L201 PluginConnector]: Adding new model ticket-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 07:30:08 BasicIcfg [2024-05-04 07:30:08,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 07:30:08,680 INFO L158 Benchmark]: Toolchain (without parser) took 9416.95ms. Allocated memory was 168.8MB in the beginning and 312.5MB in the end (delta: 143.7MB). Free memory was 140.4MB in the beginning and 208.7MB in the end (delta: -68.2MB). Peak memory consumption was 75.4MB. Max. memory is 8.0GB. [2024-05-04 07:30:08,680 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 07:30:08,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.78ms. Allocated memory is still 168.8MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 07:30:08,681 INFO L158 Benchmark]: Boogie Preprocessor took 13.11ms. Allocated memory is still 168.8MB. Free memory was 138.8MB in the beginning and 137.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 07:30:08,681 INFO L158 Benchmark]: RCFGBuilder took 202.08ms. Allocated memory is still 168.8MB. Free memory was 137.8MB in the beginning and 126.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-04 07:30:08,681 INFO L158 Benchmark]: TraceAbstraction took 9174.43ms. Allocated memory was 168.8MB in the beginning and 312.5MB in the end (delta: 143.7MB). Free memory was 125.7MB in the beginning and 208.7MB in the end (delta: -82.9MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2024-05-04 07:30:08,682 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.78ms. Allocated memory is still 168.8MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.11ms. Allocated memory is still 168.8MB. Free memory was 138.8MB in the beginning and 137.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 202.08ms. Allocated memory is still 168.8MB. Free memory was 137.8MB in the beginning and 126.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9174.43ms. Allocated memory was 168.8MB in the beginning and 312.5MB in the end (delta: 143.7MB). Free memory was 125.7MB in the beginning and 208.7MB in the end (delta: -82.9MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10684, independent: 10303, independent conditional: 10290, independent unconditional: 13, dependent: 381, dependent conditional: 381, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10684, independent: 10303, independent conditional: 10290, independent unconditional: 13, dependent: 381, dependent conditional: 381, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10684, independent: 10303, independent conditional: 10290, independent unconditional: 13, dependent: 381, dependent conditional: 381, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10684, independent: 10303, independent conditional: 10290, independent unconditional: 13, dependent: 381, dependent conditional: 381, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 5059, independent unconditional: 5244, dependent: 1846, dependent conditional: 1449, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 3782, independent unconditional: 6521, dependent: 1846, dependent conditional: 1221, dependent unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 3782, independent unconditional: 6521, dependent: 1846, dependent conditional: 1221, dependent unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 328, independent: 214, independent conditional: 53, independent unconditional: 161, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 328, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 131, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 131, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, independent: 25, independent conditional: 13, independent unconditional: 11, dependent: 156, dependent conditional: 109, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12149, independent: 10089, independent conditional: 3729, independent unconditional: 6360, dependent: 1732, dependent conditional: 1118, dependent unconditional: 614, unknown: 328, unknown conditional: 156, unknown unconditional: 172] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 214, Positive conditional cache size: 53, Positive unconditional cache size: 161, Negative cache size: 114, Negative conditional cache size: 103, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1505, Maximal queried relation: 13, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 5059, independent unconditional: 5244, dependent: 1846, dependent conditional: 1449, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 3782, independent unconditional: 6521, dependent: 1846, dependent conditional: 1221, dependent unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12149, independent: 10303, independent conditional: 3782, independent unconditional: 6521, dependent: 1846, dependent conditional: 1221, dependent unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 328, independent: 214, independent conditional: 53, independent unconditional: 161, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 328, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 131, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 131, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 114, dependent conditional: 103, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, independent: 25, independent conditional: 13, independent unconditional: 11, dependent: 156, dependent conditional: 109, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12149, independent: 10089, independent conditional: 3729, independent unconditional: 6360, dependent: 1732, dependent conditional: 1118, dependent unconditional: 614, unknown: 328, unknown conditional: 156, unknown unconditional: 172] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 214, Positive conditional cache size: 53, Positive unconditional cache size: 161, Negative cache size: 114, Negative conditional cache size: 103, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1505 ], Independence queries for same thread: 0 - PositiveResult [Line: 65]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 53 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 11, EmptinessCheckTime: 8.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 8, ConditionalCommutativityConditionCalculations: 148, ConditionalCommutativityTraceChecks: 39, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-04 07:30:08,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-04 07:30:08,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...