/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis BADGER -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 17:04:17,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 17:04:17,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 17:04:17,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 17:04:17,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 17:04:17,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 17:04:17,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 17:04:17,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 17:04:17,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 17:04:17,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 17:04:17,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 17:04:17,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 17:04:17,191 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 17:04:17,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 17:04:17,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 17:04:17,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 17:04:17,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 17:04:17,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> BADGER [2024-11-14 17:04:17,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 17:04:17,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 17:04:17,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 17:04:17,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 17:04:17,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 17:04:17,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-11-14 17:04:18,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 17:04:18,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 17:04:18,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-11-14 17:04:18,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/438268093/2df5fc4c4b3e4431acf314a51e0f4f8e/FLAG7ad6d544c [2024-11-14 17:04:19,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/438268093/2df5fc4c4b3e4431acf314a51e0f4f8e [2024-11-14 17:04:19,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 17:04:19,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 17:04:19,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 17:04:19,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 17:04:19,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 17:04:19,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2defe4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19, skipping insertion in model container [2024-11-14 17:04:19,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 17:04:19,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-14 17:04:19,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 17:04:19,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 17:04:19,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-14 17:04:19,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 17:04:19,314 INFO L204 MainTranslator]: Completed translation [2024-11-14 17:04:19,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19 WrapperNode [2024-11-14 17:04:19,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 17:04:19,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 17:04:19,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 17:04:19,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 17:04:19,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,349 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 131 [2024-11-14 17:04:19,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 17:04:19,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 17:04:19,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 17:04:19,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 17:04:19,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 17:04:19,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 17:04:19,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 17:04:19,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 17:04:19,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (1/1) ... [2024-11-14 17:04:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 17:04:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:19,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 17:04:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 17:04:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 17:04:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 17:04:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 17:04:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 17:04:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 17:04:19,421 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 17:04:19,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 17:04:19,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 17:04:19,706 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 17:04:19,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 17:04:19,720 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 17:04:19,720 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 17:04:19,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:19 BoogieIcfgContainer [2024-11-14 17:04:19,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 17:04:19,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 17:04:19,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 17:04:19,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 17:04:19,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:04:19" (1/3) ... [2024-11-14 17:04:19,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a387f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:19, skipping insertion in model container [2024-11-14 17:04:19,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:19" (2/3) ... [2024-11-14 17:04:19,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a387f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:19, skipping insertion in model container [2024-11-14 17:04:19,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:19" (3/3) ... [2024-11-14 17:04:19,726 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-14 17:04:19,736 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 17:04:19,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 162 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-14 17:04:19,737 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 17:04:19,815 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 17:04:19,850 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 17:04:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 17:04:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:19,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 17:04:19,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 17:04:19,933 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 17:04:19,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 17:04:19,952 INFO L333 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, 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;@3d9cc1bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 17:04:19,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 17:04:20,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:20,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash 55703796, now seen corresponding path program 1 times [2024-11-14 17:04:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:20,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056308398] [2024-11-14 17:04:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056308398] [2024-11-14 17:04:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056308398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 17:04:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 17:04:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 17:04:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287655095] [2024-11-14 17:04:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 17:04:20,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 17:04:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:20,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 17:04:20,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 17:04:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,443 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 17:04:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 17:04:20,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1208150510, now seen corresponding path program 1 times [2024-11-14 17:04:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242589152] [2024-11-14 17:04:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242589152] [2024-11-14 17:04:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242589152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 17:04:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 17:04:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 17:04:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866763006] [2024-11-14 17:04:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 17:04:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 17:04:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:20,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 17:04:20,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 17:04:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,867 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 17:04:20,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 17:04:20,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -129355675, now seen corresponding path program 1 times [2024-11-14 17:04:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228444138] [2024-11-14 17:04:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:21,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:21,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228444138] [2024-11-14 17:04:21,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228444138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:21,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070878065] [2024-11-14 17:04:21,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:21,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:21,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:21,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:21,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 17:04:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:21,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 17:04:21,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:21,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070878065] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 17:04:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-11-14 17:04:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98791778] [2024-11-14 17:04:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 17:04:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 17:04:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:21,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 17:04:21,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-14 17:04:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:21,798 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 17:04:21,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:21,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:21,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:21,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 17:04:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:22,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:22,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash 295282363, now seen corresponding path program 1 times [2024-11-14 17:04:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:22,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111415502] [2024-11-14 17:04:22,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111415502] [2024-11-14 17:04:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111415502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124656491] [2024-11-14 17:04:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:22,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:22,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:22,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 17:04:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:22,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 17:04:22,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:22,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124656491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:23,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:23,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-14 17:04:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213601229] [2024-11-14 17:04:23,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:23,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 17:04:23,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 17:04:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-14 17:04:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:23,191 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.125) internal successors, (339), 24 states have internal predecessors, (339), 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-11-14 17:04:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:23,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 17:04:23,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:23,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:23,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1959221746, now seen corresponding path program 2 times [2024-11-14 17:04:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764107939] [2024-11-14 17:04:23,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764107939] [2024-11-14 17:04:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764107939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583685372] [2024-11-14 17:04:23,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 17:04:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:23,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:23,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 17:04:23,927 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 17:04:23,928 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:23,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 17:04:23,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:24,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:24,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583685372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:24,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-14 17:04:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588879424] [2024-11-14 17:04:24,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:24,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 17:04:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:24,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 17:04:24,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-14 17:04:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:24,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:24,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 16.458333333333332) internal successors, (395), 24 states have internal predecessors, (395), 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-11-14 17:04:24,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:24,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:24,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:24,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:24,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:24,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 17:04:25,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:25,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:25,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash 163992676, now seen corresponding path program 3 times [2024-11-14 17:04:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408881890] [2024-11-14 17:04:25,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 98 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:25,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408881890] [2024-11-14 17:04:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408881890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214693754] [2024-11-14 17:04:25,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 17:04:25,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:25,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:25,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 17:04:25,497 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 17:04:25,497 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:25,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 17:04:25,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 17:04:25,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 17:04:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214693754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:26,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 8] total 31 [2024-11-14 17:04:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928469084] [2024-11-14 17:04:26,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:26,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 17:04:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:26,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 17:04:26,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2024-11-14 17:04:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:26,277 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 18.29032258064516) internal successors, (567), 31 states have internal predecessors, (567), 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-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:27,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 17:04:27,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:27,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:27,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1266805599, now seen corresponding path program 4 times [2024-11-14 17:04:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192907428] [2024-11-14 17:04:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 399 proven. 90 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-14 17:04:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:28,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192907428] [2024-11-14 17:04:28,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192907428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:28,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275738599] [2024-11-14 17:04:28,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 17:04:28,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:28,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:28,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 17:04:28,438 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 17:04:28,438 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:28,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 17:04:28,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 462 proven. 27 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-14 17:04:29,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 462 proven. 27 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-14 17:04:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275738599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:29,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2024-11-14 17:04:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523094532] [2024-11-14 17:04:29,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 17:04:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 17:04:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 17:04:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:29,518 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:29,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 15.363636363636363) internal successors, (676), 44 states have internal predecessors, (676), 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-11-14 17:04:29,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:29,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:29,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:29,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:29,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:29,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:29,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:29,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 17:04:30,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:30,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:30,099 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:30,099 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:30,099 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1290974251, now seen corresponding path program 1 times [2024-11-14 17:04:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360096995] [2024-11-14 17:04:30,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 279 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:30,653 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2024-11-14 17:04:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360096995] [2024-11-14 17:04:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360096995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:30,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 17:04:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-11-14 17:04:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1644837388, now seen corresponding path program 5 times [2024-11-14 17:04:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064307644] [2024-11-14 17:04:30,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 399 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064307644] [2024-11-14 17:04:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064307644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697191837] [2024-11-14 17:04:31,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 17:04:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:31,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 17:04:31,312 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-14 17:04:31,312 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 17:04:31,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 492 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:32,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 492 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697191837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:32,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:32,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 54 [2024-11-14 17:04:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583675314] [2024-11-14 17:04:32,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:32,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-14 17:04:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-14 17:04:32,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2024-11-14 17:04:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:32,646 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 14.62962962962963) internal successors, (790), 54 states have internal predecessors, (790), 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-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:32,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:33,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 17:04:33,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:33,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:33,239 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:33,240 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_4 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:33,240 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -777739163, now seen corresponding path program 1 times [2024-11-14 17:04:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370991546] [2024-11-14 17:04:33,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:33,328 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 17:04:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:33,479 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2024-11-14 17:04:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2091092921, now seen corresponding path program 6 times [2024-11-14 17:04:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:33,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567537859] [2024-11-14 17:04:33,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 30 proven. 547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567537859] [2024-11-14 17:04:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567537859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656367856] [2024-11-14 17:04:33,988 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-14 17:04:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:33,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:33,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 17:04:34,115 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-14 17:04:34,116 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:34,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 17:04:34,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-14 17:04:34,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-14 17:04:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656367856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:35,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 10] total 46 [2024-11-14 17:04:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135852372] [2024-11-14 17:04:35,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:35,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 17:04:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:35,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 17:04:35,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 17:04:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:35,141 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:35,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 17.652173913043477) internal successors, (812), 46 states have internal predecessors, (812), 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-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:35,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:37,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 17:04:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:37,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1430048464, now seen corresponding path program 7 times [2024-11-14 17:04:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370953795] [2024-11-14 17:04:37,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 1251 proven. 210 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-14 17:04:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370953795] [2024-11-14 17:04:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370953795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319928173] [2024-11-14 17:04:38,066 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 17:04:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:38,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:38,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 17:04:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:38,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 17:04:38,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 1376 proven. 85 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-14 17:04:39,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 1376 proven. 85 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-14 17:04:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319928173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:39,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 64 [2024-11-14 17:04:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36303531] [2024-11-14 17:04:39,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-14 17:04:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:39,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-14 17:04:39,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3402, Unknown=0, NotChecked=0, Total=4032 [2024-11-14 17:04:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:39,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 15.3125) internal successors, (980), 64 states have internal predecessors, (980), 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-11-14 17:04:39,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:39,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:39,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:39,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:39,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:39,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:39,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:39,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:39,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:39,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 17:04:40,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 17:04:40,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:40,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:40,464 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:40,464 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:40,464 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash 976874185, now seen corresponding path program 1 times [2024-11-14 17:04:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174217457] [2024-11-14 17:04:40,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 785 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:41,204 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2024-11-14 17:04:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174217457] [2024-11-14 17:04:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174217457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:41,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 17:04:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2024-11-14 17:04:41,209 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_8 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:41,209 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:41,209 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1961547321, now seen corresponding path program 1 times [2024-11-14 17:04:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651818144] [2024-11-14 17:04:41,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 935 proven. 281 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 17:04:41,907 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2024-11-14 17:04:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651818144] [2024-11-14 17:04:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651818144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:41,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 17:04:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2024-11-14 17:04:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1776231971, now seen corresponding path program 8 times [2024-11-14 17:04:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745513390] [2024-11-14 17:04:41,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1303 proven. 281 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 17:04:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745513390] [2024-11-14 17:04:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745513390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697680828] [2024-11-14 17:04:42,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 17:04:42,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:42,745 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:42,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 17:04:42,893 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 17:04:42,894 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:42,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 17:04:42,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1458 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 17:04:44,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1458 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 17:04:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697680828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:44,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:44,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 74 [2024-11-14 17:04:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065973176] [2024-11-14 17:04:44,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-14 17:04:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:44,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-14 17:04:44,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=4579, Unknown=0, NotChecked=0, Total=5402 [2024-11-14 17:04:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:44,763 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:44,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 15.162162162162161) internal successors, (1122), 74 states have internal predecessors, (1122), 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-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-14 17:04:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 17:04:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 17:04:45,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 17:04:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-11-14 17:04:45,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:45,620 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,620 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,620 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_10 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash 83540316, now seen corresponding path program 1 times [2024-11-14 17:04:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:45,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731974764] [2024-11-14 17:04:45,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:45,684 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 17:04:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:45,793 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2024-11-14 17:04:45,801 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_12 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,801 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,801 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 615562444, now seen corresponding path program 1 times [2024-11-14 17:04:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655770727] [2024-11-14 17:04:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 755 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:46,547 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2024-11-14 17:04:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655770727] [2024-11-14 17:04:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655770727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:46,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 17:04:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2024-11-14 17:04:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 275413622, now seen corresponding path program 9 times [2024-11-14 17:04:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195937344] [2024-11-14 17:04:46,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 17:04:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 1149 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 17:04:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195937344] [2024-11-14 17:04:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195937344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 17:04:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008450796] [2024-11-14 17:04:47,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 17:04:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 17:04:47,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 17:04:47,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 17:04:47,639 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-14 17:04:47,640 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 17:04:47,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 17:04:47,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 17:04:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 1486 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:48,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 17:04:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 1486 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 17:04:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008450796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 17:04:49,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 17:04:49,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 84 [2024-11-14 17:04:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063461471] [2024-11-14 17:04:49,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 17:04:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-11-14 17:04:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 17:04:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-11-14 17:04:49,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=5930, Unknown=0, NotChecked=0, Total=6972 [2024-11-14 17:04:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:49,853 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 17:04:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 15.273809523809524) internal successors, (1283), 84 states have internal predecessors, (1283), 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-11-14 17:04:49,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:49,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:49,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:49,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-14 17:04:49,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 17:04:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 17:04:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-14 17:04:50,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 17:04:50,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-11-14 17:04:50,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 17:04:50,766 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,766 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_14 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,766 WARN L331 ript$VariableManager]: TermVariable |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash -893474065, now seen corresponding path program 1 times [2024-11-14 17:04:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424950321] [2024-11-14 17:04:50,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:50,824 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 17:04:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:50,913 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2024-11-14 17:04:50,920 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,920 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,920 WARN L331 ript$VariableManager]: TermVariable |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 17:04:50,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1692517983, now seen corresponding path program 1 times [2024-11-14 17:04:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2024-11-14 17:04:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744415151] [2024-11-14 17:04:50,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:50,974 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 17:04:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:51,087 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2024-11-14 17:04:51,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 17:04:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2104374327, now seen corresponding path program 10 times [2024-11-14 17:04:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 17:04:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093988115] [2024-11-14 17:04:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 17:04:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 17:04:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:51,156 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 17:04:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 17:04:51,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 17:04:51,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-14 17:04:51,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 17:04:51,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 17:04:51,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 17:04:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20 [2024-11-14 17:04:51,325 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 17:04:51,494 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 17:04:51,494 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 17:04:51,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 17:04:51,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:04:51 BasicIcfg [2024-11-14 17:04:51,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 17:04:51,512 INFO L158 Benchmark]: Toolchain (without parser) took 32389.20ms. Allocated memory was 100.7MB in the beginning and 998.2MB in the end (delta: 897.6MB). Free memory was 74.0MB in the beginning and 804.7MB in the end (delta: -730.7MB). Peak memory consumption was 624.1MB. Max. memory is 8.0GB. [2024-11-14 17:04:51,512 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 17:04:51,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.75ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 61.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 17:04:51,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 60.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 17:04:51,513 INFO L158 Benchmark]: Boogie Preprocessor took 20.69ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 59.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 17:04:51,513 INFO L158 Benchmark]: RCFGBuilder took 349.52ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 43.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-14 17:04:51,513 INFO L158 Benchmark]: TraceAbstraction took 31790.01ms. Allocated memory was 100.7MB in the beginning and 998.2MB in the end (delta: 897.6MB). Free memory was 43.1MB in the beginning and 804.7MB in the end (delta: -761.5MB). Peak memory consumption was 590.5MB. Max. memory is 8.0GB. [2024-11-14 17:04:51,514 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.75ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 61.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 60.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.69ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 59.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 349.52ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 43.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 31790.01ms. Allocated memory was 100.7MB in the beginning and 998.2MB in the end (delta: 897.6MB). Free memory was 43.1MB in the beginning and 804.7MB in the end (delta: -761.5MB). Peak memory consumption was 590.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17641, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 3349, dependent conditional: 3341, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14351, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 59, dependent conditional: 51, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14351, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 59, dependent conditional: 51, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 222, dependent conditional: 214, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 0, independent unconditional: 14292, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 0, independent unconditional: 14292, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4511, independent: 4503, independent conditional: 0, independent unconditional: 4503, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4511, independent: 4501, independent conditional: 0, independent unconditional: 4501, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Protected Queries: 0 ], Cache Queries: [ total: 14514, independent: 9789, independent conditional: 0, independent unconditional: 9789, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 4511, unknown conditional: 0, unknown unconditional: 4511] , Statistics on independence cache: Total cache size (in pairs): 4511, Positive cache size: 4503, Positive conditional cache size: 0, Positive unconditional cache size: 4503, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8297, Maximal queried relation: 4, Independence queries for same thread: 3290, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 331, Number of trivial persistent sets: 218, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6217, independent: 6209, independent conditional: 0, independent unconditional: 6209, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17641, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 3349, dependent conditional: 3341, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14351, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 59, dependent conditional: 51, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14351, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 59, dependent conditional: 51, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 8083, independent unconditional: 6209, dependent: 222, dependent conditional: 214, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 0, independent unconditional: 14292, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14514, independent: 14292, independent conditional: 0, independent unconditional: 14292, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4511, independent: 4503, independent conditional: 0, independent unconditional: 4503, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4511, independent: 4501, independent conditional: 0, independent unconditional: 4501, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Protected Queries: 0 ], Cache Queries: [ total: 14514, independent: 9789, independent conditional: 0, independent unconditional: 9789, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 4511, unknown conditional: 0, unknown unconditional: 4511] , Statistics on independence cache: Total cache size (in pairs): 4511, Positive cache size: 4503, Positive conditional cache size: 0, Positive unconditional cache size: 4503, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8297, Maximal queried relation: 4, Independence queries for same thread: 3290 - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; VAL [A={0:0}] [L40] 0 _Atomic int counter; VAL [A={0:0}, counter=0] [L41] 0 int N; VAL [A={0:0}, N=0, counter=0] [L66] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0] [L68] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, counter=0] [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) VAL [A={0:0}, N=8, \old(cond)=1, cond=1, counter=0] [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) VAL [A={0:0}, N=8, \old(cond)=1, cond=1, counter=0] [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, size=8] [L88] 0 int i = 0; VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=0, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=0, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=0, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=1, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=1, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=1, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=2, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=2, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=2, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=3, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=3, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=3, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=4, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=4, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=4, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=5, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=5, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=5, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=6, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=6, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=6, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=7, size=8] [L88] COND TRUE 0 i < size VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=7, size=8] [L89] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=7, size=8] [L88] 0 i++ VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=8, size=8] [L88] COND FALSE 0 !(i < size) VAL [A={0:0}, N=8, \old(size)=8, arr={-2:0}, counter=0, i=8, size=8] [L91] 0 return arr; VAL [A={0:0}, N=8, \old(size)=8, \result={-2:0}, arr={-2:0}, counter=0, size=8] [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) VAL [A={-2:0}, N=8, counter=0] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=8, counter=0, t1=-1] [L48] 1 int i=0; VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=8, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-7, \result=-7, a=0, b=-7, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=-7] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-7, i=0, tmp=-7] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-7, i=1] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-7] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-7] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=-7, \old(b)=-7, \result=0, a=-7, b=-7, counter=-7] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-7, i=0, tmp=0] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-3, \result=-3, a=0, b=-3, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=-3] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1, tmp=-3] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=2] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-3] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-3] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=-3, \old(b)=-3, \result=0, a=-3, b=-3, counter=-3] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1, tmp=0] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=2] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-10, \result=-10, a=0, b=-10, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=2, tmp=-10] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-10, i=2, tmp=-10] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-10, i=3] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-10] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-10] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=-10, \old(b)=-10, \result=0, a=-10, b=-10, counter=-10] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-10, i=2, tmp=0] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=2, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=3] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-11, \result=-11, a=0, b=-11, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=3, tmp=-11] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-11, i=3, tmp=-11] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-11, i=4] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-11] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-11] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=-11, \old(b)=-11, \result=0, a=-11, b=-11, counter=-11] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-11, i=3, tmp=0] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=3, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=4] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-12, \result=-12, a=0, b=-12, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=4, tmp=-12] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-12, i=4, tmp=-12] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-12, i=5] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-12] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-12] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=-12, \old(b)=-12, \result=0, a=-12, b=-12, counter=-12] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-12, i=4, tmp=0] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=4, tmp=0] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=5] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=11, \result=11, a=0, b=11, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=5, tmp=11] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=11, i=5, tmp=11] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=11, i=6] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=11] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=11] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=11, \old(b)=11, \result=0, a=11, b=11, counter=11] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=11, i=5, tmp=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=11, \old(b)=-2147483647, \result=-2147483636, a=11, b=-2147483647, counter=0] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=6, tmp=-2147483636] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=0] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=0, \old(b)=-2147483647, \result=2147483647, a=0, b=-2147483647, counter=0] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=6, tmp=2147483647] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=6, tmp=2147483647] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=7] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-2147483636] [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=-2147483636] [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; VAL [A={-2:0}, N=8, \old(a)=2147483647, \old(b)=0, \result=2147483647, a=2147483647, b=0, counter=-2147483636] [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=-2147483636, i=7, tmp=2147483647] [L59] 2 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=7, tmp=2147483647] [L57] 2 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=8] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=2147483647] [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) VAL [A={-2:0}, N=8, \old(cond)=1, cond=1, counter=2147483647] [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; VAL [A={-2:0}, N=8, \old(a)=2147483647, \old(b)=0, \result=2147483647, a=2147483647, b=0, counter=2147483647] [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=7, tmp=2147483647] [L50] 1 counter = tmp VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=7, tmp=2147483647] [L48] 1 i++ VAL [A={-2:0}, N=8, \old(_argptr)={0:0}, _argptr={0:0}, counter=2147483647, i=8] [L57] COND FALSE 2 !(i