/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/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:06:38,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:06:38,666 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 17:06:38,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:06:38,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:06:38,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:06:38,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:06:38,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:06:38,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:06:38,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:06:38,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:06:38,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:06:38,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:06:38,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:06:38,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:06:38,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:38,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:38,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:06:38,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:06:38,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:06:38,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:06:38,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:06:38,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:06:38,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:06:38,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:06:38,699 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 17:06:38,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:06:38,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:06:38,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:06:38,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:06:38,919 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:06:38,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-04-13 17:06:40,136 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227967a4c/2de0bd2f728e4774be1de902291d63a7/FLAG77c47acb4 [2025-04-13 17:06:40,392 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:06:40,392 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-04-13 17:06:40,407 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227967a4c/2de0bd2f728e4774be1de902291d63a7/FLAG77c47acb4 [2025-04-13 17:06:41,186 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227967a4c/2de0bd2f728e4774be1de902291d63a7 [2025-04-13 17:06:41,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:06:41,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:06:41,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:41,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:06:41,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:06:41,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513b3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41, skipping insertion in model container [2025-04-13 17:06:41,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:06:41,439 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/triangular-longest-2.i[30964,30977] [2025-04-13 17:06:41,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:41,449 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:06:41,488 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/triangular-longest-2.i[30964,30977] [2025-04-13 17:06:41,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:41,515 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:06:41,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41 WrapperNode [2025-04-13 17:06:41,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:41,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:41,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:06:41,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:06:41,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,541 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 17:06:41,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:41,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:06:41,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:06:41,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:06:41,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,556 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 17:06:41,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:06:41,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:06:41,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:06:41,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:06:41,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (1/1) ... [2025-04-13 17:06:41,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:41,603 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 17:06:41,605 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 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:06:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:06:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:06:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:06:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:06:41,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:06:41,623 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 17:06:41,715 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:06:41,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:06:41,797 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:06:41,797 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:06:41,797 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:06:41,866 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:41,872 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:41,875 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:06:41,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:41 BoogieIcfgContainer [2025-04-13 17:06:41,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:06:41,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:06:41,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:06:41,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:06:41,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:06:41" (1/3) ... [2025-04-13 17:06:41,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc692f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:41, skipping insertion in model container [2025-04-13 17:06:41,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:41" (2/3) ... [2025-04-13 17:06:41,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc692f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:41, skipping insertion in model container [2025-04-13 17:06:41,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:41" (3/3) ... [2025-04-13 17:06:41,882 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-04-13 17:06:41,891 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:06:41,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 17:06:41,892 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:06:41,916 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:06:41,936 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 17:06:41,952 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 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:06:41,974 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:06:41,983 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;@66f21fc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:06:41,984 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:06:41,985 INFO L278 IsEmpty]: Start isEmpty. Operand has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 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:06:41,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:06:41,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:41,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:41,990 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 17:06:41,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1193666932, now seen corresponding path program 1 times [2025-04-13 17:06:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:41,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478177075] [2025-04-13 17:06:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:06:42,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:06:42,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:42,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,338 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 17:06:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478177075] [2025-04-13 17:06:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478177075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:06:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637241596] [2025-04-13 17:06:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:42,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:06:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:42,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:06:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:06:42,359 INFO L87 Difference]: Start difference. First operand has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:06:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:42,490 INFO L93 Difference]: Finished difference Result 160 states and 472 transitions. [2025-04-13 17:06:42,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:06:42,493 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-13 17:06:42,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:42,500 INFO L225 Difference]: With dead ends: 160 [2025-04-13 17:06:42,501 INFO L226 Difference]: Without dead ends: 94 [2025-04-13 17:06:42,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:06:42,504 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:42,505 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-13 17:06:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-13 17:06:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.6881720430107525) internal successors, (250), 93 states have internal predecessors, (250), 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:06:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 250 transitions. [2025-04-13 17:06:42,533 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 250 transitions. Word has length 8 [2025-04-13 17:06:42,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:42,533 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 250 transitions. [2025-04-13 17:06:42,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:06:42,533 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 250 transitions. [2025-04-13 17:06:42,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:42,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:42,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:42,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:06:42,535 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 17:06:42,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash -113514130, now seen corresponding path program 1 times [2025-04-13 17:06:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:42,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455726146] [2025-04-13 17:06:42,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,667 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 17:06:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455726146] [2025-04-13 17:06:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455726146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:06:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616051046] [2025-04-13 17:06:42,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:42,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:06:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:42,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:06:42,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:42,669 INFO L87 Difference]: Start difference. First operand 94 states and 250 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:42,799 INFO L93 Difference]: Finished difference Result 156 states and 417 transitions. [2025-04-13 17:06:42,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:42,799 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-04-13 17:06:42,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:42,800 INFO L225 Difference]: With dead ends: 156 [2025-04-13 17:06:42,800 INFO L226 Difference]: Without dead ends: 115 [2025-04-13 17:06:42,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:06:42,801 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:42,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-13 17:06:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-04-13 17:06:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.6407766990291264) internal successors, (272), 103 states have internal predecessors, (272), 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:06:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 272 transitions. [2025-04-13 17:06:42,811 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 272 transitions. Word has length 10 [2025-04-13 17:06:42,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:42,812 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 272 transitions. [2025-04-13 17:06:42,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06:42,812 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 272 transitions. [2025-04-13 17:06:42,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:06:42,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:42,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:42,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:06:42,813 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 17:06:42,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash -74058640, now seen corresponding path program 1 times [2025-04-13 17:06:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:42,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804722351] [2025-04-13 17:06:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:06:42,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:06:42,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:42,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,928 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 17:06:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804722351] [2025-04-13 17:06:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804722351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:06:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519669047] [2025-04-13 17:06:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:42,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:06:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:42,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:06:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:06:42,930 INFO L87 Difference]: Start difference. First operand 104 states and 272 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:06:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:43,070 INFO L93 Difference]: Finished difference Result 181 states and 489 transitions. [2025-04-13 17:06:43,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:06:43,071 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 17:06:43,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:43,072 INFO L225 Difference]: With dead ends: 181 [2025-04-13 17:06:43,072 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 17:06:43,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:06:43,073 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:43,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 17:06:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2025-04-13 17:06:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.63) internal successors, (263), 100 states have internal predecessors, (263), 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:06:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 263 transitions. [2025-04-13 17:06:43,083 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 263 transitions. Word has length 12 [2025-04-13 17:06:43,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:43,083 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 263 transitions. [2025-04-13 17:06:43,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:06:43,084 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 263 transitions. [2025-04-13 17:06:43,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:06:43,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:43,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:43,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:06:43,085 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 17:06:43,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1181930978, now seen corresponding path program 2 times [2025-04-13 17:06:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:43,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735110618] [2025-04-13 17:06:43,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:43,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:06:43,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:06:43,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:06:43,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:43,212 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 17:06:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:43,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735110618] [2025-04-13 17:06:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735110618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:43,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:43,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:06:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823271546] [2025-04-13 17:06:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:43,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:06:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:43,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:06:43,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:06:43,213 INFO L87 Difference]: Start difference. First operand 101 states and 263 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:06:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:43,338 INFO L93 Difference]: Finished difference Result 187 states and 489 transitions. [2025-04-13 17:06:43,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:06:43,339 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 17:06:43,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:43,340 INFO L225 Difference]: With dead ends: 187 [2025-04-13 17:06:43,340 INFO L226 Difference]: Without dead ends: 147 [2025-04-13 17:06:43,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:06:43,341 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:43,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-13 17:06:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2025-04-13 17:06:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.683333333333333) internal successors, (322), 120 states have internal predecessors, (322), 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:06:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 322 transitions. [2025-04-13 17:06:43,357 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 322 transitions. Word has length 12 [2025-04-13 17:06:43,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:43,357 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 322 transitions. [2025-04-13 17:06:43,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:06:43,358 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 322 transitions. [2025-04-13 17:06:43,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:06:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:43,358 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:43,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:06:43,358 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 17:06:43,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1785516029, now seen corresponding path program 1 times [2025-04-13 17:06:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:43,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252603233] [2025-04-13 17:06:43,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:43,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:43,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:43,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:43,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:43,454 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 17:06:43,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:43,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252603233] [2025-04-13 17:06:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252603233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:43,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023666431] [2025-04-13 17:06:43,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:43,456 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 17:06:43,458 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 17:06:43,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:43,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:43,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:06:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:43,593 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 17:06:43,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:43,703 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 17:06:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023666431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:43,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 17:06:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041192920] [2025-04-13 17:06:43,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:43,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:06:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:43,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:06:43,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:06:43,705 INFO L87 Difference]: Start difference. First operand 121 states and 322 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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:06:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:44,015 INFO L93 Difference]: Finished difference Result 283 states and 799 transitions. [2025-04-13 17:06:44,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:06:44,016 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 14 [2025-04-13 17:06:44,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:44,017 INFO L225 Difference]: With dead ends: 283 [2025-04-13 17:06:44,017 INFO L226 Difference]: Without dead ends: 165 [2025-04-13 17:06:44,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:06:44,018 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:44,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-13 17:06:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2025-04-13 17:06:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.676056338028169) internal successors, (380), 142 states have internal predecessors, (380), 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:06:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 380 transitions. [2025-04-13 17:06:44,027 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 380 transitions. Word has length 14 [2025-04-13 17:06:44,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:44,027 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 380 transitions. [2025-04-13 17:06:44,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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:06:44,027 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 380 transitions. [2025-04-13 17:06:44,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:06:44,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:44,029 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:44,037 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 17:06:44,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:44,229 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 17:06:44,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1086548674, now seen corresponding path program 1 times [2025-04-13 17:06:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:44,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328552059] [2025-04-13 17:06:44,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:44,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:06:44,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:06:44,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:44,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328552059] [2025-04-13 17:06:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328552059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:44,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116965458] [2025-04-13 17:06:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:44,355 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 17:06:44,356 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 17:06:44,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:06:44,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:06:44,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:44,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 17:06:44,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:44,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116965458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:44,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 17:06:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433345706] [2025-04-13 17:06:44,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:44,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:06:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:44,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:06:44,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:06:44,575 INFO L87 Difference]: Start difference. First operand 143 states and 380 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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:06:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:45,183 INFO L93 Difference]: Finished difference Result 583 states and 1639 transitions. [2025-04-13 17:06:45,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:06:45,184 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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 20 [2025-04-13 17:06:45,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:45,186 INFO L225 Difference]: With dead ends: 583 [2025-04-13 17:06:45,186 INFO L226 Difference]: Without dead ends: 365 [2025-04-13 17:06:45,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=652, Invalid=1700, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:06:45,191 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:45,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-04-13 17:06:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 215. [2025-04-13 17:06:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.6448598130841123) internal successors, (566), 214 states have internal predecessors, (566), 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:06:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 566 transitions. [2025-04-13 17:06:45,208 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 566 transitions. Word has length 20 [2025-04-13 17:06:45,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:45,208 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 566 transitions. [2025-04-13 17:06:45,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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:06:45,208 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 566 transitions. [2025-04-13 17:06:45,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:06:45,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:45,210 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:45,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:45,411 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,SelfDestructingSolverStorable5 [2025-04-13 17:06:45,411 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 17:06:45,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1894636035, now seen corresponding path program 2 times [2025-04-13 17:06:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:45,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195709766] [2025-04-13 17:06:45,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:45,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:06:45,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:06:45,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:45,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:45,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195709766] [2025-04-13 17:06:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195709766] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:45,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66388531] [2025-04-13 17:06:45,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:45,568 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 17:06:45,570 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 17:06:45,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:06:45,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:06:45,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:45,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:06:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:45,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66388531] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:45,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-04-13 17:06:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339725058] [2025-04-13 17:06:45,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:45,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:06:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:45,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:06:45,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:06:45,837 INFO L87 Difference]: Start difference. First operand 215 states and 566 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:06:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:46,736 INFO L93 Difference]: Finished difference Result 739 states and 2071 transitions. [2025-04-13 17:06:46,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 17:06:46,737 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 26 [2025-04-13 17:06:46,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:46,739 INFO L225 Difference]: With dead ends: 739 [2025-04-13 17:06:46,739 INFO L226 Difference]: Without dead ends: 469 [2025-04-13 17:06:46,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1428, Invalid=3828, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:06:46,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 568 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:46,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-04-13 17:06:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 287. [2025-04-13 17:06:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.6713286713286712) internal successors, (764), 286 states have internal predecessors, (764), 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:06:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 764 transitions. [2025-04-13 17:06:46,750 INFO L79 Accepts]: Start accepts. Automaton has 287 states and 764 transitions. Word has length 26 [2025-04-13 17:06:46,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:46,750 INFO L485 AbstractCegarLoop]: Abstraction has 287 states and 764 transitions. [2025-04-13 17:06:46,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:06:46,750 INFO L278 IsEmpty]: Start isEmpty. Operand 287 states and 764 transitions. [2025-04-13 17:06:46,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 17:06:46,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:46,751 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:46,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:06:46,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:46,952 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 17:06:46,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash -391232322, now seen corresponding path program 3 times [2025-04-13 17:06:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:46,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022419607] [2025-04-13 17:06:46,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:46,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 15 equivalence classes. [2025-04-13 17:06:46,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 17:06:46,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-13 17:06:46,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 1 proven. 189 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:47,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022419607] [2025-04-13 17:06:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022419607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:47,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457638271] [2025-04-13 17:06:47,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:47,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:47,240 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 17:06:47,241 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 17:06:47,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 15 equivalence classes. [2025-04-13 17:06:47,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 17:06:47,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-13 17:06:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:47,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:06:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 1 proven. 189 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:47,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457638271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:47,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2025-04-13 17:06:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081492929] [2025-04-13 17:06:47,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:47,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:06:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:47,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:06:47,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1321, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:06:47,702 INFO L87 Difference]: Start difference. First operand 287 states and 764 transitions. Second operand has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 41 states have internal predecessors, (88), 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:06:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:49,652 INFO L93 Difference]: Finished difference Result 1509 states and 4237 transitions. [2025-04-13 17:06:49,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-04-13 17:06:49,653 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 41 states have internal predecessors, (88), 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 44 [2025-04-13 17:06:49,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:49,659 INFO L225 Difference]: With dead ends: 1509 [2025-04-13 17:06:49,659 INFO L226 Difference]: Without dead ends: 1005 [2025-04-13 17:06:49,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4605, Invalid=12951, Unknown=0, NotChecked=0, Total=17556 [2025-04-13 17:06:49,673 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1130 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:49,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 1 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:06:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-04-13 17:06:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 495. [2025-04-13 17:06:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.651821862348178) internal successors, (1310), 494 states have internal predecessors, (1310), 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:06:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1310 transitions. [2025-04-13 17:06:49,687 INFO L79 Accepts]: Start accepts. Automaton has 495 states and 1310 transitions. Word has length 44 [2025-04-13 17:06:49,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:49,688 INFO L485 AbstractCegarLoop]: Abstraction has 495 states and 1310 transitions. [2025-04-13 17:06:49,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 41 states have internal predecessors, (88), 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:06:49,688 INFO L278 IsEmpty]: Start isEmpty. Operand 495 states and 1310 transitions. [2025-04-13 17:06:49,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-04-13 17:06:49,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:49,689 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:49,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 17:06:49,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:49,890 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:06:49,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 930407388, now seen corresponding path program 4 times [2025-04-13 17:06:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:49,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031452002] [2025-04-13 17:06:49,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:49,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-04-13 17:06:49,903 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-13 17:06:49,903 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:49,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:06:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:50,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031452002] [2025-04-13 17:06:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031452002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:50,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904862536] [2025-04-13 17:06:50,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:50,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:50,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:50,507 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 17:06:50,508 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 17:06:50,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-04-13 17:06:50,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-13 17:06:50,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:50,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:50,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:06:50,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:06:50,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:06:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904862536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:51,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 45 [2025-04-13 17:06:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801501166] [2025-04-13 17:06:51,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:51,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 17:06:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 17:06:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:06:51,117 INFO L87 Difference]: Start difference. First operand 495 states and 1310 transitions. Second operand has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 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:06:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:53,082 INFO L93 Difference]: Finished difference Result 1645 states and 4465 transitions. [2025-04-13 17:06:53,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 17:06:53,083 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 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 72 [2025-04-13 17:06:53,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:53,089 INFO L225 Difference]: With dead ends: 1645 [2025-04-13 17:06:53,089 INFO L226 Difference]: Without dead ends: 1393 [2025-04-13 17:06:53,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 108 SyntacticMatches, 23 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5903 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4880, Invalid=12676, Unknown=0, NotChecked=0, Total=17556 [2025-04-13 17:06:53,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1216 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:53,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-04-13 17:06:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 539. [2025-04-13 17:06:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 2.6691449814126393) internal successors, (1436), 538 states have internal predecessors, (1436), 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:06:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1436 transitions. [2025-04-13 17:06:53,112 INFO L79 Accepts]: Start accepts. Automaton has 539 states and 1436 transitions. Word has length 72 [2025-04-13 17:06:53,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:53,112 INFO L485 AbstractCegarLoop]: Abstraction has 539 states and 1436 transitions. [2025-04-13 17:06:53,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 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:06:53,112 INFO L278 IsEmpty]: Start isEmpty. Operand 539 states and 1436 transitions. [2025-04-13 17:06:53,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-13 17:06:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:53,113 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:53,120 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 17:06:53,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:53,314 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:06:53,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -307235491, now seen corresponding path program 5 times [2025-04-13 17:06:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:53,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561395081] [2025-04-13 17:06:53,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:53,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 37 equivalence classes. [2025-04-13 17:06:53,339 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) and asserted 86 of 86 statements. [2025-04-13 17:06:53,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2025-04-13 17:06:53,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:54,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561395081] [2025-04-13 17:06:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561395081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:54,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347422443] [2025-04-13 17:06:54,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:54,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:54,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:54,132 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 17:06:54,133 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 17:06:54,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 37 equivalence classes. [2025-04-13 17:06:54,192 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) and asserted 86 of 86 statements. [2025-04-13 17:06:54,192 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2025-04-13 17:06:54,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:54,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:06:54,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 1 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:54,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347422443] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:55,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2025-04-13 17:06:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090575979] [2025-04-13 17:06:55,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:55,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-04-13 17:06:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-04-13 17:06:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1657, Invalid=5483, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 17:06:55,024 INFO L87 Difference]: Start difference. First operand 539 states and 1436 transitions. Second operand has 85 states, 84 states have (on average 2.0476190476190474) internal successors, (172), 84 states have internal predecessors, (172), 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:06:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:57,153 INFO L93 Difference]: Finished difference Result 1175 states and 3169 transitions. [2025-04-13 17:06:57,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-13 17:06:57,154 INFO L79 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 2.0476190476190474) internal successors, (172), 84 states have internal predecessors, (172), 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 86 [2025-04-13 17:06:57,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:57,159 INFO L225 Difference]: With dead ends: 1175 [2025-04-13 17:06:57,159 INFO L226 Difference]: Without dead ends: 1057 [2025-04-13 17:06:57,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9783 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8039, Invalid=22063, Unknown=0, NotChecked=0, Total=30102 [2025-04-13 17:06:57,162 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1602 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:57,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 3 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-04-13 17:06:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 887. [2025-04-13 17:06:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 2.778781038374718) internal successors, (2462), 886 states have internal predecessors, (2462), 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:06:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2462 transitions. [2025-04-13 17:06:57,180 INFO L79 Accepts]: Start accepts. Automaton has 887 states and 2462 transitions. Word has length 86 [2025-04-13 17:06:57,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:57,181 INFO L485 AbstractCegarLoop]: Abstraction has 887 states and 2462 transitions. [2025-04-13 17:06:57,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 2.0476190476190474) internal successors, (172), 84 states have internal predecessors, (172), 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:06:57,181 INFO L278 IsEmpty]: Start isEmpty. Operand 887 states and 2462 transitions. [2025-04-13 17:06:57,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-04-13 17:06:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:57,183 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:57,192 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 17:06:57,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:57,384 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:06:57,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 571775100, now seen corresponding path program 6 times [2025-04-13 17:06:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:57,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449298242] [2025-04-13 17:06:57,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:06:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:57,389 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 88 statements into 37 equivalence classes. [2025-04-13 17:06:57,428 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) and asserted 88 of 88 statements. [2025-04-13 17:06:57,428 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2025-04-13 17:06:57,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:06:57,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:06:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-13 17:06:57,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-13 17:06:57,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:57,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:06:57,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:06:57,470 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:06:57,471 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:57,472 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:57,472 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:57,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:06:57,475 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1] [2025-04-13 17:06:57,575 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:57,578 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:57,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:57 BasicIcfg [2025-04-13 17:06:57,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:57,581 INFO L158 Benchmark]: Toolchain (without parser) took 16391.73ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 101.0MB in the beginning and 51.1MB in the end (delta: 49.9MB). Peak memory consumption was 84.1MB. Max. memory is 8.0GB. [2025-04-13 17:06:57,581 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:57,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.23ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 78.8MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:57,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.69ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 76.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:57,581 INFO L158 Benchmark]: Boogie Preprocessor took 33.99ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 75.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:57,581 INFO L158 Benchmark]: RCFGBuilder took 299.12ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 54.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:57,582 INFO L158 Benchmark]: TraceAbstraction took 15703.43ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 37.9MB. Max. memory is 8.0GB. [2025-04-13 17:06:57,582 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.15ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.23ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 78.8MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.69ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 76.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.99ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 75.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 299.12ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 54.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 15703.43ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 37.9MB. 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 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=6, k=0] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=6, k=1] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, argc=51, i=7, id1=-1, id2=0, j=6, k=1] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=2] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=2] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=3] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=4] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=4] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=5] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=6] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=7] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=8] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=8] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=9] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=8] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=9] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=11, k=9] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=11] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=12] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=11, k=12] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=11, k=13] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=12, k=13] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=12, k=14] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=14] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=15] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=15] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=16] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=15, k=16] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=15, k=17] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=16, k=17] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=16, k=18] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=18] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=19] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=18, k=19] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 33 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5193 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5193 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 460 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4477 IncrementalHoareTripleChecker+Invalid, 4937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 460 mSolverCounterUnsat, 1 mSDtfsCounter, 4477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 391 SyntacticMatches, 23 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24298 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=10, InterpolantAutomatonStates: 418, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1947 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 654 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 157 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 2810 SizeOfPredicates, 110 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 19/5781 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 proved your program to be incorrect! [2025-04-13 17:06:57,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...