/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 13:19:43,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 13:19:43,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 13:19:43,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 13:19:43,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 13:19:43,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 13:19:43,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 13:19:43,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 13:19:43,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 13:19:43,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 13:19:43,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 13:19:43,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 13:19:43,289 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 13:19:43,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 13:19:43,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 13:19:43,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 13:19:43,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 13:19:43,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 13:19:43,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 13:19:43,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 13:19:43,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 13:19:43,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 13:19:43,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 13:19:43,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 13:19:43,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 13:19:43,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 13:19:43,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 13:19:43,293 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 13:19:43,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 13:19:43,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 13:19:43,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 13:19:43,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 13:19:43,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 13:19:43,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 13:19:43,296 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 [2024-04-06 13:19:43,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 13:19:43,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 13:19:43,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 13:19:43,537 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 13:19:43,552 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 13:19:43,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl [2024-04-06 13:19:43,554 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl' [2024-04-06 13:19:43,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 13:19:43,606 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 13:19:43,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 13:19:43,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 13:19:43,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 13:19:43,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,654 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 13:19:43,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 13:19:43,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 13:19:43,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 13:19:43,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 13:19:43,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 13:19:43,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 13:19:43,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 13:19:43,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 13:19:43,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/1) ... [2024-04-06 13:19:43,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 13:19:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:19:43,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-06 13:19:43,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-06 13:19:43,759 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 13:19:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 13:19:43,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 13:19:43,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 13:19:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 13:19:43,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 13:19:43,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 13:19:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 13:19:43,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 13:19:43,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 13:19:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 13:19:43,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 13:19:43,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 13:19:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 13:19:43,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 13:19:43,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-06 13:19:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-06 13:19:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-06 13:19:43,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2024-04-06 13:19:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-04-06 13:19:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-04-06 13:19:43,763 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 13:19:43,802 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 13:19:43,804 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 13:19:43,894 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 13:19:43,916 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 13:19:43,917 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-04-06 13:19:43,918 INFO L201 PluginConnector]: Adding new model parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:19:43 BoogieIcfgContainer [2024-04-06 13:19:43,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 13:19:43,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 13:19:43,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 13:19:43,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 13:19:43,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:19:43" (1/2) ... [2024-04-06 13:19:43,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6f7bab and model type parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 01:19:43, skipping insertion in model container [2024-04-06 13:19:43,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:19:43" (2/2) ... [2024-04-06 13:19:43,925 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-sum-1-dsl.wvr.bpl [2024-04-06 13:19:43,930 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 13:19:43,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 13:19:43,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 13:19:43,937 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 13:19:43,989 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-04-06 13:19:44,018 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 13:19:44,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 13:19:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:19:44,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-06 13:19:44,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-06 13:19:44,062 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 13:19:44,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:19:44,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 13:19:44,096 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;@48a4ed7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 13:19:44,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-04-06 13:19:44,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1657769478, now seen corresponding path program 1 times [2024-04-06 13:19:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:46,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 1 times [2024-04-06 13:19:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:47,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 2 times [2024-04-06 13:19:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash 316403249, now seen corresponding path program 1 times [2024-04-06 13:19:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:47,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:49,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:19:49,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:49,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1218566239, now seen corresponding path program 1 times [2024-04-06 13:19:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:49,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash -879152093, now seen corresponding path program 1 times [2024-04-06 13:19:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:49,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:49,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1483910993, now seen corresponding path program 1 times [2024-04-06 13:19:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:51,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1243399589, now seen corresponding path program 1 times [2024-04-06 13:19:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:51,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:51,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -109318241, now seen corresponding path program 1 times [2024-04-06 13:19:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 906101934, now seen corresponding path program 1 times [2024-04-06 13:19:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1975610962, now seen corresponding path program 1 times [2024-04-06 13:19:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] === [2024-04-06 13:19:52,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:19:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 354461090, now seen corresponding path program 1 times [2024-04-06 13:19:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:19:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495814752] [2024-04-06 13:19:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:19:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:19:52,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:19:52,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495814752] [2024-04-06 13:19:52,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495814752] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:19:52,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:19:52,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 13:19:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171820380] [2024-04-06 13:19:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:19:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:19:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:19:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:19:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:19:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:19:52,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:19:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:19:52,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:19:52,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1657769478, now seen corresponding path program 2 times [2024-04-06 13:19:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 3 times [2024-04-06 13:19:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 4 times [2024-04-06 13:19:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:52,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 316403249, now seen corresponding path program 2 times [2024-04-06 13:19:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:53,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:57,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:19:57,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:57,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1218566239, now seen corresponding path program 2 times [2024-04-06 13:19:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:57,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:59,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:19:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:59,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash -879152093, now seen corresponding path program 2 times [2024-04-06 13:19:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:59,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:59,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:19:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1483910993, now seen corresponding path program 2 times [2024-04-06 13:19:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:19:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:19:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:59,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:19:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:19:59,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1243399589, now seen corresponding path program 2 times [2024-04-06 13:20:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:01,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:02,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash -109318241, now seen corresponding path program 2 times [2024-04-06 13:20:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:06,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:08,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:20:08,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:08,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:14,292 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 15 DAG size of output: 10 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-04-06 13:20:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 906101934, now seen corresponding path program 2 times [2024-04-06 13:20:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:14,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:16,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:20:16,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:16,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1975610962, now seen corresponding path program 2 times [2024-04-06 13:20:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:20,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-06 13:20:20,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 13:20:20,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] === [2024-04-06 13:20:20,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:20:20,699 INFO L85 PathProgramCache]: Analyzing trace with hash 341450944, now seen corresponding path program 1 times [2024-04-06 13:20:20,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:20:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367057941] [2024-04-06 13:20:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:20:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:20:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:20:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367057941] [2024-04-06 13:20:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367057941] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:20:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:20:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:20:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681885549] [2024-04-06 13:20:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:20:20,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-06 13:20:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:20:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-06 13:20:20,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-06 13:20:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:20:20,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:20:20,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:20:20,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-06 13:20:20,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:20:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1657769478, now seen corresponding path program 3 times [2024-04-06 13:20:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:20,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:21,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 5 times [2024-04-06 13:20:23,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:23,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:23,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 6 times [2024-04-06 13:20:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:25,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 316403249, now seen corresponding path program 3 times [2024-04-06 13:20:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:25,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1218566239, now seen corresponding path program 3 times [2024-04-06 13:20:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:25,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 13:20:27,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:27,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash -879152093, now seen corresponding path program 3 times [2024-04-06 13:20:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1483910993, now seen corresponding path program 3 times [2024-04-06 13:20:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1243399589, now seen corresponding path program 3 times [2024-04-06 13:20:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:27,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:28,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -109318241, now seen corresponding path program 3 times [2024-04-06 13:20:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:28,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:28,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash 906101934, now seen corresponding path program 3 times [2024-04-06 13:20:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:30,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1975610962, now seen corresponding path program 3 times [2024-04-06 13:20:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:30,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:30,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -186585648, now seen corresponding path program 1 times [2024-04-06 13:20:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:20:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:20:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:20:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:20:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-06 13:20:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-04-06 13:20:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1657769478, now seen corresponding path program 4 times [2024-04-06 13:20:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:31,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:31,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-04-06 13:20:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 148753885, now seen corresponding path program 7 times [2024-04-06 13:20:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:20:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:20:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:31,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:20:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:20:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28 [2024-04-06 13:20:32,082 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@77906abc at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-06 13:20:32,091 INFO L158 Benchmark]: Toolchain (without parser) took 48481.51ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 254.5MB in the beginning and 131.4MB in the end (delta: 123.1MB). Peak memory consumption was 179.6MB. Max. memory is 8.0GB. [2024-04-06 13:20:32,091 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 278.9MB. Free memory is still 246.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 13:20:32,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.37ms. Allocated memory is still 278.9MB. Free memory was 254.3MB in the beginning and 252.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 13:20:32,092 INFO L158 Benchmark]: Boogie Preprocessor took 24.16ms. Allocated memory is still 278.9MB. Free memory was 252.7MB in the beginning and 251.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 13:20:32,092 INFO L158 Benchmark]: RCFGBuilder took 236.41ms. Allocated memory is still 278.9MB. Free memory was 251.6MB in the beginning and 239.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-06 13:20:32,093 INFO L158 Benchmark]: TraceAbstraction took 48167.69ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 238.0MB in the beginning and 131.4MB in the end (delta: 106.7MB). Peak memory consumption was 163.8MB. Max. memory is 8.0GB. [2024-04-06 13:20:32,097 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.12ms. Allocated memory is still 278.9MB. Free memory is still 246.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.37ms. Allocated memory is still 278.9MB. Free memory was 254.3MB in the beginning and 252.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.16ms. Allocated memory is still 278.9MB. Free memory was 252.7MB in the beginning and 251.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.41ms. Allocated memory is still 278.9MB. Free memory was 251.6MB in the beginning and 239.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 48167.69ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 238.0MB in the beginning and 131.4MB in the end (delta: 106.7MB). Peak memory consumption was 163.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@77906abc de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@77906abc: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-06 13:20:32,109 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-04-06 13:20:32,327 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...