/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:53:36,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:53:36,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 16:53:36,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:53:36,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:53:36,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:53:36,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:53:36,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:53:36,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:53:36,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:53:36,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:53:36,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:53:36,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:53:36,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:53:36,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:53:36,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:36,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:36,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:36,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:53:36,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 16:53:36,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:53:36,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:53:36,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:53:36,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:53:36,442 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:53:36,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 16:53:37,796 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed51db5f/0b0452b4503d4dffbdf1a244c6e107ec/FLAG036314576 [2025-04-13 16:53:38,057 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:53:38,057 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 16:53:38,070 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed51db5f/0b0452b4503d4dffbdf1a244c6e107ec/FLAG036314576 [2025-04-13 16:53:38,797 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed51db5f/0b0452b4503d4dffbdf1a244c6e107ec [2025-04-13 16:53:38,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:53:38,800 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:53:38,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:38,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:53:38,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:53:38,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:38" (1/1) ... [2025-04-13 16:53:38,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0b39cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:38, skipping insertion in model container [2025-04-13 16:53:38,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:38" (1/1) ... [2025-04-13 16:53:38,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:53:39,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 16:53:39,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:39,121 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:53:39,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 16:53:39,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:39,225 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:53:39,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39 WrapperNode [2025-04-13 16:53:39,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:39,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:39,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:53:39,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:53:39,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,257 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 16:53:39,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:39,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:53:39,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:53:39,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:53:39,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,285 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 16:53:39,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:53:39,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:53:39,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:53:39,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:53:39,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:39,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:39,323 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-13 16:53:39,325 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-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:53:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:53:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 16:53:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:53:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:53:39,344 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:53:39,431 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:53:39,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:53:39,528 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:53:39,529 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:53:39,529 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:53:39,621 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:39,624 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:39,629 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:53:39,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:39 BoogieIcfgContainer [2025-04-13 16:53:39,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:53:39,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:53:39,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:53:39,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:53:39,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:53:38" (1/3) ... [2025-04-13 16:53:39,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389562c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:39, skipping insertion in model container [2025-04-13 16:53:39,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (2/3) ... [2025-04-13 16:53:39,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389562c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:39, skipping insertion in model container [2025-04-13 16:53:39,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:39" (3/3) ... [2025-04-13 16:53:39,638 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2025-04-13 16:53:39,648 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:53:39,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-12.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 16:53:39,649 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:53:39,682 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 16:53:39,704 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 16:53:39,727 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 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-13 16:53:39,747 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:53:39,754 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=FINITE_AUTOMATA, 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;@7ba16b18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:53:39,754 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 16:53:39,757 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 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-13 16:53:39,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:53:39,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:39,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:39,764 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-13 16:53:39,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1561770242, now seen corresponding path program 1 times [2025-04-13 16:53:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:39,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181157088] [2025-04-13 16:53:39,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:39,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:53:39,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:53:39,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:39,972 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-13 16:53:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:39,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181157088] [2025-04-13 16:53:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181157088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:53:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891721417] [2025-04-13 16:53:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:39,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:39,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:39,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:39,997 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 16:53:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:40,064 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 16:53:40,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:40,065 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2025-04-13 16:53:40,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:40,071 INFO L225 Difference]: With dead ends: 173 [2025-04-13 16:53:40,071 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 16:53:40,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:40,075 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:40,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 16:53:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 16:53:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 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-13 16:53:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 16:53:40,120 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 16:53:40,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:40,123 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 16:53:40,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 16:53:40,124 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 16:53:40,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 16:53:40,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:40,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:40,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:53:40,126 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-13 16:53:40,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1170211856, now seen corresponding path program 1 times [2025-04-13 16:53:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:40,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087219928] [2025-04-13 16:53:40,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:40,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:40,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087219928] [2025-04-13 16:53:40,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087219928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:40,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040610777] [2025-04-13 16:53:40,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:40,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:40,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:53:40,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 16:53:40,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:40,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:40,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:40,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 16:53:40,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040610777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:40,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 16:53:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405778961] [2025-04-13 16:53:40,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:40,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:53:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:40,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:53:40,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:40,362 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-13 16:53:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:40,443 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 16:53:40,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 16:53:40,444 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) Word has length 12 [2025-04-13 16:53:40,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:40,445 INFO L225 Difference]: With dead ends: 205 [2025-04-13 16:53:40,445 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 16:53:40,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:40,446 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:40,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 16:53:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 16:53:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 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-13 16:53:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 16:53:40,457 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 16:53:40,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:40,457 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 16:53:40,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-13 16:53:40,457 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 16:53:40,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:53:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:40,458 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:40,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 16:53:40,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:40,662 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-13 16:53:40,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash 493351806, now seen corresponding path program 2 times [2025-04-13 16:53:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:40,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298723039] [2025-04-13 16:53:40,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:40,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:40,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:40,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:40,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298723039] [2025-04-13 16:53:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298723039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:40,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648106339] [2025-04-13 16:53:40,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:40,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:40,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:40,794 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-13 16:53:40,796 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-13 16:53:40,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:40,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:40,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 16:53:40,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648106339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:40,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 16:53:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658073186] [2025-04-13 16:53:40,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:40,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 16:53:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 16:53:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:40,934 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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-13 16:53:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:41,067 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 16:53:41,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 16:53:41,068 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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) Word has length 15 [2025-04-13 16:53:41,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:41,070 INFO L225 Difference]: With dead ends: 301 [2025-04-13 16:53:41,070 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 16:53:41,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:41,071 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:41,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 28 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 16:53:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 16:53:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 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-13 16:53:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 16:53:41,091 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 16:53:41,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:41,091 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 16:53:41,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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-13 16:53:41,091 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 16:53:41,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 16:53:41,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:41,093 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:41,099 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-13 16:53:41,293 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,SelfDestructingSolverStorable2 [2025-04-13 16:53:41,293 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-13 16:53:41,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1439646146, now seen corresponding path program 3 times [2025-04-13 16:53:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:41,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40348811] [2025-04-13 16:53:41,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:41,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:41,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:41,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:41,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:41,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40348811] [2025-04-13 16:53:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40348811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:41,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500258208] [2025-04-13 16:53:41,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:41,522 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-13 16:53:41,523 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-13 16:53:41,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:41,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:41,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:41,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:41,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 16:53:41,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500258208] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:41,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:41,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 16:53:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694734021] [2025-04-13 16:53:41,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:41,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 16:53:41,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:41,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 16:53:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 16:53:41,790 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-13 16:53:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:42,028 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 16:53:42,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 16:53:42,028 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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) Word has length 21 [2025-04-13 16:53:42,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:42,033 INFO L225 Difference]: With dead ends: 493 [2025-04-13 16:53:42,034 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 16:53:42,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 16:53:42,035 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 332 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:42,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 58 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:53:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 16:53:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 16:53:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.9662162162162162) internal successors, (1317), 444 states have internal predecessors, (1317), 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-13 16:53:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 16:53:42,069 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 16:53:42,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:42,069 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 16:53:42,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-13 16:53:42,069 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 16:53:42,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 16:53:42,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:42,071 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:42,081 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-13 16:53:42,271 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-13 16:53:42,272 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-13 16:53:42,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1097522242, now seen corresponding path program 4 times [2025-04-13 16:53:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:42,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700192407] [2025-04-13 16:53:42,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:42,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 16:53:42,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 16:53:42,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:42,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700192407] [2025-04-13 16:53:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700192407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:42,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808515953] [2025-04-13 16:53:42,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:42,709 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-13 16:53:42,711 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-13 16:53:42,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 16:53:42,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 16:53:42,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:42,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:42,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 16:53:42,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:42,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808515953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:43,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:43,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-04-13 16:53:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569164713] [2025-04-13 16:53:43,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:43,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 16:53:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:43,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 16:53:43,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 16:53:43,140 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-13 16:53:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:43,368 INFO L93 Difference]: Finished difference Result 557 states and 1701 transitions. [2025-04-13 16:53:43,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 16:53:43,369 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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) Word has length 33 [2025-04-13 16:53:43,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:43,372 INFO L225 Difference]: With dead ends: 557 [2025-04-13 16:53:43,372 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 16:53:43,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 16:53:43,373 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 540 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:43,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 61 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:53:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 16:53:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-04-13 16:53:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 2.970472440944882) internal successors, (1509), 508 states have internal predecessors, (1509), 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-13 16:53:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1509 transitions. [2025-04-13 16:53:43,393 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1509 transitions. Word has length 33 [2025-04-13 16:53:43,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:43,394 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1509 transitions. [2025-04-13 16:53:43,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-13 16:53:43,394 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1509 transitions. [2025-04-13 16:53:43,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 16:53:43,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:43,395 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:43,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 16:53:43,600 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-13 16:53:43,600 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-13 16:53:43,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1839763394, now seen corresponding path program 5 times [2025-04-13 16:53:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:43,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502070276] [2025-04-13 16:53:43,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 16:53:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:43,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 16:53:43,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 16:53:43,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 16:53:43,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:45,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502070276] [2025-04-13 16:53:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502070276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:45,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801938390] [2025-04-13 16:53:45,270 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 16:53:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:45,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:45,273 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-13 16:53:45,273 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-13 16:53:45,310 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 16:53:45,346 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 16:53:45,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 16:53:45,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:45,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-13 16:53:45,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:46,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801938390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:48,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-04-13 16:53:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712056109] [2025-04-13 16:53:48,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:48,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-04-13 16:53:48,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:48,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-04-13 16:53:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=7231, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 16:53:48,538 INFO L87 Difference]: Start difference. First operand 509 states and 1509 transitions. Second operand has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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-13 16:54:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:09,002 INFO L93 Difference]: Finished difference Result 16045 states and 48049 transitions. [2025-04-13 16:54:09,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-04-13 16:54:09,002 INFO L79 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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) Word has length 37 [2025-04-13 16:54:09,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:09,081 INFO L225 Difference]: With dead ends: 16045 [2025-04-13 16:54:09,081 INFO L226 Difference]: Without dead ends: 15180 [2025-04-13 16:54:09,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16989 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=12137, Invalid=43795, Unknown=0, NotChecked=0, Total=55932 [2025-04-13 16:54:09,096 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 4190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6388 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 6388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:09,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 6 Invalid, 7045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 6388 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 16:54:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15180 states. [2025-04-13 16:54:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15180 to 13356. [2025-04-13 16:54:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13356 states, 13355 states have (on average 3.031748408835642) internal successors, (40489), 13355 states have internal predecessors, (40489), 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-13 16:54:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13356 states to 13356 states and 40489 transitions. [2025-04-13 16:54:10,231 INFO L79 Accepts]: Start accepts. Automaton has 13356 states and 40489 transitions. Word has length 37 [2025-04-13 16:54:10,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:10,232 INFO L485 AbstractCegarLoop]: Abstraction has 13356 states and 40489 transitions. [2025-04-13 16:54:10,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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-13 16:54:10,233 INFO L278 IsEmpty]: Start isEmpty. Operand 13356 states and 40489 transitions. [2025-04-13 16:54:10,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 16:54:10,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:10,251 INFO L218 NwaCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:10,257 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-13 16:54:10,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:10,454 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:54:10,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -817188203, now seen corresponding path program 1 times [2025-04-13 16:54:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:10,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371988892] [2025-04-13 16:54:10,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:10,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 16:54:10,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 16:54:10,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:10,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:12,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371988892] [2025-04-13 16:54:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371988892] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:54:12,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245014070] [2025-04-13 16:54:12,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:12,122 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:54:12,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 16:54:12,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 16:54:12,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 16:54:12,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:12,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 16:54:12,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:54:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 300 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:13,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:54:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245014070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:54:15,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:54:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 16:54:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006937471] [2025-04-13 16:54:15,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:54:15,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 16:54:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:15,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 16:54:15,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=8697, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 16:54:15,102 INFO L87 Difference]: Start difference. First operand 13356 states and 40489 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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-13 16:57:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:57:47,837 INFO L93 Difference]: Finished difference Result 232201 states and 721774 transitions. [2025-04-13 16:57:47,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 855 states. [2025-04-13 16:57:47,838 INFO L79 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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) Word has length 41 [2025-04-13 16:57:47,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:57:49,056 INFO L225 Difference]: With dead ends: 232201 [2025-04-13 16:57:49,057 INFO L226 Difference]: Without dead ends: 230003 [2025-04-13 16:57:49,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 946 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442780 ImplicationChecksByTransitivity, 166.1s TimeCoverageRelationStatistics Valid=173516, Invalid=724240, Unknown=0, NotChecked=0, Total=897756 [2025-04-13 16:57:49,192 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 7652 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15321 mSolverCounterSat, 2095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7652 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 17416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2095 IncrementalHoareTripleChecker+Valid, 15321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-04-13 16:57:49,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7652 Valid, 6 Invalid, 17416 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2095 Valid, 15321 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-04-13 16:57:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230003 states. [2025-04-13 16:58:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230003 to 156154. [2025-04-13 16:58:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156154 states, 156153 states have (on average 3.5089751717866453) internal successors, (547937), 156153 states have internal predecessors, (547937), 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-13 16:58:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156154 states to 156154 states and 547937 transitions. [2025-04-13 16:58:14,670 INFO L79 Accepts]: Start accepts. Automaton has 156154 states and 547937 transitions. Word has length 41 [2025-04-13 16:58:14,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:58:14,671 INFO L485 AbstractCegarLoop]: Abstraction has 156154 states and 547937 transitions. [2025-04-13 16:58:14,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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-13 16:58:14,671 INFO L278 IsEmpty]: Start isEmpty. Operand 156154 states and 547937 transitions. [2025-04-13 16:58:14,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 16:58:14,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:58:14,739 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:58:14,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 16:58:14,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:58:14,940 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:58:14,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:58:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1566992332, now seen corresponding path program 1 times [2025-04-13 16:58:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:58:14,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217367883] [2025-04-13 16:58:14,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:58:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:58:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 16:58:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 16:58:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:58:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:58:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:16,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:58:16,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217367883] [2025-04-13 16:58:16,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217367883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:58:16,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80068839] [2025-04-13 16:58:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:58:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:58:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:58:16,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:58:16,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 16:58:16,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 16:58:16,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 16:58:16,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:58:16,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:58:16,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 16:58:16,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:58:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:18,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:58:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80068839] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:58:19,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:58:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2025-04-13 16:58:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586120399] [2025-04-13 16:58:19,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:58:19,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-04-13 16:58:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:58:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-04-13 16:58:19,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=8457, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 16:58:19,547 INFO L87 Difference]: Start difference. First operand 156154 states and 547937 transitions. Second operand has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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-13 17:01:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:43,215 INFO L93 Difference]: Finished difference Result 556703 states and 1919095 transitions. [2025-04-13 17:01:43,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 587 states. [2025-04-13 17:01:43,216 INFO L79 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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) Word has length 41 [2025-04-13 17:01:43,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:47,297 INFO L225 Difference]: With dead ends: 556703 [2025-04-13 17:01:47,298 INFO L226 Difference]: Without dead ends: 556116 [2025-04-13 17:01:47,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224912 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=105978, Invalid=354384, Unknown=0, NotChecked=0, Total=460362 [2025-04-13 17:01:47,777 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 6200 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13724 mSolverCounterSat, 1450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6200 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 15174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 13724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:47,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6200 Valid, 6 Invalid, 15174 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1450 Valid, 13724 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-04-13 17:01:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556116 states. [2025-04-13 17:03:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556116 to 492115. [2025-04-13 17:03:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492115 states, 492114 states have (on average 3.59472195466904) internal successors, (1769013), 492114 states have internal predecessors, (1769013), 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-13 17:03:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492115 states to 492115 states and 1769013 transitions. [2025-04-13 17:03:28,225 INFO L79 Accepts]: Start accepts. Automaton has 492115 states and 1769013 transitions. Word has length 41 [2025-04-13 17:03:28,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:03:28,228 INFO L485 AbstractCegarLoop]: Abstraction has 492115 states and 1769013 transitions. [2025-04-13 17:03:28,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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-13 17:03:28,228 INFO L278 IsEmpty]: Start isEmpty. Operand 492115 states and 1769013 transitions. [2025-04-13 17:03:29,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:03:29,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:03:29,381 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:03:29,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 17:03:29,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:03:29,586 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:03:29,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:03:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash 848678346, now seen corresponding path program 2 times [2025-04-13 17:03:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:03:29,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527922652] [2025-04-13 17:03:29,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:03:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:03:29,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:03:29,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:03:29,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:03:29,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:03:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:03:32,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:03:32,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527922652] [2025-04-13 17:03:32,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527922652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:03:32,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436522498] [2025-04-13 17:03:32,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:03:32,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:03:32,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:03:32,226 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:03:32,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 17:03:32,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:03:32,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:03:32,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:03:32,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:03:32,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 17:03:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:03:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 300 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:03:34,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:03:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:03:36,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436522498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:03:36,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:03:36,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2025-04-13 17:03:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663530327] [2025-04-13 17:03:36,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:03:36,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-04-13 17:03:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:03:36,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-04-13 17:03:36,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1416, Invalid=8484, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 17:03:36,012 INFO L87 Difference]: Start difference. First operand 492115 states and 1769013 transitions. Second operand has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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) Received shutdown request... [2025-04-13 17:06:09,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 344 states. [2025-04-13 17:06:09,796 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-13 17:06:09,797 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:06:09,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75578 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=46622, Invalid=144784, Unknown=0, NotChecked=0, Total=191406 [2025-04-13 17:06:09,821 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 3496 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9615 mSolverCounterSat, 1390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3496 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 9615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:09,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3496 Valid, 6 Invalid, 11005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1390 Valid, 9615 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 17:06:09,823 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:09,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 17:06:10,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 17:06:10,028 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (492115states) and FLOYD_HOARE automaton (currently 344 states, 100 states before enhancement),while ReachableStatesComputation was computing reachable states (399809 states constructed, input type IntersectNwa). [2025-04-13 17:06:10,032 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:10,033 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:10,042 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2025-04-13 17:06:10,049 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:10,049 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:10,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:10 BasicIcfg [2025-04-13 17:06:10,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:10,061 INFO L158 Benchmark]: Toolchain (without parser) took 751256.71ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 107.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 6.7GB. Max. memory is 8.0GB. [2025-04-13 17:06:10,061 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:10,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.63ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 85.0MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:10,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.13ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:10,062 INFO L158 Benchmark]: Boogie Preprocessor took 35.89ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:10,063 INFO L158 Benchmark]: RCFGBuilder took 334.68ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 55.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:10,063 INFO L158 Benchmark]: TraceAbstraction took 750425.27ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 55.2MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2025-04-13 17:06:10,072 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.22ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.63ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 85.0MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.13ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.89ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 334.68ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 55.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 750425.27ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 55.2MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (492115states) and FLOYD_HOARE automaton (currently 344 states, 100 states before enhancement),while ReachableStatesComputation was computing reachable states (399809 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (492115states) and FLOYD_HOARE automaton (currently 344 states, 100 states before enhancement),while ReachableStatesComputation was computing reachable states (399809 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (492115states) and FLOYD_HOARE automaton (currently 344 states, 100 states before enhancement),while ReachableStatesComputation was computing reachable states (399809 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 750.3s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 5, EmptinessCheckTime: 1.3s, AutomataDifference: 597.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22694 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22694 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 5609 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45605 IncrementalHoareTripleChecker+Invalid, 51214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5609 mSolverCounterUnsat, 33 mSDtfsCounter, 45605 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2556 GetRequests, 176 SyntacticMatches, 20 SemanticMatches, 2360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760569 ImplicationChecksByTransitivity, 298.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492115occurred in iteration=8, InterpolantAutomatonStates: 1662, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 126.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 139674 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 8323 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2055 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 1200/5097 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: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown