/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 12:45:33,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 12:45:33,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 12:45:33,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 12:45:33,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 12:45:33,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 12:45:33,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 12:45:33,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 12:45:33,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 12:45:33,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 12:45:33,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 12:45:33,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 12:45:33,363 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 12:45:33,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 12:45:33,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:45:33,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:45:33,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:45:33,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 12:45:33,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 12:45:33,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 12:45:33,366 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 12:45:33,366 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 12:45:33,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 12:45:33,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 12:45:33,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 12:45:33,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 12:45:33,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 12:45:33,581 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 12:45:33,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-14 12:45:34,841 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81de394f/2abbf79514284b90a5dc3f157fe9cb3b/FLAGa0b7f1b9e [2025-04-14 12:45:35,041 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 12:45:35,042 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-14 12:45:35,048 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81de394f/2abbf79514284b90a5dc3f157fe9cb3b/FLAGa0b7f1b9e [2025-04-14 12:45:35,841 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81de394f/2abbf79514284b90a5dc3f157fe9cb3b [2025-04-14 12:45:35,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 12:45:35,844 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 12:45:35,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 12:45:35,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 12:45:35,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 12:45:35,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:45:35" (1/1) ... [2025-04-14 12:45:35,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96c98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:35, skipping insertion in model container [2025-04-14 12:45:35,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:45:35" (1/1) ... [2025-04-14 12:45:35,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 12:45:36,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-14 12:45:36,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:45:36,023 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 12:45:36,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-14 12:45:36,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:45:36,065 INFO L204 MainTranslator]: Completed translation [2025-04-14 12:45:36,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36 WrapperNode [2025-04-14 12:45:36,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 12:45:36,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 12:45:36,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 12:45:36,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 12:45:36,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,094 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-04-14 12:45:36,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 12:45:36,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 12:45:36,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 12:45:36,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 12:45:36,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 12:45:36,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 12:45:36,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 12:45:36,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 12:45:36,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (1/1) ... [2025-04-14 12:45:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:45:36,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:45:36,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 12:45:36,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 12:45:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 12:45:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 12:45:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 12:45:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 12:45:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 12:45:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 12:45:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 12:45:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 12:45:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 12:45:36,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 12:45:36,170 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 12:45:36,225 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 12:45:36,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 12:45:36,341 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 12:45:36,342 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 12:45:36,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 12:45:36,410 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 12:45:36,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:45:36 BoogieIcfgContainer [2025-04-14 12:45:36,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 12:45:36,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 12:45:36,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 12:45:36,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 12:45:36,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:45:35" (1/3) ... [2025-04-14 12:45:36,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec5e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:45:36, skipping insertion in model container [2025-04-14 12:45:36,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:36" (2/3) ... [2025-04-14 12:45:36,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec5e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:45:36, skipping insertion in model container [2025-04-14 12:45:36,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:45:36" (3/3) ... [2025-04-14 12:45:36,418 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-04-14 12:45:36,429 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 12:45:36,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 24 locations, 23 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 12:45:36,431 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 12:45:36,475 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 12:45:36,512 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:45:36,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 12:45:36,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:45:36,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 12:45:36,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 12:45:36,573 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:45:36,583 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 12:45:36,588 INFO L340 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;@7a580643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:45:36,588 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 12:45:36,956 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:45:36,956 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:45:36,956 INFO L139 ounterexampleChecker]: Examining path program with hash -206082169, occurence #1 [2025-04-14 12:45:36,956 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:45:36,956 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:45:36,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:45:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1373590060, now seen corresponding path program 1 times [2025-04-14 12:45:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:45:36,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415699688] [2025-04-14 12:45:36,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:45:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:45:37,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 12:45:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 12:45:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:45:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:45:37,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415699688] [2025-04-14 12:45:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415699688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:45:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:45:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:45:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732543778] [2025-04-14 12:45:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:45:37,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 12:45:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:45:37,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 12:45:37,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 12:45:37,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:37,335 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:45:37,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-04-14 12:45:37,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:37,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:37,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 12:45:37,413 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:45:37,413 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:45:37,413 INFO L139 ounterexampleChecker]: Examining path program with hash -1721001493, occurence #1 [2025-04-14 12:45:37,413 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:45:37,413 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:45:37,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:45:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1062174849, now seen corresponding path program 1 times [2025-04-14 12:45:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:45:37,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624386908] [2025-04-14 12:45:37,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:45:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:45:37,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 12:45:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 12:45:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:45:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:45:37,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624386908] [2025-04-14 12:45:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624386908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:45:37,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246060640] [2025-04-14 12:45:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:45:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:45:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:45:37,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:45:37,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 12:45:37,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 12:45:37,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 12:45:37,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:45:37,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:37,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 12:45:37,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:45:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:38,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:45:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 12:45:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246060640] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 12:45:38,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:45:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 9] total 18 [2025-04-14 12:45:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364757712] [2025-04-14 12:45:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:45:38,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 12:45:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:45:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 12:45:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-14 12:45:38,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:38,307 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:45:38,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2025-04-14 12:45:38,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:38,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:38,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:38,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:45:38,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 12:45:38,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 12:45:38,751 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:45:38,751 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:45:38,752 INFO L139 ounterexampleChecker]: Examining path program with hash -1905389926, occurence #1 [2025-04-14 12:45:38,752 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:45:38,752 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:45:38,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:45:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash -360854727, now seen corresponding path program 2 times [2025-04-14 12:45:38,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:45:38,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823017162] [2025-04-14 12:45:38,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:45:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:45:38,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-14 12:45:38,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 12:45:38,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:45:38,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-14 12:45:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:45:39,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823017162] [2025-04-14 12:45:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823017162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:45:39,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:45:39,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 12:45:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823118220] [2025-04-14 12:45:39,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:45:39,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 12:45:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:45:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 12:45:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 12:45:39,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:39,115 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:45:39,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2025-04-14 12:45:39,115 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:39,115 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:45:39,115 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:39,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:39,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:45:39,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:39,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 12:45:39,348 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:45:39,348 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:45:39,349 INFO L139 ounterexampleChecker]: Examining path program with hash 1474115749, occurence #1 [2025-04-14 12:45:39,349 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:45:39,349 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:45:39,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:45:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -567536712, now seen corresponding path program 3 times [2025-04-14 12:45:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:45:39,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223890385] [2025-04-14 12:45:39,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:45:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:45:39,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-14 12:45:39,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 12:45:39,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 12:45:39,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:45:40,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223890385] [2025-04-14 12:45:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223890385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:45:40,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491989643] [2025-04-14 12:45:40,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:45:40,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:45:40,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:45:40,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:45:40,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 12:45:40,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-14 12:45:40,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 12:45:40,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 12:45:40,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:45:40,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 12:45:40,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:45:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:45,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:45:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:45:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491989643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:45:51,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:45:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 45 [2025-04-14 12:45:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951220994] [2025-04-14 12:45:51,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:45:51,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-14 12:45:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:45:51,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-14 12:45:51,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1749, Unknown=1, NotChecked=0, Total=2070 [2025-04-14 12:45:51,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:51,066 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:45:51,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.5) internal successors, (115), 45 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) [2025-04-14 12:45:51,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:51,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:45:51,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:45:51,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:45:55,318 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:45:59,607 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:46:03,981 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:46:08,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:46:29,340 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:46:33,343 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:46:37,356 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:46:49,576 WARN L286 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 68 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:47:05,842 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 62 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:47:18,057 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 121 DAG size of output: 42 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:47:26,740 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:47:30,835 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:47:36,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:47:36,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:47:36,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:47:36,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:47:36,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 12:47:37,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:47:37,191 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:47:37,192 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:47:37,192 INFO L139 ounterexampleChecker]: Examining path program with hash -574566373, occurence #1 [2025-04-14 12:47:37,192 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:47:37,192 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:47:37,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:47:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 898657312, now seen corresponding path program 4 times [2025-04-14 12:47:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:47:37,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884040831] [2025-04-14 12:47:37,192 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 12:47:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:47:37,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-04-14 12:47:37,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 12:47:37,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 12:47:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:47:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 12:47:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:47:43,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884040831] [2025-04-14 12:47:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884040831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:47:43,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444164269] [2025-04-14 12:47:43,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 12:47:43,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:47:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:47:43,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:47:43,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 12:47:43,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-04-14 12:47:44,105 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 12:47:44,105 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 12:47:44,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:47:44,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 12:47:44,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:47:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:47:48,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:47:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:47:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444164269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:47:59,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:47:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 32, 32] total 100 [2025-04-14 12:47:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616349493] [2025-04-14 12:47:59,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:47:59,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-14 12:47:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:47:59,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-14 12:47:59,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1284, Invalid=8816, Unknown=0, NotChecked=0, Total=10100 [2025-04-14 12:47:59,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:47:59,770 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:47:59,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 2.089108910891089) internal successors, (211), 100 states have internal predecessors, (211), 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) [2025-04-14 12:47:59,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:47:59,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:47:59,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:47:59,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:47:59,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:50:55,475 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 216 DAG size of output: 145 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:51:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:51:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:51:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:51:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:51:14,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-04-14 12:51:14,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 12:51:14,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:51:14,707 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:51:14,707 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:51:14,707 INFO L139 ounterexampleChecker]: Examining path program with hash 576804050, occurence #1 [2025-04-14 12:51:14,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:51:14,707 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:51:14,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:51:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 888702849, now seen corresponding path program 5 times [2025-04-14 12:51:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:51:14,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689942542] [2025-04-14 12:51:14,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 12:51:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:51:14,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 12 equivalence classes. [2025-04-14 12:51:14,964 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 98 of 98 statements. [2025-04-14 12:51:14,964 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-04-14 12:51:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:51:46,484 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 74 DAG size of output: 69 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:52:15,014 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:52:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:52:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:52:27,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689942542] [2025-04-14 12:52:27,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689942542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:52:27,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315155872] [2025-04-14 12:52:27,898 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 12:52:27,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:52:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:52:27,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:52:27,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 12:52:27,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 12 equivalence classes. [2025-04-14 12:52:28,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 98 of 98 statements. [2025-04-14 12:52:28,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-04-14 12:52:28,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:52:28,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-14 12:52:28,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:53:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:53:25,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:54:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:54:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315155872] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:54:10,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:54:10,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 43] total 125 [2025-04-14 12:54:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207259574] [2025-04-14 12:54:10,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:54:10,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2025-04-14 12:54:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:54:10,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2025-04-14 12:54:10,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1978, Invalid=13759, Unknown=13, NotChecked=0, Total=15750 [2025-04-14 12:54:10,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:54:10,037 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:54:10,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.2936507936507935) internal successors, (289), 125 states have internal predecessors, (289), 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) [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 146 states. [2025-04-14 12:54:10,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:54:38,579 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:54:46,132 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:54:50,286 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:54:54,341 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:55:34,857 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:55:45,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:55:47,903 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:55:58,657 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:55:59,830 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:56:03,842 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:56:45,977 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 82 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:56:58,437 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 148 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:57:09,257 WARN L286 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 305 DAG size of output: 113 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:57:21,751 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 142 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:57:30,310 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 144 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:57:42,057 WARN L286 SmtUtils]: Spent 10.57s on a formula simplification. DAG size of input: 364 DAG size of output: 117 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:57:55,321 WARN L286 SmtUtils]: Spent 12.27s on a formula simplification. DAG size of input: 359 DAG size of output: 42 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:58:38,546 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:58:46,553 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:58:55,929 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:59:00,030 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:59:40,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:59:47,850 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:59:59,874 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 13:00:03,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-14 13:00:04,803 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:00:04,803 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:00:04,807 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:00:05,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 13:00:05,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 13:00:06,007 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 13:00:06,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 13:00:06,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 13:00:06,022 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 13:00:06,024 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 13:00:06,024 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 13:00:06,024 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:00:06,027 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1] [2025-04-14 13:00:06,029 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 13:00:06,029 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:00:06,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:00:06 BasicIcfg [2025-04-14 13:00:06,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:00:06,032 INFO L158 Benchmark]: Toolchain (without parser) took 870188.32ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 99.8MB in the beginning and 1.1GB in the end (delta: -985.5MB). Peak memory consumption was 722.2MB. Max. memory is 8.0GB. [2025-04-14 13:00:06,032 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:00:06,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.69ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 84.6MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 13:00:06,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 13:00:06,033 INFO L158 Benchmark]: Boogie Preprocessor took 26.38ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.4MB in the end (delta: 643.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:00:06,033 INFO L158 Benchmark]: RCFGBuilder took 288.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 60.8MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:00:06,033 INFO L158 Benchmark]: TraceAbstraction took 869620.23ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 60.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 684.5MB. Max. memory is 8.0GB. [2025-04-14 13:00:06,034 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.19ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.69ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 84.6MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.38ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.4MB in the end (delta: 643.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 288.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 60.8MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 869620.23ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 60.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 684.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: 1308, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 348, dependent conditional: 339, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1009, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 49, dependent conditional: 40, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1009, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 49, dependent conditional: 40, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1061, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 101, dependent conditional: 92, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1061, independent: 960, independent conditional: 0, independent unconditional: 960, dependent: 101, dependent conditional: 38, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1061, independent: 960, independent conditional: 0, independent unconditional: 960, dependent: 101, dependent conditional: 38, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 202, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 202, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 550, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 513, dependent conditional: 234, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1061, independent: 781, independent conditional: 0, independent unconditional: 781, dependent: 78, dependent conditional: 24, dependent unconditional: 54, unknown: 202, unknown conditional: 14, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 23, Negative conditional cache size: 14, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 815, Maximal queried relation: 4, Independence queries for same thread: 299, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 46, Number of trivial persistent sets: 37, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1308, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 348, dependent conditional: 339, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1009, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 49, dependent conditional: 40, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1009, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 49, dependent conditional: 40, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1061, independent: 960, independent conditional: 761, independent unconditional: 199, dependent: 101, dependent conditional: 92, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1061, independent: 960, independent conditional: 0, independent unconditional: 960, dependent: 101, dependent conditional: 38, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1061, independent: 960, independent conditional: 0, independent unconditional: 960, dependent: 101, dependent conditional: 38, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 202, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 202, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 14, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 550, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 513, dependent conditional: 234, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1061, independent: 781, independent conditional: 0, independent unconditional: 781, dependent: 78, dependent conditional: 24, dependent unconditional: 54, unknown: 202, unknown conditional: 14, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 23, Negative conditional cache size: 14, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 815, Maximal queried relation: 4, Independence queries for same thread: 299 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 39 locations, 42 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 869.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 657.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 209.8s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 37391 SizeOfPredicates, 39 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 45/1914 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown